oj.uz

답안 #738004

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
738004 2023-05-08T05:00:51 Z shadow_sami 벽 칠하기 (APIO20_paint) C++17
51 / 100
 199 ms 325672 KB 
#include "paint.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif

// void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 2e4+5;
const ll mx2 = 2e3+5;
const ll m32 = 1e5+5;
const ll mod = 1e9+7;

// // ==========================(MOD)=============================================================================================== //

// ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
// ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
// ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
// ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
// ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// // ==========================(MOD)=============================================================================================== //

bool f = false;
vi color[m32];
ll possible[mx][mx2];
ll dp[mx];
vector<pi> v;

ll calc(ll a){
	return ((a + m - 1) % m);
}

typedef struct SEGMENT_TREE{
	vi arr;
	ll range;
	void init(ll k){
		range = log2(k);
		range = 1 << (range + 3);
		arr.resize(range,1e9);
		return ;
	}
	ll construct(ll ptr,ll l,ll r){
		if(l==r){
			arr[ptr] = 1e9;
			return arr[ptr];
		}
		ll mid = l + (r-l)/2;
		arr[ptr] = min(construct(2*ptr,l,mid),construct(2*ptr+1,mid+1,r));
		return arr[ptr];
	}
	ll query(ll ptr,ll l,ll r,ll st,ll en){
		if(l>en || r<st)
			return 1e9;
		if(l>=st && r<=en)
			return arr[ptr];
		ll mid = l + (r-l)/2;
		return min(query(2*ptr,l,mid,st,en),query(2*ptr+1,mid+1,r,st,en));
	}
	ll update(ll ptr,ll l,ll r,ll value,ll pos){
		if(l==r && l==pos){
			arr[ptr] = value;
			return arr[ptr];
		}			
		if(l>pos || r<pos)
			return arr[ptr];
		ll mid = l + (r-l)/2;
		arr[ptr] = min(update(2*ptr,l,mid,value,pos),update(2*ptr+1,mid+1,r,value,pos));
		return arr[ptr];
	}
}SGT;

SGT sgt;

int minimumInstructions(int N, int M, int K,vector<int> C,vector<int> A,vector<vector<int>> B) {

	n = N,m = M,tp = K;
	fip(0,m){
		fx(B[i]){
			color[x].push_back(i);
		}
	}
	// fip(0,tp)
	// 	cout<<color[i].size()<<nli;

	memset(possible,0,sizeof(possible));
	fip(0,n){
		f = 1;
		fx(color[C[i]]){
			if(i==0)
				possible[i][x] = 1;
			else
				possible[i][x] = possible[i-1][calc(x)] + 1;
			// debug(i);
			// debug(x);
			// debug(possible[i][x]);
			if(possible[i][x]>=m && i-m+1>=0){
				if(f){
					f = 0;
					v.push_back({i-m+1,i});
				}
			}
		}
	}
	fip(0,n+1){
		dp[i] = 1e9;
	}
	// cout<<v.size()<<nli;
	srt(v);
	// debug(v);
	sgt.init(n);
	sgt.construct(1,0,n-1);
	fx(v){
		ll l = x.ff;
		ll r = x.ss;
		if(l==0)
			dp[r] = 1;
		else
			dp[r] = min(dp[r],sgt.query(1,0,n-1,l-1,r)+1);
		sgt.update(1,0,n-1,dp[r],r);
	}
	// cout<<"OK";
	if(dp[n-1]>n)
		return -1;
	else return dp[n-1];
}


// int main(){
//     ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//     #ifndef ONLINE_JUDGE
//         freopen("input1.txt", "r", stdin);
//         freopen("output1.txt", "w", stdout);
//         freopen("error1.txt", "w", stderr);
//     #endif // ONLINE_JUDGE

