답안 #58290 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
58290	2018-07-17T11:07:44 Z	sebinkim	Wild Boar (JOI18_wild_boar)	C++14	100 / 100	11811 ms	575008 KB

wild_boar

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair <ll, ll> pll;

struct path{
	ll s, e, v;
	path() {}
	path(ll _v, ll _s, ll _e) { s = _s, e = _e, v = _v; }
	bool operator< (const path& p) const { return v > p.v; }
};

typedef vector <path> vp;

vp T[303030];
priority_queue <path> Q;
vp K[2020][2020];
vector <pll> V[2020];
ll chk[2020][2];
ll L[101010];
ll n, m, k;

vp add(vp &a, vp &b)
{
	vp ret, ans;
	ll i, j, c1, c2;
	
	for(auto &p1: a){
		for(auto &p2 : b){
			if(p1.e != p2.s){
				ret.push_back(path(p1.v + p2.v, p1.s, p2.e));
			}
		}
	}
	
	if(!ret.empty()){
		sort(ret.begin(), ret.end());
		reverse(ret.begin(), ret.end());
		
		ans.push_back(ret[0]);
		
		for(i=1;i<ret.size();i++){
			if(ret[i].s != ret[0].s && ret[i].e != ret[0].e) break;
		}
		
		if(i < ret.size()){
			ans.push_back(ret[i]);
			
			ll s1 = ret[0].s, e1 = ret[i].e;
			ll s2 = ret[i].s, e2 = ret[0].e;
			ll a;
			
			for(a=1;a<ret.size();a++) if(ret[a].s != s1 && ret[a].e != e1) break;
			if(a < ret.size()) ans.push_back(ret[a]);
			
			for(a=1;a<ret.size();a++) if(ret[a].s != s2 && ret[a].e != e2) break;
			if(a < ret.size()) ans.push_back(ret[a]);
		}
		else{
			ll a;
			ll s = ret[0].s, e = ret[0].e;
			
			for(a=1;a<ret.size();a++) if(ret[a].s != s) break;
			if(a < ret.size()) ans.push_back(ret[a]);
			
			for(a=1;a<ret.size();a++) if(ret[a].e != e) break;
			if(a < ret.size()) ans.push_back(ret[a]);
		}
	}
	
	return ans;
}

void dijkstra(ll a, ll b, ll v)
{
	path p;
	ll i;
	
	chk[a][0] = 1;
	
	Q.push(path(v, a, b));
	
	for(;!Q.empty();){
		p = Q.top(); Q.pop();
		
		if(chk[p.e][0] && chk[p.e][1]) continue;
		if(p.s == chk[p.e][0] || p.s == chk[p.e][1]) continue;
		
		if(chk[p.e][0]) chk[p.e][1] = p.s;
		else chk[p.e][0] = p.s;
		
		K[a][p.e].push_back(path(p.v, b, p.s));
		
		for(pll &j: V[p.e]){
			if(j.first != p.s){
				Q.push(path(p.v + j.second, p.e, j.first));
			}
		}
	}
	
	for(i=1;i<=n;i++){
		chk[i][0] = chk[i][1] = 0;
	}
}

void init_seg(ll p, ll s, ll e)
{
	if(s == e){
		T[p] = K[L[s]][L[s+1]];
		return;
	}
	
	init_seg(p<<1, s, (s+e>>1));
	init_seg(p<<1|1, (s+e>>1)+1, e);
	
	T[p] = add(T[p<<1], T[p<<1|1]);
}

void update(ll p, ll s, ll e, ll v)
{
	if(s == e){
		T[p] = K[L[s]][L[s+1]];
		return;
	}
	
	if(v <= (s+e>>1)) update(p<<1, s, (s+e>>1), v);
	else update(p<<1|1, (s+e>>1)+1, e, v);
	
	T[p] = add(T[p<<1], T[p<<1|1]);
}

