oj.uz

답안 #737832

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
737832 2023-05-07T19:40:05 Z shadow_sami 벽 칠하기 (APIO20_paint) C++17
28 / 100
 1500 ms 325404 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){
		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)
				v.push_back({i-m+1,i});
		}
	}
	fip(0,n+1){
		dp[i] = 1e9;
	}
	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 57 ms 159544 KB Output is correct
2 Correct 58 ms 159512 KB Output is correct
3 Correct 56 ms 159636 KB Output is correct
4 Correct 59 ms 159512 KB Output is correct
5 Correct 56 ms 159564 KB Output is correct
6 Correct 58 ms 159588 KB Output is correct
7 Correct 58 ms 159596 KB Output is correct
8 Correct 59 ms 159600 KB Output is correct
9 Correct 56 ms 159624 KB Output is correct
10 Correct 57 ms 159744 KB Output is correct
11 Correct 57 ms 159520 KB Output is correct
12 Correct 63 ms 159584 KB Output is correct
13 Correct 60 ms 159692 KB Output is correct
14 Correct 65 ms 159564 KB Output is correct
15 Correct 65 ms 159596 KB Output is correct
16 Correct 63 ms 159608 KB Output is correct
17 Correct 69 ms 159564 KB Output is correct
18 Correct 62 ms 159620 KB Output is correct
19 Correct 61 ms 159576 KB Output is correct
20 Correct 60 ms 159624 KB Output is correct
21 Correct 66 ms 159692 KB Output is correct
22 Correct 79 ms 163660 KB Output is correct
23 Correct 77 ms 163644 KB Output is correct
24 Correct 73 ms 163644 KB Output is correct
25 Correct 64 ms 160692 KB Output is correct
26 Correct 64 ms 160660 KB Output is correct
27 Correct 65 ms 160516 KB Output is correct
28 Correct 63 ms 160340 KB Output is correct
29 Correct 61 ms 160328 KB Output is correct
30 Correct 62 ms 160344 KB Output is correct
31 Correct 78 ms 161620 KB Output is correct
32 Correct 80 ms 161640 KB Output is correct
33 Correct 75 ms 161624 KB Output is correct
34 Correct 72 ms 161648 KB Output is correct
35 Correct 71 ms 161624 KB Output is correct
36 Correct 73 ms 161620 KB Output is correct
37 Correct 79 ms 164512 KB Output is correct
38 Correct 81 ms 164464 KB Output is correct
39 Correct 80 ms 164492 KB Output is correct
40 Runtime error 191 ms 325404 KB Execution killed with signal 11
41 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 159544 KB Output is correct
2 Correct 58 ms 159512 KB Output is correct
3 Correct 56 ms 159636 KB Output is correct
4 Correct 59 ms 159512 KB Output is correct
5 Correct 56 ms 159564 KB Output is correct
6 Correct 58 ms 159588 KB Output is correct
7 Correct 58 ms 159596 KB Output is correct
8 Correct 59 ms 159600 KB Output is correct
9 Correct 56 ms 159624 KB Output is correct
10 Correct 57 ms 159744 KB Output is correct
11 Correct 57 ms 159520 KB Output is correct
12 Correct 63 ms 159584 KB Output is correct
13 Correct 60 ms 159692 KB Output is correct
14 Correct 65 ms 159564 KB Output is correct
15 Correct 65 ms 159596 KB Output is correct
16 Correct 63 ms 159608 KB Output is correct
17 Correct 69 ms 159564 KB Output is correct
18 Correct 62 ms 159620 KB Output is correct
19 Correct 61 ms 159576 KB Output is correct
20 Correct 60 ms 159624 KB Output is correct
21 Correct 66 ms 159692 KB Output is correct
22 Correct 61 ms 159620 KB Output is correct
23 Correct 59 ms 159564 KB Output is correct
24 Correct 61 ms 159588 KB Output is correct
25 Correct 62 ms 159516 KB Output is correct
26 Correct 64 ms 159536 KB Output is correct
27 Correct 60 ms 159560 KB Output is correct
28 Correct 68 ms 159724 KB Output is correct
29 Correct 59 ms 159564 KB Output is correct
30 Correct 63 ms 159588 KB Output is correct
31 Correct 63 ms 159596 KB Output is correct
32 Correct 62 ms 159568 KB Output is correct
33 Correct 62 ms 159584 KB Output is correct
34 Correct 62 ms 159596 KB Output is correct
35 Correct 61 ms 159572 KB Output is correct
36 Correct 68 ms 159620 KB Output is correct
37 Correct 68 ms 159640 KB Output is correct
38 Correct 66 ms 159544 KB Output is correct
39 Correct 61 ms 159540 KB Output is correct
40 Correct 62 ms 159624 KB Output is correct
41 Correct 71 ms 159572 KB Output is correct
42 Correct 60 ms 159636 KB Output is correct
43 Correct 87 ms 159660 KB Output is correct
44 Correct 60 ms 159544 KB Output is correct
45 Correct 69 ms 159840 KB Output is correct
46 Correct 60 ms 159520 KB Output is correct
47 Correct 59 ms 159640 KB Output is correct
48 Correct 68 ms 159628 KB Output is correct
49 Correct 75 ms 159596 KB Output is correct
50 Correct 76 ms 159580 KB Output is correct
51 Correct 60 ms 159628 KB Output is correct
52 Correct 59 ms 159680 KB Output is correct
53 Correct 67 ms 159596 KB Output is correct
54 Correct 60 ms 159568 KB Output is correct
55 Correct 58 ms 159688 KB Output is correct
56 Correct 66 ms 159716 KB Output is correct
57 Correct 65 ms 159660 KB Output is correct
58 Correct 67 ms 159644 KB Output is correct
59 Correct 71 ms 159608 KB Output is correct
60 Correct 76 ms 159668 KB Output is correct
61 Correct 68 ms 159608 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 159620 KB Output is correct
2 Correct 59 ms 159564 KB Output is correct
3 Correct 57 ms 159544 KB Output is correct
4 Correct 58 ms 159512 KB Output is correct
5 Correct 56 ms 159636 KB Output is correct
6 Correct 59 ms 159512 KB Output is correct
7 Correct 56 ms 159564 KB Output is correct
8 Correct 58 ms 159588 KB Output is correct
9 Correct 58 ms 159596 KB Output is correct
10 Correct 59 ms 159600 KB Output is correct
11 Correct 56 ms 159624 KB Output is correct
12 Correct 57 ms 159744 KB Output is correct
13 Correct 57 ms 159520 KB Output is correct
14 Correct 63 ms 159584 KB Output is correct
15 Correct 60 ms 159692 KB Output is correct
16 Correct 65 ms 159564 KB Output is correct
17 Correct 65 ms 159596 KB Output is correct
18 Correct 63 ms 159608 KB Output is correct
19 Correct 69 ms 159564 KB Output is correct
20 Correct 62 ms 159620 KB Output is correct
21 Correct 61 ms 159576 KB Output is correct
22 Correct 60 ms 159624 KB Output is correct
23 Correct 66 ms 159692 KB Output is correct
24 Correct 79 ms 163660 KB Output is correct
25 Correct 77 ms 163644 KB Output is correct
26 Correct 73 ms 163644 KB Output is correct
27 Correct 61 ms 159588 KB Output is correct
28 Correct 62 ms 159516 KB Output is correct
29 Correct 64 ms 159536 KB Output is correct
30 Correct 60 ms 159560 KB Output is correct
31 Correct 68 ms 159724 KB Output is correct
32 Correct 59 ms 159564 KB Output is correct
33 Correct 63 ms 159588 KB Output is correct
34 Correct 63 ms 159596 KB Output is correct
35 Correct 62 ms 159568 KB Output is correct
36 Correct 62 ms 159584 KB Output is correct
37 Correct 62 ms 159596 KB Output is correct
38 Correct 61 ms 159572 KB Output is correct
39 Correct 68 ms 159620 KB Output is correct
40 Correct 68 ms 159640 KB Output is correct
41 Correct 66 ms 159544 KB Output is correct
42 Correct 61 ms 159540 KB Output is correct
43 Correct 62 ms 159624 KB Output is correct
44 Correct 71 ms 159572 KB Output is correct
45 Correct 60 ms 159636 KB Output is correct
46 Correct 87 ms 159660 KB Output is correct
47 Correct 60 ms 159544 KB Output is correct
48 Correct 69 ms 159840 KB Output is correct
49 Correct 60 ms 159520 KB Output is correct
50 Correct 59 ms 159640 KB Output is correct
51 Correct 68 ms 159628 KB Output is correct
52 Correct 75 ms 159596 KB Output is correct
53 Correct 76 ms 159580 KB Output is correct
54 Correct 60 ms 159628 KB Output is correct
55 Correct 59 ms 159680 KB Output is correct
56 Correct 67 ms 159596 KB Output is correct
57 Correct 60 ms 159568 KB Output is correct
58 Correct 58 ms 159688 KB Output is correct
59 Correct 66 ms 159716 KB Output is correct
60 Correct 65 ms 159660 KB Output is correct
61 Correct 67 ms 159644 KB Output is correct
62 Correct 71 ms 159608 KB Output is correct
63 Correct 76 ms 159668 KB Output is correct
64 Correct 68 ms 159608 KB Output is correct
65 Correct 77 ms 159780 KB Output is correct
66 Correct 67 ms 160004 KB Output is correct
67 Correct 78 ms 160252 KB Output is correct
68 Correct 72 ms 160036 KB Output is correct
69 Correct 72 ms 160244 KB Output is correct
70 Correct 68 ms 159824 KB Output is correct
71 Correct 70 ms 159788 KB Output is correct
72 Correct 77 ms 159924 KB Output is correct
73 Correct 71 ms 159792 KB Output is correct
74 Correct 71 ms 159764 KB Output is correct
75 Correct 71 ms 159708 KB Output is correct
76 Correct 90 ms 162248 KB Output is correct
77 Correct 97 ms 162656 KB Output is correct
78 Correct 86 ms 163084 KB Output is correct
79 Correct 78 ms 160280 KB Output is correct
80 Correct 77 ms 160296 KB Output is correct
81 Correct 79 ms 160232 KB Output is correct
82 Correct 81 ms 160252 KB Output is correct
83 Correct 74 ms 160268 KB Output is correct
84 Correct 69 ms 159812 KB Output is correct
85 Correct 61 ms 159792 KB Output is correct
86 Correct 66 ms 159824 KB Output is correct
87 Correct 63 ms 159884 KB Output is correct
88 Correct 66 ms 159884 KB Output is correct
89 Correct 72 ms 159824 KB Output is correct
90 Correct 91 ms 163380 KB Output is correct
91 Correct 86 ms 163364 KB Output is correct
92 Correct 101 ms 163332 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 159620 KB Output is correct
2 Correct 59 ms 159564 KB Output is correct
3 Correct 57 ms 159544 KB Output is correct
4 Correct 58 ms 159512 KB Output is correct
5 Correct 56 ms 159636 KB Output is correct
6 Correct 59 ms 159512 KB Output is correct
7 Correct 56 ms 159564 KB Output is correct
8 Correct 58 ms 159588 KB Output is correct
9 Correct 58 ms 159596 KB Output is correct
10 Correct 59 ms 159600 KB Output is correct
11 Correct 56 ms 159624 KB Output is correct
12 Correct 57 ms 159744 KB Output is correct
13 Correct 57 ms 159520 KB Output is correct
14 Correct 63 ms 159584 KB Output is correct
15 Correct 60 ms 159692 KB Output is correct
16 Correct 65 ms 159564 KB Output is correct
17 Correct 65 ms 159596 KB Output is correct
18 Correct 63 ms 159608 KB Output is correct
19 Correct 69 ms 159564 KB Output is correct
20 Correct 62 ms 159620 KB Output is correct
21 Correct 61 ms 159576 KB Output is correct
22 Correct 60 ms 159624 KB Output is correct
23 Correct 66 ms 159692 KB Output is correct
24 Correct 79 ms 163660 KB Output is correct
25 Correct 77 ms 163644 KB Output is correct
26 Correct 73 ms 163644 KB Output is correct
27 Correct 64 ms 160692 KB Output is correct
28 Correct 64 ms 160660 KB Output is correct
29 Correct 65 ms 160516 KB Output is correct
30 Correct 63 ms 160340 KB Output is correct
31 Correct 61 ms 160328 KB Output is correct
32 Correct 62 ms 160344 KB Output is correct
33 Correct 78 ms 161620 KB Output is correct
34 Correct 80 ms 161640 KB Output is correct
35 Correct 75 ms 161624 KB Output is correct
36 Correct 72 ms 161648 KB Output is correct
37 Correct 71 ms 161624 KB Output is correct
38 Correct 73 ms 161620 KB Output is correct
39 Correct 79 ms 164512 KB Output is correct
40 Correct 81 ms 164464 KB Output is correct
41 Correct 80 ms 164492 KB Output is correct
42 Correct 61 ms 159588 KB Output is correct
43 Correct 62 ms 159516 KB Output is correct
44 Correct 64 ms 159536 KB Output is correct
45 Correct 60 ms 159560 KB Output is correct
46 Correct 68 ms 159724 KB Output is correct
47 Correct 59 ms 159564 KB Output is correct
48 Correct 63 ms 159588 KB Output is correct
49 Correct 63 ms 159596 KB Output is correct
50 Correct 62 ms 159568 KB Output is correct
51 Correct 62 ms 159584 KB Output is correct
52 Correct 62 ms 159596 KB Output is correct
53 Correct 61 ms 159572 KB Output is correct
54 Correct 68 ms 159620 KB Output is correct
55 Correct 68 ms 159640 KB Output is correct
56 Correct 66 ms 159544 KB Output is correct
57 Correct 61 ms 159540 KB Output is correct
58 Correct 62 ms 159624 KB Output is correct
59 Correct 71 ms 159572 KB Output is correct
60 Correct 60 ms 159636 KB Output is correct
61 Correct 87 ms 159660 KB Output is correct
62 Correct 60 ms 159544 KB Output is correct
63 Correct 69 ms 159840 KB Output is correct
64 Correct 60 ms 159520 KB Output is correct
65 Correct 59 ms 159640 KB Output is correct
66 Correct 68 ms 159628 KB Output is correct
67 Correct 75 ms 159596 KB Output is correct
68 Correct 76 ms 159580 KB Output is correct
69 Correct 60 ms 159628 KB Output is correct
70 Correct 59 ms 159680 KB Output is correct
71 Correct 67 ms 159596 KB Output is correct
72 Correct 60 ms 159568 KB Output is correct
73 Correct 58 ms 159688 KB Output is correct
74 Correct 66 ms 159716 KB Output is correct
75 Correct 65 ms 159660 KB Output is correct
76 Correct 67 ms 159644 KB Output is correct
77 Correct 71 ms 159608 KB Output is correct
78 Correct 76 ms 159668 KB Output is correct
79 Correct 68 ms 159608 KB Output is correct
80 Correct 77 ms 159780 KB Output is correct
81 Correct 67 ms 160004 KB Output is correct
82 Correct 78 ms 160252 KB Output is correct
83 Correct 72 ms 160036 KB Output is correct
84 Correct 72 ms 160244 KB Output is correct
85 Correct 68 ms 159824 KB Output is correct
86 Correct 70 ms 159788 KB Output is correct
87 Correct 77 ms 159924 KB Output is correct
88 Correct 71 ms 159792 KB Output is correct
89 Correct 71 ms 159764 KB Output is correct
90 Correct 71 ms 159708 KB Output is correct
91 Correct 90 ms 162248 KB Output is correct
92 Correct 97 ms 162656 KB Output is correct
93 Correct 86 ms 163084 KB Output is correct
94 Correct 78 ms 160280 KB Output is correct
95 Correct 77 ms 160296 KB Output is correct
96 Correct 79 ms 160232 KB Output is correct
97 Correct 81 ms 160252 KB Output is correct
98 Correct 74 ms 160268 KB Output is correct
99 Correct 69 ms 159812 KB Output is correct
100 Correct 61 ms 159792 KB Output is correct
101 Correct 66 ms 159824 KB Output is correct
102 Correct 63 ms 159884 KB Output is correct
103 Correct 66 ms 159884 KB Output is correct
104 Correct 72 ms 159824 KB Output is correct
105 Correct 91 ms 163380 KB Output is correct
106 Correct 86 ms 163364 KB Output is correct
107 Correct 101 ms 163332 KB Output is correct
108 Correct 78 ms 160708 KB Output is correct
109 Execution timed out 1572 ms 291240 KB Time limit exceeded
110 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 159620 KB Output is correct
2 Correct 59 ms 159564 KB Output is correct
3 Correct 57 ms 159544 KB Output is correct
4 Correct 58 ms 159512 KB Output is correct
5 Correct 56 ms 159636 KB Output is correct
6 Correct 59 ms 159512 KB Output is correct
7 Correct 56 ms 159564 KB Output is correct
8 Correct 58 ms 159588 KB Output is correct
9 Correct 58 ms 159596 KB Output is correct
10 Correct 59 ms 159600 KB Output is correct
11 Correct 56 ms 159624 KB Output is correct
12 Correct 57 ms 159744 KB Output is correct
13 Correct 57 ms 159520 KB Output is correct
14 Correct 63 ms 159584 KB Output is correct
15 Correct 60 ms 159692 KB Output is correct
16 Correct 65 ms 159564 KB Output is correct
17 Correct 65 ms 159596 KB Output is correct
18 Correct 63 ms 159608 KB Output is correct
19 Correct 69 ms 159564 KB Output is correct
20 Correct 62 ms 159620 KB Output is correct
21 Correct 61 ms 159576 KB Output is correct
22 Correct 60 ms 159624 KB Output is correct
23 Correct 66 ms 159692 KB Output is correct
24 Correct 79 ms 163660 KB Output is correct
25 Correct 77 ms 163644 KB Output is correct
26 Correct 73 ms 163644 KB Output is correct
27 Correct 64 ms 160692 KB Output is correct
28 Correct 64 ms 160660 KB Output is correct
29 Correct 65 ms 160516 KB Output is correct
30 Correct 63 ms 160340 KB Output is correct
31 Correct 61 ms 160328 KB Output is correct
32 Correct 62 ms 160344 KB Output is correct
33 Correct 78 ms 161620 KB Output is correct
34 Correct 80 ms 161640 KB Output is correct
35 Correct 75 ms 161624 KB Output is correct
36 Correct 72 ms 161648 KB Output is correct
37 Correct 71 ms 161624 KB Output is correct
38 Correct 73 ms 161620 KB Output is correct
39 Correct 79 ms 164512 KB Output is correct
40 Correct 81 ms 164464 KB Output is correct
41 Correct 80 ms 164492 KB Output is correct
42 Runtime error 191 ms 325404 KB Execution killed with signal 11
43 Halted 0 ms 0 KB -