//         int N,M,K;
//         cin>>N>>M>>K;
//         vector<int> C,A;
//         vector<vector<int>> B(M);        
//         fip(0,N){
//         	cin>>tp;
//         	C.push_back(tp);
//         }
//         fip(0,M){
//         	cin>>tp;
//         	A.push_back(tp);
//         	// cin>>tp;
//         	// debug(tp);
//         	fjp(0,tp){
//         		cin>>tp2;
//         		// debug(tp2);
//         		B[i].push_back(tp2);
//         		// debug(B[i]);
//         	}
//         }
//         cout<<minimumInstructions(N,M,K,C,A,B);

        
//     cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
//     return 0;
// }

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 159580 KB Output is correct
2 Correct 61 ms 159528 KB Output is correct
3 Correct 62 ms 159588 KB Output is correct
4 Correct 58 ms 159588 KB Output is correct
5 Correct 60 ms 159520 KB Output is correct
6 Correct 57 ms 159628 KB Output is correct
7 Correct 60 ms 159540 KB Output is correct
8 Correct 58 ms 159584 KB Output is correct
9 Correct 59 ms 159568 KB Output is correct
10 Correct 61 ms 159692 KB Output is correct
11 Correct 60 ms 159576 KB Output is correct
12 Correct 65 ms 159632 KB Output is correct
13 Correct 60 ms 159564 KB Output is correct
14 Correct 59 ms 159652 KB Output is correct
15 Correct 60 ms 159640 KB Output is correct
16 Correct 59 ms 159616 KB Output is correct
17 Correct 59 ms 159580 KB Output is correct
18 Correct 60 ms 159620 KB Output is correct
19 Correct 59 ms 159696 KB Output is correct
20 Correct 61 ms 159688 KB Output is correct
21 Correct 60 ms 159696 KB Output is correct
22 Correct 75 ms 164128 KB Output is correct
23 Correct 77 ms 164116 KB Output is correct
24 Correct 76 ms 164096 KB Output is correct
25 Correct 65 ms 160628 KB Output is correct
26 Correct 67 ms 160608 KB Output is correct
27 Correct 65 ms 160612 KB Output is correct
28 Correct 62 ms 160460 KB Output is correct
29 Correct 61 ms 160356 KB Output is correct
30 Correct 61 ms 160332 KB Output is correct
31 Correct 76 ms 161708 KB Output is correct
32 Correct 72 ms 161792 KB Output is correct
33 Correct 71 ms 161736 KB Output is correct
34 Correct 74 ms 161808 KB Output is correct
35 Correct 74 ms 161808 KB Output is correct
36 Correct 75 ms 161692 KB Output is correct
37 Correct 81 ms 165052 KB Output is correct
38 Correct 83 ms 165088 KB Output is correct
39 Correct 95 ms 165032 KB Output is correct
40 Runtime error 199 ms 325672 KB Execution killed with signal 11
41 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 159580 KB Output is correct
2 Correct 61 ms 159528 KB Output is correct
3 Correct 62 ms 159588 KB Output is correct
4 Correct 58 ms 159588 KB Output is correct
5 Correct 60 ms 159520 KB Output is correct
6 Correct 57 ms 159628 KB Output is correct
7 Correct 60 ms 159540 KB Output is correct
8 Correct 58 ms 159584 KB Output is correct
9 Correct 59 ms 159568 KB Output is correct
10 Correct 61 ms 159692 KB Output is correct
11 Correct 60 ms 159576 KB Output is correct
12 Correct 65 ms 159632 KB Output is correct
13 Correct 60 ms 159564 KB Output is correct
14 Correct 59 ms 159652 KB Output is correct
15 Correct 60 ms 159640 KB Output is correct
16 Correct 59 ms 159616 KB Output is correct
17 Correct 59 ms 159580 KB Output is correct
18 Correct 60 ms 159620 KB Output is correct
19 Correct 59 ms 159696 KB Output is correct
20 Correct 61 ms 159688 KB Output is correct
21 Correct 60 ms 159696 KB Output is correct
22 Correct 57 ms 159560 KB Output is correct
23 Correct 62 ms 159564 KB Output is correct
24 Correct 59 ms 159632 KB Output is correct
25 Correct 59 ms 159584 KB Output is correct
26 Correct 65 ms 159716 KB Output is correct
27 Correct 61 ms 159564 KB Output is correct
28 Correct 60 ms 159612 KB Output is correct
29 Correct 60 ms 159604 KB Output is correct
30 Correct 58 ms 159564 KB Output is correct
31 Correct 60 ms 159536 KB Output is correct
32 Correct 64 ms 159644 KB Output is correct
33 Correct 61 ms 159652 KB Output is correct
34 Correct 59 ms 159648 KB Output is correct
35 Correct 60 ms 159624 KB Output is correct
36 Correct 62 ms 159568 KB Output is correct
37 Correct 62 ms 159624 KB Output is correct
38 Correct 62 ms 159580 KB Output is correct
39 Correct 67 ms 159564 KB Output is correct
40 Correct 60 ms 159660 KB Output is correct
41 Correct 59 ms 159564 KB Output is correct
42 Correct 59 ms 159564 KB Output is correct
43 Correct 58 ms 159540 KB Output is correct
44 Correct 59 ms 159588 KB Output is correct
45 Correct 59 ms 159612 KB Output is correct
46 Correct 59 ms 159620 KB Output is correct
47 Correct 59 ms 159552 KB Output is correct
48 Correct 57 ms 159564 KB Output is correct
49 Correct 58 ms 159552 KB Output is correct
50 Correct 64 ms 159564 KB Output is correct
51 Correct 57 ms 159604 KB Output is correct
52 Correct 60 ms 159612 KB Output is correct
53 Correct 62 ms 159624 KB Output is correct
54 Correct 68 ms 159564 KB Output is correct
55 Correct 60 ms 159684 KB Output is correct
56 Correct 66 ms 159600 KB Output is correct
57 Correct 59 ms 159716 KB Output is correct
58 Correct 59 ms 159760 KB Output is correct
59 Correct 59 ms 159648 KB Output is correct
60 Correct 58 ms 159684 KB Output is correct
61 Correct 59 ms 159584 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 159560 KB Output is correct
2 Correct 62 ms 159564 KB Output is correct
3 Correct 58 ms 159580 KB Output is correct
4 Correct 61 ms 159528 KB Output is correct
5 Correct 62 ms 159588 KB Output is correct
6 Correct 58 ms 159588 KB Output is correct
7 Correct 60 ms 159520 KB Output is correct
8 Correct 57 ms 159628 KB Output is correct
9 Correct 60 ms 159540 KB Output is correct
10 Correct 58 ms 159584 KB Output is correct
11 Correct 59 ms 159568 KB Output is correct
12 Correct 61 ms 159692 KB Output is correct
13 Correct 60 ms 159576 KB Output is correct
14 Correct 65 ms 159632 KB Output is correct
15 Correct 60 ms 159564 KB Output is correct
16 Correct 59 ms 159652 KB Output is correct
17 Correct 60 ms 159640 KB Output is correct
18 Correct 59 ms 159616 KB Output is correct
19 Correct 59 ms 159580 KB Output is correct
20 Correct 60 ms 159620 KB Output is correct
21 Correct 59 ms 159696 KB Output is correct
22 Correct 61 ms 159688 KB Output is correct
23 Correct 60 ms 159696 KB Output is correct
24 Correct 75 ms 164128 KB Output is correct
25 Correct 77 ms 164116 KB Output is correct
26 Correct 76 ms 164096 KB Output is correct
27 Correct 59 ms 159632 KB Output is correct
28 Correct 59 ms 159584 KB Output is correct
29 Correct 65 ms 159716 KB Output is correct
30 Correct 61 ms 159564 KB Output is correct
31 Correct 60 ms 159612 KB Output is correct
32 Correct 60 ms 159604 KB Output is correct
33 Correct 58 ms 159564 KB Output is correct
34 Correct 60 ms 159536 KB Output is correct
35 Correct 64 ms 159644 KB Output is correct
36 Correct 61 ms 159652 KB Output is correct
37 Correct 59 ms 159648 KB Output is correct
38 Correct 60 ms 159624 KB Output is correct
39 Correct 62 ms 159568 KB Output is correct
40 Correct 62 ms 159624 KB Output is correct
41 Correct 62 ms 159580 KB Output is correct
42 Correct 67 ms 159564 KB Output is correct
43 Correct 60 ms 159660 KB Output is correct
44 Correct 59 ms 159564 KB Output is correct
45 Correct 59 ms 159564 KB Output is correct
46 Correct 58 ms 159540 KB Output is correct
47 Correct 59 ms 159588 KB Output is correct
48 Correct 59 ms 159612 KB Output is correct
49 Correct 59 ms 159620 KB Output is correct
50 Correct 59 ms 159552 KB Output is correct
51 Correct 57 ms 159564 KB Output is correct
52 Correct 58 ms 159552 KB Output is correct
53 Correct 64 ms 159564 KB Output is correct
54 Correct 57 ms 159604 KB Output is correct
55 Correct 60 ms 159612 KB Output is correct
56 Correct 62 ms 159624 KB Output is correct
57 Correct 68 ms 159564 KB Output is correct
58 Correct 60 ms 159684 KB Output is correct
59 Correct 66 ms 159600 KB Output is correct
60 Correct 59 ms 159716 KB Output is correct
61 Correct 59 ms 159760 KB Output is correct
62 Correct 59 ms 159648 KB Output is correct
63 Correct 58 ms 159684 KB Output is correct
64 Correct 59 ms 159584 KB Output is correct
65 Correct 60 ms 159616 KB Output is correct
66 Correct 60 ms 159544 KB Output is correct
67 Correct 63 ms 159668 KB Output is correct
68 Correct 62 ms 159608 KB Output is correct
69 Correct 58 ms 159576 KB Output is correct
70 Correct 60 ms 159852 KB Output is correct
71 Correct 64 ms 159876 KB Output is correct
72 Correct 68 ms 159816 KB Output is correct
73 Correct 61 ms 159744 KB Output is correct
74 Correct 61 ms 159768 KB Output is correct
75 Correct 60 ms 159760 KB Output is correct
76 Correct 76 ms 162892 KB Output is correct
77 Correct 79 ms 163372 KB Output is correct
78 Correct 78 ms 163920 KB Output is correct
79 Correct 60 ms 159612 KB Output is correct
80 Correct 66 ms 159624 KB Output is correct
81 Correct 59 ms 159568 KB Output is correct
82 Correct 62 ms 159608 KB Output is correct
83 Correct 61 ms 159580 KB Output is correct
84 Correct 63 ms 159872 KB Output is correct
85 Correct 61 ms 159852 KB Output is correct
86 Correct 61 ms 159892 KB Output is correct
87 Correct 70 ms 159876 KB Output is correct
88 Correct 61 ms 159856 KB Output is correct
89 Correct 61 ms 159964 KB Output is correct
90 Correct 83 ms 164260 KB Output is correct
91 Correct 86 ms 164172 KB Output is correct
92 Correct 88 ms 164388 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 159560 KB Output is correct
2 Correct 62 ms 159564 KB Output is correct
3 Correct 58 ms 159580 KB Output is correct
4 Correct 61 ms 159528 KB Output is correct
5 Correct 62 ms 159588 KB Output is correct
6 Correct 58 ms 159588 KB Output is correct
7 Correct 60 ms 159520 KB Output is correct
8 Correct 57 ms 159628 KB Output is correct
9 Correct 60 ms 159540 KB Output is correct
10 Correct 58 ms 159584 KB Output is correct
11 Correct 59 ms 159568 KB Output is correct
12 Correct 61 ms 159692 KB Output is correct
13 Correct 60 ms 159576 KB Output is correct
14 Correct 65 ms 159632 KB Output is correct
15 Correct 60 ms 159564 KB Output is correct
16 Correct 59 ms 159652 KB Output is correct
17 Correct 60 ms 159640 KB Output is correct
18 Correct 59 ms 159616 KB Output is correct
19 Correct 59 ms 159580 KB Output is correct
20 Correct 60 ms 159620 KB Output is correct
21 Correct 59 ms 159696 KB Output is correct
22 Correct 61 ms 159688 KB Output is correct
23 Correct 60 ms 159696 KB Output is correct
24 Correct 75 ms 164128 KB Output is correct
25 Correct 77 ms 164116 KB Output is correct
26 Correct 76 ms 164096 KB Output is correct
27 Correct 65 ms 160628 KB Output is correct
28 Correct 67 ms 160608 KB Output is correct
29 Correct 65 ms 160612 KB Output is correct
30 Correct 62 ms 160460 KB Output is correct
31 Correct 61 ms 160356 KB Output is correct
32 Correct 61 ms 160332 KB Output is correct
33 Correct 76 ms 161708 KB Output is correct
34 Correct 72 ms 161792 KB Output is correct
35 Correct 71 ms 161736 KB Output is correct
36 Correct 74 ms 161808 KB Output is correct
37 Correct 74 ms 161808 KB Output is correct
38 Correct 75 ms 161692 KB Output is correct
39 Correct 81 ms 165052 KB Output is correct
40 Correct 83 ms 165088 KB Output is correct
41 Correct 95 ms 165032 KB Output is correct
42 Correct 59 ms 159632 KB Output is correct
43 Correct 59 ms 159584 KB Output is correct
44 Correct 65 ms 159716 KB Output is correct
45 Correct 61 ms 159564 KB Output is correct
46 Correct 60 ms 159612 KB Output is correct
47 Correct 60 ms 159604 KB Output is correct
48 Correct 58 ms 159564 KB Output is correct
49 Correct 60 ms 159536 KB Output is correct
50 Correct 64 ms 159644 KB Output is correct
51 Correct 61 ms 159652 KB Output is correct
52 Correct 59 ms 159648 KB Output is correct
53 Correct 60 ms 159624 KB Output is correct
54 Correct 62 ms 159568 KB Output is correct
55 Correct 62 ms 159624 KB Output is correct
56 Correct 62 ms 159580 KB Output is correct
57 Correct 67 ms 159564 KB Output is correct
58 Correct 60 ms 159660 KB Output is correct
59 Correct 59 ms 159564 KB Output is correct
60 Correct 59 ms 159564 KB Output is correct
61 Correct 58 ms 159540 KB Output is correct
62 Correct 59 ms 159588 KB Output is correct
63 Correct 59 ms 159612 KB Output is correct
64 Correct 59 ms 159620 KB Output is correct
65 Correct 59 ms 159552 KB Output is correct
66 Correct 57 ms 159564 KB Output is correct
67 Correct 58 ms 159552 KB Output is correct
68 Correct 64 ms 159564 KB Output is correct
69 Correct 57 ms 159604 KB Output is correct
70 Correct 60 ms 159612 KB Output is correct
71 Correct 62 ms 159624 KB Output is correct
72 Correct 68 ms 159564 KB Output is correct
73 Correct 60 ms 159684 KB Output is correct
74 Correct 66 ms 159600 KB Output is correct
75 Correct 59 ms 159716 KB Output is correct
76 Correct 59 ms 159760 KB Output is correct
77 Correct 59 ms 159648 KB Output is correct
78 Correct 58 ms 159684 KB Output is correct
79 Correct 59 ms 159584 KB Output is correct
80 Correct 60 ms 159616 KB Output is correct
81 Correct 60 ms 159544 KB Output is correct
82 Correct 63 ms 159668 KB Output is correct
83 Correct 62 ms 159608 KB Output is correct
84 Correct 58 ms 159576 KB Output is correct
85 Correct 60 ms 159852 KB Output is correct
86 Correct 64 ms 159876 KB Output is correct
87 Correct 68 ms 159816 KB Output is correct
88 Correct 61 ms 159744 KB Output is correct
89 Correct 61 ms 159768 KB Output is correct
90 Correct 60 ms 159760 KB Output is correct
91 Correct 76 ms 162892 KB Output is correct
92 Correct 79 ms 163372 KB Output is correct
93 Correct 78 ms 163920 KB Output is correct
94 Correct 60 ms 159612 KB Output is correct
95 Correct 66 ms 159624 KB Output is correct
96 Correct 59 ms 159568 KB Output is correct
97 Correct 62 ms 159608 KB Output is correct
98 Correct 61 ms 159580 KB Output is correct
99 Correct 63 ms 159872 KB Output is correct
100 Correct 61 ms 159852 KB Output is correct
101 Correct 61 ms 159892 KB Output is correct
102 Correct 70 ms 159876 KB Output is correct
103 Correct 61 ms 159856 KB Output is correct
104 Correct 61 ms 159964 KB Output is correct
105 Correct 83 ms 164260 KB Output is correct
106 Correct 86 ms 164172 KB Output is correct
107 Correct 88 ms 164388 KB Output is correct
108 Correct 72 ms 160656 KB Output is correct
109 Correct 110 ms 160408 KB Output is correct
110 Correct 86 ms 160044 KB Output is correct
111 Correct 75 ms 160080 KB Output is correct
112 Correct 79 ms 160208 KB Output is correct
113 Correct 75 ms 160120 KB Output is correct
114 Correct 71 ms 161772 KB Output is correct
115 Correct 69 ms 161616 KB Output is correct
116 Correct 82 ms 162284 KB Output is correct
117 Correct 72 ms 161704 KB Output is correct
118 Correct 73 ms 161864 KB Output is correct
119 Correct 71 ms 161436 KB Output is correct
120 Correct 75 ms 162904 KB Output is correct
121 Correct 65 ms 160724 KB Output is correct
122 Correct 85 ms 163268 KB Output is correct
123 Correct 68 ms 160628 KB Output is correct
124 Correct 84 ms 164164 KB Output is correct
125 Correct 81 ms 161308 KB Output is correct
126 Correct 67 ms 160972 KB Output is correct
127 Correct 70 ms 161480 KB Output is correct
128 Correct 64 ms 160748 KB Output is correct
129 Correct 69 ms 160800 KB Output is correct
130 Correct 70 ms 160604 KB Output is correct
131 Correct 129 ms 160700 KB Output is correct
132 Correct 104 ms 160404 KB Output is correct
133 Correct 100 ms 160480 KB Output is correct
134 Correct 96 ms 160424 KB Output is correct
135 Correct 97 ms 160448 KB Output is correct
136 Correct 85 ms 162536 KB Output is correct
137 Correct 89 ms 162636 KB Output is correct
138 Correct 85 ms 162648 KB Output is correct
139 Correct 81 ms 162664 KB Output is correct
140 Correct 86 ms 162712 KB Output is correct
141 Correct 81 ms 162640 KB Output is correct
142 Correct 90 ms 165268 KB Output is correct
143 Correct 70 ms 161544 KB Output is correct
144 Correct 97 ms 165240 KB Output is correct
145 Correct 70 ms 161464 KB Output is correct
146 Correct 91 ms 165204 KB Output is correct
147 Correct 82 ms 161556 KB Output is correct
148 Correct 79 ms 161636 KB Output is correct
149 Correct 73 ms 161552 KB Output is correct
150 Correct 69 ms 161564 KB Output is correct
151 Correct 67 ms 161528 KB Output is correct

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 159560 KB Output is correct
2 Correct 62 ms 159564 KB Output is correct
3 Correct 58 ms 159580 KB Output is correct
4 Correct 61 ms 159528 KB Output is correct
5 Correct 62 ms 159588 KB Output is correct
6 Correct 58 ms 159588 KB Output is correct
7 Correct 60 ms 159520 KB Output is correct
8 Correct 57 ms 159628 KB Output is correct
9 Correct 60 ms 159540 KB Output is correct
10 Correct 58 ms 159584 KB Output is correct
11 Correct 59 ms 159568 KB Output is correct
12 Correct 61 ms 159692 KB Output is correct
13 Correct 60 ms 159576 KB Output is correct
14 Correct 65 ms 159632 KB Output is correct
15 Correct 60 ms 159564 KB Output is correct
16 Correct 59 ms 159652 KB Output is correct
17 Correct 60 ms 159640 KB Output is correct
18 Correct 59 ms 159616 KB Output is correct
19 Correct 59 ms 159580 KB Output is correct
20 Correct 60 ms 159620 KB Output is correct
21 Correct 59 ms 159696 KB Output is correct
22 Correct 61 ms 159688 KB Output is correct
23 Correct 60 ms 159696 KB Output is correct
24 Correct 75 ms 164128 KB Output is correct
25 Correct 77 ms 164116 KB Output is correct
26 Correct 76 ms 164096 KB Output is correct
27 Correct 65 ms 160628 KB Output is correct
28 Correct 67 ms 160608 KB Output is correct
29 Correct 65 ms 160612 KB Output is correct
30 Correct 62 ms 160460 KB Output is correct
31 Correct 61 ms 160356 KB Output is correct
32 Correct 61 ms 160332 KB Output is correct
33 Correct 76 ms 161708 KB Output is correct
34 Correct 72 ms 161792 KB Output is correct
35 Correct 71 ms 161736 KB Output is correct
36 Correct 74 ms 161808 KB Output is correct
37 Correct 74 ms 161808 KB Output is correct
38 Correct 75 ms 161692 KB Output is correct
39 Correct 81 ms 165052 KB Output is correct
40 Correct 83 ms 165088 KB Output is correct
41 Correct 95 ms 165032 KB Output is correct
42 Runtime error 199 ms 325672 KB Execution killed with signal 11
43 Halted 0 ms 0 KB -