int main()
{
	ll i, j, q, a, b, c;
	path p;
	
	scanf("%lld%lld%lld%lld", &n, &m, &q, &k);
	
	for(i=1;i<=m;i++){
		scanf("%lld%lld%lld", &a, &b, &c);
		V[a].push_back(pll(b, c));
		V[b].push_back(pll(a, c));
	}
	
	for(i=1;i<=n;i++) for(pll &t: V[i]){
		dijkstra(i, t.first, t.second);
	}
	
	for(i=1;i<=n;i++) for(j=1;j<=n;j++){
		if(!K[i][j].empty()){
			vp ret = K[i][j], ans;
			ll a;
			
			sort(ret.begin(), ret.end());
			reverse(ret.begin(), ret.end());
			
			ans.push_back(ret[0]);
			
			for(a=1;a<ret.size();a++){
				if(ret[a].s != ret[0].s && ret[a].e != ret[0].e) break;
			}
			
			if(a < ret.size()){
				ans.push_back(ret[a]);
				
				ll s1 = ret[0].s, e1 = ret[a].e;
				ll s2 = ret[a].s, e2 = ret[0].e;
				
				for(a=1;a<ret.size();a++) if(ret[a].s != s1 && ret[a].e != e1) break;
				if(a < ret.size()) ans.push_back(ret[a]);
				
				for(a=1;a<ret.size();a++) if(ret[a].s != s2 && ret[a].e != e2) break;
				if(a < ret.size()) ans.push_back(ret[a]);
			}
			else{
				ll s = ret[0].s, e = ret[0].e;
				
				for(a=1;a<ret.size();a++) if(ret[a].s != s) break;
				if(a < ret.size()) ans.push_back(ret[a]);
				
				for(a=1;a<ret.size();a++) if(ret[a].e != e) break;
				if(a < ret.size()) ans.push_back(ret[a]);
			}
			
			K[i][j] = ans;
		}
	}
	
	for(i=1;i<=k;i++){
		scanf("%lld", L+i);
	}
	
	init_seg(1, 1, k-1);
	
	for(;q--;){
		scanf("%lld%lld", &a, &b);
		L[a] = b;
		if(a < k) update(1, 1, k-1, a);
		if(a > 1) update(1, 1, k-1, a-1);
		
		if(T[1].empty()) printf("-1\n");
		else printf("%lld\n", T[1][0].v);
	}
	
	return 0;
}

Compilation message

