oj.uz

답안 #305635

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
305635 2020-09-23T17:45:34 Z AmineWeslati 벽 칠하기 (APIO20_paint) C++14
51 / 100
 1010 ms 49912 KB 
//Never stop trying
 #include "paint.h"
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef string str;
typedef long long ll;
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 2e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

#define dbg(x) cerr << " - " << #x << " : " << x << endl;
#define dbgs(x,y) cerr << " - " << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << " - " << #v << " : " << endl << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;

void IO() {
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
}

int N,M,K;
vi c(MX);


bool bs[2005][40005];

vi f(MX,-1);

bitset<MX> pos;


void check(){
	FOR(j,0,M){
		bool mismatch[N]; FOR(i,0,N) mismatch[i]=false;
		int nb=0;
		FOR(i,0,N){
			//if(s[(i+j)%M].count(c[i])==0) mismatch[i]=true,nb++;
			if(bs[(i+j)%M][c[i]]==0) mismatch[i]=true,nb++;
			if(i>=M-1){
				if(nb==0) pos[i-M+1]=true;
				if(mismatch[i-M+1]==true) nb--;
			}
			
		}
	}
}


bool check2(){
	FOR(i,0,N){
		assert(c[i]>=0 && c[i]<=1e5+10);
		c[i]=f[c[i]];
	} 

	deque<int> d;
	int mismatch[N]; FOR(i,0,N) mismatch[i]=false;
	int nb=0;
	FOR(i,0,N){
		if(!d.empty() && ((d.back()+1)%M!=c[i]||d.back()==-1)){
			nb++; mismatch[i]=true;
		}
		if(i<M-1) continue;
		if(nb==0) pos[i-M+1]=true;
		d.pb(c[i]);
		if(mismatch[i-M+1]) nb--;
	}
}

int minimumInstructions(int NN, int MM, int KK, vi CC, vi AA, V<vi>B){
	N=NN; M=MM; K=KK;
	FOR(i,0,N) c[i]=CC[i];

	if(N<=20000 && M<=2000){
		unordered_map<int,int> mp; int cnt=0;
		FOR(i,0,N){
			if(!mp.count(c[i])) mp[c[i]]=cnt++;
			c[i]=mp[c[i]];
		}
		assert(cnt<=N);

		FOR(i,0,M){
			FOR(j,0,AA[i]){
				int x=B[i][j];
				if(mp.count(x)==false) continue;
				x=mp[x];
				bs[i][x]=1;
				//s[i].insert(x),f[B[i][j]]++;
			}
		}
		check();
	}
	else{
		FOR(i,0,M){
			FOR(j,0,AA[i]){
				int x=B[i][j];
				assert(x>=0 && x<=1e5+10);
				f[x]=i;
				//s[i].insert(x),f[B[i][j]]++;
			}
		}
		check2();
	}


	if(!pos[0]) return -1;

	ll ans=0;
	for(int i=0; i<N; ){
		if(pos[i]){
			i+=M;
			ans++;
		}
		else{
			int j=i; bool y=false;
			while(j>i-M){
				if(pos[j]){y=true; break;}
				j--;
			}
			if(!y) return -1;
			ans++;
			i=j+M;
		}
	}
	assert(ans<=N-M+1);
	return ans;
}


//1273
/*
8 3 5 
3 3 1 3 4 4 2 2
3 2 2 
0 1 2	
2 3
3 4

3
*/


/*
5 4 4 
1 0 1 2 2
2 1 1 1 
0 1
1 
2 
3

*/

/* Careful!!!
	.Array bounds
	.Infinite loops
	.Uninitialized variables / empty containers
	.Order of input

   Some insights:
	.Binary search
	.Graph representation
	.Write brute force code
	.Change your approach
*/

Compilation message

paint.cpp:4: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    4 | #pragma GCC optimization ("O3")
      | 
paint.cpp:5: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    5 | #pragma GCC optimization ("unroll-loops")
      | 
