Submission #4636207


Source Code Expand

//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <fstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
#include <limits>

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }

//math
//-------------------------------------------
template<class T> inline T sqr(T x) { return x * x; }

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define EXISTch(s,c) ((((s).find_first_of(c)) != std::string::npos)? 1 : 0)//cがあれば1 if(1)
#define SORT(c) sort((c).begin(),(c).end())

#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = (int)1000000007;
const LL MOD = (LL)1000000007;//10^9+7
const LL INF2 = (LL)100000000000000000;//10^18


int main() {
	int n; cin >> n;
	
	vector<int> a(n);

	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	
	vector<int> tb(n,INF);
	
	for (int i = 0; i < n; i++) {
		*lower_bound(tb.begin(), tb.end(), a[i]) = a[i];
	}

	int ans = n - (lower_bound(tb.begin(), tb.end(), INF) - tb.begin());
	cout << ans << endl;

	return 0;
}

Submission Info

Submission Time
Task D - トランプ挿入ソート
User poporo
Language C++14 (GCC 5.4.1)
Score 100
Code Size 2283 Byte
Status AC
Exec Time 11 ms
Memory 512 KB

Judge Result

Set Name smallA smallB all
Score / Max Score 10 / 10 40 / 40 50 / 50
Status
AC × 19
AC × 37
AC × 55
Set Name Test Cases
smallA test_01_ABC.txt, test_04_ABC.txt, test_07_ABC.txt, test_10_ABC.txt, test_13_ABC.txt, test_16_ABC.txt, test_19_ABC.txt, test_22_ABC.txt, test_25_ABC.txt, test_28_ABC.txt, test_31_ABC.txt, test_32_ABC.txt, test_35_ABC.txt, test_38_ABC.txt, test_41_ABC.txt, test_44_ABC.txt, test_47_ABC.txt, test_50_ABC.txt, test_53_ABC.txt
smallB test_01_ABC.txt, test_02_AB.txt, test_04_ABC.txt, test_05_AB.txt, test_07_ABC.txt, test_08_AB.txt, test_10_ABC.txt, test_11_AB.txt, test_13_ABC.txt, test_14_AB.txt, test_16_ABC.txt, test_17_AB.txt, test_19_ABC.txt, test_20_AB.txt, test_22_ABC.txt, test_23_AB.txt, test_25_ABC.txt, test_26_AB.txt, test_28_ABC.txt, test_29_AB.txt, test_31_ABC.txt, test_32_ABC.txt, test_33_AB.txt, test_35_ABC.txt, test_36_AB.txt, test_38_ABC.txt, test_39_AB.txt, test_41_ABC.txt, test_42_AB.txt, test_44_ABC.txt, test_45_AB.txt, test_47_ABC.txt, test_48_AB.txt, test_50_ABC.txt, test_51_AB.txt, test_53_ABC.txt, test_54_AB.txt
all test_01_ABC.txt, test_02_AB.txt, test_03_A.txt, test_04_ABC.txt, test_05_AB.txt, test_06_A.txt, test_07_ABC.txt, test_08_AB.txt, test_09_A.txt, test_10_ABC.txt, test_11_AB.txt, test_12_A.txt, test_13_ABC.txt, test_14_AB.txt, test_15_A.txt, test_16_ABC.txt, test_17_AB.txt, test_18_A.txt, test_19_ABC.txt, test_20_AB.txt, test_21_A.txt, test_22_ABC.txt, test_23_AB.txt, test_24_A.txt, test_25_ABC.txt, test_26_AB.txt, test_27_A.txt, test_28_ABC.txt, test_29_AB.txt, test_30_A.txt, test_31_ABC.txt, test_32_ABC.txt, test_33_AB.txt, test_34_A.txt, test_35_ABC.txt, test_36_AB.txt, test_37_A.txt, test_38_ABC.txt, test_39_AB.txt, test_40_A.txt, test_41_ABC.txt, test_42_AB.txt, test_43_A.txt, test_44_ABC.txt, test_45_AB.txt, test_46_A.txt, test_47_ABC.txt, test_48_AB.txt, test_49_A.txt, test_50_ABC.txt, test_51_AB.txt, test_52_A.txt, test_53_ABC.txt, test_54_AB.txt, test_55_A.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
test_01_ABC.txt AC 1 ms 256 KB
test_02_AB.txt AC 2 ms 256 KB
test_03_A.txt AC 11 ms 512 KB
test_04_ABC.txt AC 1 ms 256 KB
test_05_AB.txt AC 1 ms 256 KB
test_06_A.txt AC 2 ms 256 KB
test_07_ABC.txt AC 1 ms 256 KB
test_08_AB.txt AC 2 ms 256 KB
test_09_A.txt AC 11 ms 512 KB
test_10_ABC.txt AC 1 ms 256 KB
test_11_AB.txt AC 1 ms 256 KB
test_12_A.txt AC 6 ms 384 KB
test_13_ABC.txt AC 1 ms 256 KB
test_14_AB.txt AC 2 ms 256 KB
test_15_A.txt AC 11 ms 512 KB
test_16_ABC.txt AC 1 ms 256 KB
test_17_AB.txt AC 1 ms 256 KB
test_18_A.txt AC 2 ms 256 KB
test_19_ABC.txt AC 1 ms 256 KB
test_20_AB.txt AC 2 ms 256 KB
test_21_A.txt AC 11 ms 512 KB
test_22_ABC.txt AC 2 ms 256 KB
test_23_AB.txt AC 1 ms 256 KB
test_24_A.txt AC 9 ms 384 KB
test_25_ABC.txt AC 1 ms 256 KB
test_26_AB.txt AC 2 ms 256 KB
test_27_A.txt AC 11 ms 512 KB
test_28_ABC.txt AC 1 ms 256 KB
test_29_AB.txt AC 1 ms 256 KB
test_30_A.txt AC 9 ms 384 KB
test_31_ABC.txt AC 1 ms 256 KB
test_32_ABC.txt AC 1 ms 256 KB
test_33_AB.txt AC 2 ms 256 KB
test_34_A.txt AC 11 ms 512 KB
test_35_ABC.txt AC 1 ms 256 KB
test_36_AB.txt AC 2 ms 256 KB
test_37_A.txt AC 3 ms 256 KB
test_38_ABC.txt AC 1 ms 256 KB
test_39_AB.txt AC 1 ms 256 KB
test_40_A.txt AC 10 ms 512 KB
test_41_ABC.txt AC 1 ms 256 KB
test_42_AB.txt AC 1 ms 256 KB
test_43_A.txt AC 2 ms 256 KB
test_44_ABC.txt AC 1 ms 256 KB
test_45_AB.txt AC 2 ms 256 KB
test_46_A.txt AC 11 ms 512 KB
test_47_ABC.txt AC 1 ms 256 KB
test_48_AB.txt AC 1 ms 256 KB
test_49_A.txt AC 2 ms 256 KB
test_50_ABC.txt AC 1 ms 256 KB
test_51_AB.txt AC 2 ms 256 KB
test_52_A.txt AC 10 ms 512 KB
test_53_ABC.txt AC 1 ms 256 KB
test_54_AB.txt AC 1 ms 256 KB
test_55_A.txt AC 10 ms 512 KB