wild_boar.cpp: In function 'vp add(vp&, vp&)':
wild_boar.cpp:44:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(i=1;i<ret.size();i++){
           ~^~~~~~~~~~~
wild_boar.cpp:48:8: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(i < ret.size()){
      ~~^~~~~~~~~~~~
wild_boar.cpp:55:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(a=1;a<ret.size();a++) if(ret[a].s != s1 && ret[a].e != e1) break;
            ~^~~~~~~~~~~
wild_boar.cpp:56:9: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if(a < ret.size()) ans.push_back(ret[a]);
       ~~^~~~~~~~~~~~
wild_boar.cpp:58:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(a=1;a<ret.size();a++) if(ret[a].s != s2 && ret[a].e != e2) break;
            ~^~~~~~~~~~~
wild_boar.cpp:59:9: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if(a < ret.size()) ans.push_back(ret[a]);
       ~~^~~~~~~~~~~~
wild_boar.cpp:65:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(a=1;a<ret.size();a++) if(ret[a].s != s) break;
            ~^~~~~~~~~~~
wild_boar.cpp:66:9: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if(a < ret.size()) ans.push_back(ret[a]);
       ~~^~~~~~~~~~~~
wild_boar.cpp:68:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(a=1;a<ret.size();a++) if(ret[a].e != e) break;
            ~^~~~~~~~~~~
wild_boar.cpp:69:9: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if(a < ret.size()) ans.push_back(ret[a]);
       ~~^~~~~~~~~~~~
wild_boar.cpp:28:8: warning: unused variable 'j' [-Wunused-variable]
  ll i, j, c1, c2;
        ^
wild_boar.cpp:28:11: warning: unused variable 'c1' [-Wunused-variable]
  ll i, j, c1, c2;
           ^~
wild_boar.cpp:28:15: warning: unused variable 'c2' [-Wunused-variable]
  ll i, j, c1, c2;
               ^~
wild_boar.cpp: In function 'void init_seg(ll, ll, ll)':
wild_boar.cpp:115:22: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  init_seg(p<<1, s, (s+e>>1));
                     ~^~
wild_boar.cpp:116:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  init_seg(p<<1|1, (s+e>>1)+1, e);
                    ~^~
wild_boar.cpp: In function 'void update(ll, ll, ll, ll)':
wild_boar.cpp:128:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  if(v <= (s+e>>1)) update(p<<1, s, (s+e>>1), v);
           ~^~
wild_boar.cpp:128:38: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  if(v <= (s+e>>1)) update(p<<1, s, (s+e>>1), v);
                                     ~^~
wild_boar.cpp:129:24: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  else update(p<<1|1, (s+e>>1)+1, e, v);
                       ~^~
wild_boar.cpp: In function 'int main()':
wild_boar.cpp:161:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(a=1;a<ret.size();a++){
            ~^~~~~~~~~~~
wild_boar.cpp:165:9: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if(a < ret.size()){
       ~~^~~~~~~~~~~~
wild_boar.cpp:171:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(a=1;a<ret.size();a++) if(ret[a].s != s1 && ret[a].e != e1) break;
             ~^~~~~~~~~~~
wild_boar.cpp:172:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(a < ret.size()) ans.push_back(ret[a]);
        ~~^~~~~~~~~~~~
wild_boar.cpp:174:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(a=1;a<ret.size();a++) if(ret[a].s != s2 && ret[a].e != e2) break;
             ~^~~~~~~~~~~
wild_boar.cpp:175:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(a < ret.size()) ans.push_back(ret[a]);
        ~~^~~~~~~~~~~~
wild_boar.cpp:180:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(a=1;a<ret.size();a++) if(ret[a].s != s) break;
             ~^~~~~~~~~~~
wild_boar.cpp:181:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(a < ret.size()) ans.push_back(ret[a]);
        ~~^~~~~~~~~~~~
wild_boar.cpp:183:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(a=1;a<ret.size();a++) if(ret[a].e != e) break;
             ~^~~~~~~~~~~
wild_boar.cpp:184:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(a < ret.size()) ans.push_back(ret[a]);
        ~~^~~~~~~~~~~~
wild_boar.cpp:139:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld%lld%lld", &n, &m, &q, &k);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
wild_boar.cpp:142:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld%lld", &a, &b, &c);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
wild_boar.cpp:192:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", L+i);
   ~~~~~^~~~~~~~~~~~~
wild_boar.cpp:198:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld", &a, &b);
   ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	86 ms	103416 KB	Output is correct
2	Correct	87 ms	103416 KB	Output is correct
3	Correct	95 ms	103416 KB	Output is correct
4	Correct	94 ms	103532 KB	Output is correct
5	Correct	93 ms	103660 KB	Output is correct
6	Correct	82 ms	103660 KB	Output is correct
7	Correct	85 ms	103660 KB	Output is correct
8	Correct	83 ms	103660 KB	Output is correct
9	Correct	92 ms	103660 KB	Output is correct
10	Correct	92 ms	103660 KB	Output is correct
11	Correct	91 ms	103660 KB	Output is correct
12	Correct	99 ms	103660 KB	Output is correct
13	Correct	96 ms	103660 KB	Output is correct
14	Correct	82 ms	103660 KB	Output is correct
15	Correct	107 ms	103660 KB	Output is correct
16	Correct	99 ms	103660 KB	Output is correct
17	Correct	98 ms	103660 KB	Output is correct
18	Correct	96 ms	103660 KB	Output is correct
19	Correct	97 ms	103660 KB	Output is correct
20	Correct	105 ms	103660 KB	Output is correct
21	Correct	98 ms	103660 KB	Output is correct
22	Correct	97 ms	103660 KB	Output is correct
23	Correct	96 ms	103660 KB	Output is correct
24	Correct	93 ms	103660 KB	Output is correct
25	Correct	96 ms	103660 KB	Output is correct

Subtask #2
35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	86 ms	103416 KB	Output is correct
2	Correct	87 ms	103416 KB	Output is correct
3	Correct	95 ms	103416 KB	Output is correct
4	Correct	94 ms	103532 KB	Output is correct
5	Correct	93 ms	103660 KB	Output is correct
6	Correct	82 ms	103660 KB	Output is correct
7	Correct	85 ms	103660 KB	Output is correct
8	Correct	83 ms	103660 KB	Output is correct
9	Correct	92 ms	103660 KB	Output is correct
10	Correct	92 ms	103660 KB	Output is correct
11	Correct	91 ms	103660 KB	Output is correct
12	Correct	99 ms	103660 KB	Output is correct
13	Correct	96 ms	103660 KB	Output is correct
14	Correct	82 ms	103660 KB	Output is correct
15	Correct	107 ms	103660 KB	Output is correct
16	Correct	99 ms	103660 KB	Output is correct
17	Correct	98 ms	103660 KB	Output is correct
18	Correct	96 ms	103660 KB	Output is correct
19	Correct	97 ms	103660 KB	Output is correct
20	Correct	105 ms	103660 KB	Output is correct
21	Correct	98 ms	103660 KB	Output is correct
22	Correct	97 ms	103660 KB	Output is correct
23	Correct	96 ms	103660 KB	Output is correct
24	Correct	93 ms	103660 KB	Output is correct
25	Correct	96 ms	103660 KB	Output is correct
26	Correct	92 ms	103660 KB	Output is correct
27	Correct	137 ms	109720 KB	Output is correct
28	Correct	144 ms	109720 KB	Output is correct
29	Correct	350 ms	130160 KB	Output is correct
30	Correct	359 ms	130284 KB	Output is correct
31	Correct	394 ms	130400 KB	Output is correct
32	Correct	315 ms	130656 KB	Output is correct
33	Correct	349 ms	132396 KB	Output is correct
34	Correct	393 ms	132396 KB	Output is correct
35	Correct	314 ms	132396 KB	Output is correct
36	Correct	307 ms	132396 KB	Output is correct
37	Correct	307 ms	132396 KB	Output is correct
38	Correct	302 ms	133768 KB	Output is correct
39	Correct	322 ms	133768 KB	Output is correct
40	Correct	328 ms	133792 KB	Output is correct
41	Correct	305 ms	133792 KB	Output is correct
42	Correct	313 ms	134928 KB	Output is correct
43	Correct	359 ms	135164 KB	Output is correct
44	Correct	347 ms	135272 KB	Output is correct
45	Correct	202 ms	135272 KB	Output is correct

Subtask #3
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	86 ms	103416 KB	Output is correct
2	Correct	87 ms	103416 KB	Output is correct
3	Correct	95 ms	103416 KB	Output is correct
4	Correct	94 ms	103532 KB	Output is correct
5	Correct	93 ms	103660 KB	Output is correct
6	Correct	82 ms	103660 KB	Output is correct
7	Correct	85 ms	103660 KB	Output is correct
8	Correct	83 ms	103660 KB	Output is correct
9	Correct	92 ms	103660 KB	Output is correct
10	Correct	92 ms	103660 KB	Output is correct
11	Correct	91 ms	103660 KB	Output is correct
12	Correct	99 ms	103660 KB	Output is correct
13	Correct	96 ms	103660 KB	Output is correct
14	Correct	82 ms	103660 KB	Output is correct
15	Correct	107 ms	103660 KB	Output is correct
16	Correct	99 ms	103660 KB	Output is correct
17	Correct	98 ms	103660 KB	Output is correct
18	Correct	96 ms	103660 KB	Output is correct
19	Correct	97 ms	103660 KB	Output is correct
20	Correct	105 ms	103660 KB	Output is correct
21	Correct	98 ms	103660 KB	Output is correct
22	Correct	97 ms	103660 KB	Output is correct
23	Correct	96 ms	103660 KB	Output is correct
24	Correct	93 ms	103660 KB	Output is correct
25	Correct	96 ms	103660 KB	Output is correct
26	Correct	92 ms	103660 KB	Output is correct
27	Correct	137 ms	109720 KB	Output is correct
28	Correct	144 ms	109720 KB	Output is correct
29	Correct	350 ms	130160 KB	Output is correct
30	Correct	359 ms	130284 KB	Output is correct
31	Correct	394 ms	130400 KB	Output is correct
32	Correct	315 ms	130656 KB	Output is correct
33	Correct	349 ms	132396 KB	Output is correct
34	Correct	393 ms	132396 KB	Output is correct
35	Correct	314 ms	132396 KB	Output is correct
36	Correct	307 ms	132396 KB	Output is correct
37	Correct	307 ms	132396 KB	Output is correct
38	Correct	302 ms	133768 KB	Output is correct
39	Correct	322 ms	133768 KB	Output is correct
40	Correct	328 ms	133792 KB	Output is correct
41	Correct	305 ms	133792 KB	Output is correct
42	Correct	313 ms	134928 KB	Output is correct
43	Correct	359 ms	135164 KB	Output is correct
44	Correct	347 ms	135272 KB	Output is correct
45	Correct	202 ms	135272 KB	Output is correct
46	Correct	374 ms	135272 KB	Output is correct
47	Correct	5192 ms	258964 KB	Output is correct
48	Correct	4802 ms	326784 KB	Output is correct
49	Correct	5559 ms	372140 KB	Output is correct
50	Correct	5481 ms	372140 KB	Output is correct
51	Correct	5247 ms	376236 KB	Output is correct
52	Correct	5304 ms	385968 KB	Output is correct
53	Correct	5519 ms	388132 KB	Output is correct
54	Correct	5695 ms	388132 KB	Output is correct
55	Correct	5294 ms	388960 KB	Output is correct
56	Correct	5848 ms	411768 KB	Output is correct
57	Correct	5457 ms	434500 KB	Output is correct
58	Correct	5883 ms	454436 KB	Output is correct
59	Correct	5723 ms	478616 KB	Output is correct
60	Correct	6447 ms	498040 KB	Output is correct
61	Correct	6458 ms	519816 KB	Output is correct
62	Correct	6004 ms	535976 KB	Output is correct
63	Correct	6857 ms	551904 KB	Output is correct
64	Correct	2808 ms	551904 KB	Output is correct
65	Correct	2740 ms	551904 KB	Output is correct

Subtask #4
38.0 / 38.0

#	결과	실행 시간	메모리	Grader output
1	Correct	86 ms	103416 KB	Output is correct
2	Correct	87 ms	103416 KB	Output is correct
3	Correct	95 ms	103416 KB	Output is correct
4	Correct	94 ms	103532 KB	Output is correct
5	Correct	93 ms	103660 KB	Output is correct
6	Correct	82 ms	103660 KB	Output is correct
7	Correct	85 ms	103660 KB	Output is correct
8	Correct	83 ms	103660 KB	Output is correct
9	Correct	92 ms	103660 KB	Output is correct
10	Correct	92 ms	103660 KB	Output is correct
11	Correct	91 ms	103660 KB	Output is correct
12	Correct	99 ms	103660 KB	Output is correct
13	Correct	96 ms	103660 KB	Output is correct
14	Correct	82 ms	103660 KB	Output is correct
15	Correct	107 ms	103660 KB	Output is correct
16	Correct	99 ms	103660 KB	Output is correct
17	Correct	98 ms	103660 KB	Output is correct
18	Correct	96 ms	103660 KB	Output is correct
19	Correct	97 ms	103660 KB	Output is correct
20	Correct	105 ms	103660 KB	Output is correct
21	Correct	98 ms	103660 KB	Output is correct
22	Correct	97 ms	103660 KB	Output is correct
23	Correct	96 ms	103660 KB	Output is correct
24	Correct	93 ms	103660 KB	Output is correct
25	Correct	96 ms	103660 KB	Output is correct
26	Correct	92 ms	103660 KB	Output is correct
27	Correct	137 ms	109720 KB	Output is correct
28	Correct	144 ms	109720 KB	Output is correct
29	Correct	350 ms	130160 KB	Output is correct
30	Correct	359 ms	130284 KB	Output is correct
31	Correct	394 ms	130400 KB	Output is correct
32	Correct	315 ms	130656 KB	Output is correct
33	Correct	349 ms	132396 KB	Output is correct
34	Correct	393 ms	132396 KB	Output is correct
35	Correct	314 ms	132396 KB	Output is correct
36	Correct	307 ms	132396 KB	Output is correct
37	Correct	307 ms	132396 KB	Output is correct
38	Correct	302 ms	133768 KB	Output is correct
39	Correct	322 ms	133768 KB	Output is correct
40	Correct	328 ms	133792 KB	Output is correct
41	Correct	305 ms	133792 KB	Output is correct
42	Correct	313 ms	134928 KB	Output is correct
43	Correct	359 ms	135164 KB	Output is correct
44	Correct	347 ms	135272 KB	Output is correct
45	Correct	202 ms	135272 KB	Output is correct
46	Correct	374 ms	135272 KB	Output is correct
47	Correct	5192 ms	258964 KB	Output is correct
48	Correct	4802 ms	326784 KB	Output is correct
49	Correct	5559 ms	372140 KB	Output is correct
50	Correct	5481 ms	372140 KB	Output is correct
51	Correct	5247 ms	376236 KB	Output is correct
52	Correct	5304 ms	385968 KB	Output is correct
53	Correct	5519 ms	388132 KB	Output is correct
54	Correct	5695 ms	388132 KB	Output is correct
55	Correct	5294 ms	388960 KB	Output is correct
56	Correct	5848 ms	411768 KB	Output is correct
57	Correct	5457 ms	434500 KB	Output is correct
58	Correct	5883 ms	454436 KB	Output is correct
59	Correct	5723 ms	478616 KB	Output is correct
60	Correct	6447 ms	498040 KB	Output is correct
61	Correct	6458 ms	519816 KB	Output is correct
62	Correct	6004 ms	535976 KB	Output is correct
63	Correct	6857 ms	551904 KB	Output is correct
64	Correct	2808 ms	551904 KB	Output is correct
65	Correct	2740 ms	551904 KB	Output is correct
66	Correct	265 ms	551904 KB	Output is correct
67	Correct	562 ms	551904 KB	Output is correct
68	Correct	1544 ms	551904 KB	Output is correct
69	Correct	2086 ms	551904 KB	Output is correct
70	Correct	2357 ms	551904 KB	Output is correct
71	Correct	9776 ms	551904 KB	Output is correct
72	Correct	8906 ms	551904 KB	Output is correct
73	Correct	10176 ms	551904 KB	Output is correct
74	Correct	10880 ms	551904 KB	Output is correct
75	Correct	7829 ms	551904 KB	Output is correct
76	Correct	8113 ms	551904 KB	Output is correct
77	Correct	7877 ms	551904 KB	Output is correct
78	Correct	10724 ms	551904 KB	Output is correct
79	Correct	11316 ms	551904 KB	Output is correct
80	Correct	11811 ms	551904 KB	Output is correct
81	Correct	11062 ms	551904 KB	Output is correct
82	Correct	11202 ms	551904 KB	Output is correct
83	Correct	10539 ms	551904 KB	Output is correct
84	Correct	10564 ms	575008 KB	Output is correct
85	Correct	4470 ms	575008 KB	Output is correct

답안 #58290

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 35.0 / 35.0

Subtask #3 15.0 / 15.0

Subtask #4 38.0 / 38.0

Subtask #1
12.0 / 12.0

Subtask #2
35.0 / 35.0

Subtask #3
15.0 / 15.0

Subtask #4
38.0 / 38.0