paint.cpp: In function 'void IO()':
paint.cpp:50:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   50 |  freopen("input.txt", "r", stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
paint.cpp:51:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   51 |  freopen("output.txt", "w", stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
paint.cpp: In function 'bool check2()':
paint.cpp:89:13: warning: control reaches end of non-void function [-Wreturn-type]
   89 |  deque<int> d;
      |             ^

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1920 KB Output is correct
2 Correct 2 ms 1920 KB Output is correct
3 Correct 2 ms 1920 KB Output is correct
4 Correct 2 ms 1920 KB Output is correct
5 Correct 2 ms 1920 KB Output is correct
6 Correct 2 ms 1920 KB Output is correct
7 Correct 2 ms 1920 KB Output is correct
8 Correct 2 ms 1920 KB Output is correct
9 Correct 2 ms 1920 KB Output is correct
10 Correct 2 ms 1920 KB Output is correct
11 Correct 3 ms 2048 KB Output is correct
12 Correct 2 ms 1920 KB Output is correct
13 Correct 3 ms 2816 KB Output is correct
14 Correct 3 ms 2816 KB Output is correct
15 Correct 3 ms 2816 KB Output is correct
16 Correct 3 ms 2816 KB Output is correct
17 Correct 3 ms 2816 KB Output is correct
18 Correct 3 ms 2816 KB Output is correct
19 Correct 3 ms 2048 KB Output is correct
20 Correct 3 ms 2048 KB Output is correct
21 Correct 3 ms 2048 KB Output is correct
22 Correct 21 ms 3960 KB Output is correct
23 Correct 21 ms 3968 KB Output is correct
24 Correct 21 ms 3968 KB Output is correct
25 Correct 4 ms 2048 KB Output is correct
26 Correct 4 ms 2048 KB Output is correct
27 Correct 5 ms 2048 KB Output is correct
28 Correct 5 ms 2176 KB Output is correct
29 Correct 5 ms 2176 KB Output is correct
30 Correct 6 ms 2176 KB Output is correct
31 Correct 716 ms 46840 KB Output is correct
32 Correct 766 ms 46828 KB Output is correct
33 Correct 723 ms 46836 KB Output is correct
34 Correct 723 ms 46840 KB Output is correct
35 Correct 728 ms 46840 KB Output is correct
36 Correct 751 ms 46840 KB Output is correct
37 Correct 838 ms 37712 KB Output is correct
38 Correct 837 ms 37624 KB Output is correct
39 Correct 818 ms 37624 KB Output is correct
40 Runtime error 26 ms 6280 KB Execution killed with signal 11 (could be triggered by violating memory limits)
41 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1964 KB Output is correct
2 Correct 2 ms 1920 KB Output is correct
3 Correct 2 ms 1920 KB Output is correct
4 Correct 2 ms 1920 KB Output is correct
5 Correct 2 ms 1920 KB Output is correct
6 Correct 2 ms 1920 KB Output is correct
7 Correct 2 ms 1920 KB Output is correct
8 Correct 2 ms 1920 KB Output is correct
9 Correct 2 ms 1920 KB Output is correct
10 Correct 2 ms 1920 KB Output is correct
11 Correct 2 ms 1920 KB Output is correct
12 Correct 2 ms 1920 KB Output is correct
13 Correct 3 ms 2048 KB Output is correct
14 Correct 2 ms 1920 KB Output is correct
15 Correct 3 ms 2816 KB Output is correct
16 Correct 3 ms 2816 KB Output is correct
17 Correct 3 ms 2816 KB Output is correct
18 Correct 3 ms 2816 KB Output is correct
19 Correct 3 ms 2816 KB Output is correct
20 Correct 3 ms 2816 KB Output is correct
21 Correct 3 ms 2048 KB Output is correct
22 Correct 3 ms 2048 KB Output is correct
23 Correct 3 ms 2048 KB Output is correct
24 Correct 1 ms 1920 KB Output is correct
25 Correct 1 ms 1920 KB Output is correct
26 Correct 2 ms 1920 KB Output is correct
27 Correct 2 ms 1920 KB Output is correct
28 Correct 2 ms 2048 KB Output is correct
29 Correct 2 ms 2048 KB Output is correct
30 Correct 2 ms 2048 KB Output is correct
31 Correct 2 ms 1920 KB Output is correct
32 Correct 2 ms 2048 KB Output is correct
33 Correct 3 ms 2688 KB Output is correct
34 Correct 3 ms 2688 KB Output is correct
35 Correct 2 ms 2432 KB Output is correct
36 Correct 3 ms 2560 KB Output is correct
37 Correct 3 ms 2688 KB Output is correct
38 Correct 2 ms 1920 KB Output is correct
39 Correct 2 ms 1920 KB Output is correct
40 Correct 3 ms 1920 KB Output is correct
41 Correct 3 ms 2560 KB Output is correct
42 Correct 2 ms 1920 KB Output is correct
43 Correct 2 ms 2176 KB Output is correct
44 Correct 2 ms 1920 KB Output is correct
45 Correct 2 ms 2048 KB Output is correct
46 Correct 2 ms 2048 KB Output is correct
47 Correct 2 ms 2176 KB Output is correct
48 Correct 2 ms 2176 KB Output is correct
49 Correct 2 ms 2176 KB Output is correct
50 Correct 3 ms 2816 KB Output is correct
51 Correct 3 ms 2816 KB Output is correct
52 Correct 3 ms 2816 KB Output is correct
53 Correct 3 ms 2816 KB Output is correct
54 Correct 3 ms 2816 KB Output is correct
55 Correct 3 ms 2816 KB Output is correct
56 Correct 3 ms 2048 KB Output is correct
57 Correct 3 ms 2816 KB Output is correct
58 Correct 3 ms 2048 KB Output is correct
59 Correct 3 ms 2816 KB Output is correct
60 Correct 3 ms 1920 KB Output is correct
61 Correct 3 ms 2816 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1964 KB Output is correct
2 Correct 2 ms 1920 KB Output is correct
3 Correct 2 ms 1920 KB Output is correct
4 Correct 2 ms 1920 KB Output is correct
5 Correct 2 ms 1920 KB Output is correct
6 Correct 2 ms 1920 KB Output is correct
7 Correct 2 ms 1920 KB Output is correct
8 Correct 2 ms 1920 KB Output is correct
9 Correct 2 ms 1920 KB Output is correct
10 Correct 2 ms 1920 KB Output is correct
11 Correct 2 ms 1920 KB Output is correct
12 Correct 2 ms 1920 KB Output is correct
13 Correct 3 ms 2048 KB Output is correct
14 Correct 2 ms 1920 KB Output is correct
15 Correct 3 ms 2816 KB Output is correct
16 Correct 3 ms 2816 KB Output is correct
17 Correct 3 ms 2816 KB Output is correct
18 Correct 3 ms 2816 KB Output is correct
19 Correct 3 ms 2816 KB Output is correct
20 Correct 3 ms 2816 KB Output is correct
21 Correct 3 ms 2048 KB Output is correct
22 Correct 3 ms 2048 KB Output is correct
23 Correct 3 ms 2048 KB Output is correct
24 Correct 21 ms 3960 KB Output is correct
25 Correct 21 ms 3968 KB Output is correct
26 Correct 21 ms 3968 KB Output is correct
27 Correct 1 ms 1920 KB Output is correct
28 Correct 1 ms 1920 KB Output is correct
29 Correct 2 ms 1920 KB Output is correct
30 Correct 2 ms 1920 KB Output is correct
31 Correct 2 ms 2048 KB Output is correct
32 Correct 2 ms 2048 KB Output is correct
33 Correct 2 ms 2048 KB Output is correct
34 Correct 2 ms 1920 KB Output is correct
35 Correct 2 ms 2048 KB Output is correct
36 Correct 3 ms 2688 KB Output is correct
37 Correct 3 ms 2688 KB Output is correct
38 Correct 2 ms 2432 KB Output is correct
39 Correct 3 ms 2560 KB Output is correct
40 Correct 3 ms 2688 KB Output is correct
41 Correct 2 ms 1920 KB Output is correct
42 Correct 2 ms 1920 KB Output is correct
43 Correct 3 ms 1920 KB Output is correct
44 Correct 3 ms 2560 KB Output is correct
45 Correct 2 ms 1920 KB Output is correct
46 Correct 2 ms 2176 KB Output is correct
47 Correct 2 ms 1920 KB Output is correct
48 Correct 2 ms 2048 KB Output is correct
49 Correct 2 ms 2048 KB Output is correct
50 Correct 2 ms 2176 KB Output is correct
51 Correct 2 ms 2176 KB Output is correct
52 Correct 2 ms 2176 KB Output is correct
53 Correct 3 ms 2816 KB Output is correct
54 Correct 3 ms 2816 KB Output is correct
55 Correct 3 ms 2816 KB Output is correct
56 Correct 3 ms 2816 KB Output is correct
57 Correct 3 ms 2816 KB Output is correct
58 Correct 3 ms 2816 KB Output is correct
59 Correct 3 ms 2048 KB Output is correct
60 Correct 3 ms 2816 KB Output is correct
61 Correct 3 ms 2048 KB Output is correct
62 Correct 3 ms 2816 KB Output is correct
63 Correct 3 ms 1920 KB Output is correct
64 Correct 3 ms 2816 KB Output is correct
65 Correct 2 ms 2688 KB Output is correct
66 Correct 2 ms 2048 KB Output is correct
67 Correct 3 ms 2432 KB Output is correct
68 Correct 2 ms 2176 KB Output is correct
69 Correct 2 ms 2432 KB Output is correct
70 Correct 5 ms 2944 KB Output is correct
71 Correct 6 ms 2816 KB Output is correct
72 Correct 4 ms 2432 KB Output is correct
73 Correct 3 ms 2048 KB Output is correct
74 Correct 5 ms 2560 KB Output is correct
75 Correct 5 ms 2816 KB Output is correct
76 Correct 22 ms 3704 KB Output is correct
77 Correct 24 ms 3328 KB Output is correct
78 Correct 28 ms 3832 KB Output is correct
79 Correct 3 ms 2688 KB Output is correct
80 Correct 3 ms 2688 KB Output is correct
81 Correct 3 ms 2688 KB Output is correct
82 Correct 3 ms 2688 KB Output is correct
83 Correct 3 ms 2688 KB Output is correct
84 Correct 6 ms 3072 KB Output is correct
85 Correct 6 ms 3064 KB Output is correct
86 Correct 6 ms 3072 KB Output is correct
87 Correct 6 ms 3000 KB Output is correct
88 Correct 6 ms 3072 KB Output is correct
89 Correct 6 ms 3072 KB Output is correct
90 Correct 31 ms 4600 KB Output is correct
91 Correct 32 ms 4600 KB Output is correct
92 Correct 32 ms 4728 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1964 KB Output is correct
2 Correct 2 ms 1920 KB Output is correct
3 Correct 2 ms 1920 KB Output is correct
4 Correct 2 ms 1920 KB Output is correct
5 Correct 2 ms 1920 KB Output is correct
6 Correct 2 ms 1920 KB Output is correct
7 Correct 2 ms 1920 KB Output is correct
8 Correct 2 ms 1920 KB Output is correct
9 Correct 2 ms 1920 KB Output is correct
10 Correct 2 ms 1920 KB Output is correct
11 Correct 2 ms 1920 KB Output is correct
12 Correct 2 ms 1920 KB Output is correct
13 Correct 3 ms 2048 KB Output is correct
14 Correct 2 ms 1920 KB Output is correct
15 Correct 3 ms 2816 KB Output is correct
16 Correct 3 ms 2816 KB Output is correct
17 Correct 3 ms 2816 KB Output is correct
18 Correct 3 ms 2816 KB Output is correct
19 Correct 3 ms 2816 KB Output is correct
20 Correct 3 ms 2816 KB Output is correct
21 Correct 3 ms 2048 KB Output is correct
22 Correct 3 ms 2048 KB Output is correct
23 Correct 3 ms 2048 KB Output is correct
24 Correct 21 ms 3960 KB Output is correct
25 Correct 21 ms 3968 KB Output is correct
26 Correct 21 ms 3968 KB Output is correct
27 Correct 4 ms 2048 KB Output is correct
28 Correct 4 ms 2048 KB Output is correct
29 Correct 5 ms 2048 KB Output is correct
30 Correct 5 ms 2176 KB Output is correct
31 Correct 5 ms 2176 KB Output is correct
32 Correct 6 ms 2176 KB Output is correct
33 Correct 716 ms 46840 KB Output is correct
34 Correct 766 ms 46828 KB Output is correct
35 Correct 723 ms 46836 KB Output is correct
36 Correct 723 ms 46840 KB Output is correct
37 Correct 728 ms 46840 KB Output is correct
38 Correct 751 ms 46840 KB Output is correct
39 Correct 838 ms 37712 KB Output is correct
40 Correct 837 ms 37624 KB Output is correct
41 Correct 818 ms 37624 KB Output is correct
42 Correct 1 ms 1920 KB Output is correct
43 Correct 1 ms 1920 KB Output is correct
44 Correct 2 ms 1920 KB Output is correct
45 Correct 2 ms 1920 KB Output is correct
46 Correct 2 ms 2048 KB Output is correct
47 Correct 2 ms 2048 KB Output is correct
48 Correct 2 ms 2048 KB Output is correct
49 Correct 2 ms 1920 KB Output is correct
50 Correct 2 ms 2048 KB Output is correct
51 Correct 3 ms 2688 KB Output is correct
52 Correct 3 ms 2688 KB Output is correct
53 Correct 2 ms 2432 KB Output is correct
54 Correct 3 ms 2560 KB Output is correct
55 Correct 3 ms 2688 KB Output is correct
56 Correct 2 ms 1920 KB Output is correct
57 Correct 2 ms 1920 KB Output is correct
58 Correct 3 ms 1920 KB Output is correct
59 Correct 3 ms 2560 KB Output is correct
60 Correct 2 ms 1920 KB Output is correct
61 Correct 2 ms 2176 KB Output is correct
62 Correct 2 ms 1920 KB Output is correct
63 Correct 2 ms 2048 KB Output is correct
64 Correct 2 ms 2048 KB Output is correct
65 Correct 2 ms 2176 KB Output is correct
66 Correct 2 ms 2176 KB Output is correct
67 Correct 2 ms 2176 KB Output is correct
68 Correct 3 ms 2816 KB Output is correct
69 Correct 3 ms 2816 KB Output is correct
70 Correct 3 ms 2816 KB Output is correct
71 Correct 3 ms 2816 KB Output is correct
72 Correct 3 ms 2816 KB Output is correct
73 Correct 3 ms 2816 KB Output is correct
74 Correct 3 ms 2048 KB Output is correct
75 Correct 3 ms 2816 KB Output is correct
76 Correct 3 ms 2048 KB Output is correct
77 Correct 3 ms 2816 KB Output is correct
78 Correct 3 ms 1920 KB Output is correct
79 Correct 3 ms 2816 KB Output is correct
80 Correct 2 ms 2688 KB Output is correct
81 Correct 2 ms 2048 KB Output is correct
82 Correct 3 ms 2432 KB Output is correct
83 Correct 2 ms 2176 KB Output is correct
84 Correct 2 ms 2432 KB Output is correct
85 Correct 5 ms 2944 KB Output is correct
86 Correct 6 ms 2816 KB Output is correct
87 Correct 4 ms 2432 KB Output is correct
88 Correct 3 ms 2048 KB Output is correct
89 Correct 5 ms 2560 KB Output is correct
90 Correct 5 ms 2816 KB Output is correct
91 Correct 22 ms 3704 KB Output is correct
92 Correct 24 ms 3328 KB Output is correct
93 Correct 28 ms 3832 KB Output is correct
94 Correct 3 ms 2688 KB Output is correct
95 Correct 3 ms 2688 KB Output is correct
96 Correct 3 ms 2688 KB Output is correct
97 Correct 3 ms 2688 KB Output is correct
98 Correct 3 ms 2688 KB Output is correct
99 Correct 6 ms 3072 KB Output is correct
100 Correct 6 ms 3064 KB Output is correct
101 Correct 6 ms 3072 KB Output is correct
102 Correct 6 ms 3000 KB Output is correct
103 Correct 6 ms 3072 KB Output is correct
104 Correct 6 ms 3072 KB Output is correct
105 Correct 31 ms 4600 KB Output is correct
106 Correct 32 ms 4600 KB Output is correct
107 Correct 32 ms 4728 KB Output is correct
108 Correct 4 ms 2048 KB Output is correct
109 Correct 63 ms 4700 KB Output is correct
110 Correct 117 ms 4856 KB Output is correct
111 Correct 119 ms 4864 KB Output is correct
112 Correct 158 ms 5180 KB Output is correct
113 Correct 126 ms 6016 KB Output is correct
114 Correct 181 ms 17788 KB Output is correct
115 Correct 23 ms 4088 KB Output is correct
116 Correct 208 ms 19704 KB Output is correct
117 Correct 114 ms 13184 KB Output is correct
118 Correct 30 ms 4860 KB Output is correct
119 Correct 349 ms 29036 KB Output is correct
120 Correct 456 ms 26872 KB Output is correct
121 Correct 568 ms 21376 KB Output is correct
122 Correct 122 ms 11640 KB Output is correct
123 Correct 100 ms 8576 KB Output is correct
124 Correct 61 ms 7544 KB Output is correct
125 Correct 37 ms 5376 KB Output is correct
126 Correct 14 ms 3584 KB Output is correct
127 Correct 145 ms 14976 KB Output is correct
128 Correct 27 ms 5248 KB Output is correct
129 Correct 37 ms 6272 KB Output is correct
130 Correct 5 ms 2176 KB Output is correct
131 Correct 87 ms 4820 KB Output is correct
132 Correct 244 ms 5624 KB Output is correct
133 Correct 266 ms 6008 KB Output is correct
134 Correct 265 ms 6272 KB Output is correct
135 Correct 256 ms 6648 KB Output is correct
136 Correct 690 ms 49912 KB Output is correct
137 Correct 686 ms 49528 KB Output is correct
138 Correct 700 ms 49528 KB Output is correct
139 Correct 702 ms 49144 KB Output is correct
140 Correct 703 ms 49528 KB Output is correct
141 Correct 676 ms 49912 KB Output is correct
142 Correct 830 ms 42456 KB Output is correct
143 Correct 1010 ms 32120 KB Output is correct
144 Correct 794 ms 42744 KB Output is correct
145 Correct 989 ms 31992 KB Output is correct
146 Correct 822 ms 42744 KB Output is correct
147 Correct 1010 ms 31992 KB Output is correct
148 Correct 666 ms 47352 KB Output is correct
149 Correct 292 ms 26104 KB Output is correct
150 Correct 194 ms 18936 KB Output is correct
151 Correct 148 ms 15096 KB Output is correct

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1964 KB Output is correct
2 Correct 2 ms 1920 KB Output is correct
3 Correct 2 ms 1920 KB Output is correct
4 Correct 2 ms 1920 KB Output is correct
5 Correct 2 ms 1920 KB Output is correct
6 Correct 2 ms 1920 KB Output is correct
7 Correct 2 ms 1920 KB Output is correct
8 Correct 2 ms 1920 KB Output is correct
9 Correct 2 ms 1920 KB Output is correct
10 Correct 2 ms 1920 KB Output is correct
11 Correct 2 ms 1920 KB Output is correct
12 Correct 2 ms 1920 KB Output is correct
13 Correct 3 ms 2048 KB Output is correct
14 Correct 2 ms 1920 KB Output is correct
15 Correct 3 ms 2816 KB Output is correct
16 Correct 3 ms 2816 KB Output is correct
17 Correct 3 ms 2816 KB Output is correct
18 Correct 3 ms 2816 KB Output is correct
19 Correct 3 ms 2816 KB Output is correct
20 Correct 3 ms 2816 KB Output is correct
21 Correct 3 ms 2048 KB Output is correct
22 Correct 3 ms 2048 KB Output is correct
23 Correct 3 ms 2048 KB Output is correct
24 Correct 21 ms 3960 KB Output is correct
25 Correct 21 ms 3968 KB Output is correct
26 Correct 21 ms 3968 KB Output is correct
27 Correct 4 ms 2048 KB Output is correct
28 Correct 4 ms 2048 KB Output is correct
29 Correct 5 ms 2048 KB Output is correct
30 Correct 5 ms 2176 KB Output is correct
31 Correct 5 ms 2176 KB Output is correct
32 Correct 6 ms 2176 KB Output is correct
33 Correct 716 ms 46840 KB Output is correct
34 Correct 766 ms 46828 KB Output is correct
35 Correct 723 ms 46836 KB Output is correct
36 Correct 723 ms 46840 KB Output is correct
37 Correct 728 ms 46840 KB Output is correct
38 Correct 751 ms 46840 KB Output is correct
39 Correct 838 ms 37712 KB Output is correct
40 Correct 837 ms 37624 KB Output is correct
41 Correct 818 ms 37624 KB Output is correct
42 Runtime error 26 ms 6280 KB Execution killed with signal 11 (could be triggered by violating memory limits)
43 Halted 0 ms 0 KB -