oj.uz

답안 #62211

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
62211 2018-07-27T20:58:30 Z cki86201 Wild Boar (JOI18_wild_boar) C++11
100 / 100
 16440 ms 842416 KB 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <iostream>
#include <functional>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <bitset>

using namespace std;
typedef long long ll;
#define Fi first
#define Se second
#define pb(x) push_back(x)
#define szz(x) ((int)(x).size())
#define rep(i, n) for(int i=0;i<n;i++)
#define all(x) (x).begin(), (x).end()
typedef tuple<int, int, int> t3;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef long double ldouble;

typedef pair<ll, int> pli;

int N, M, T, L;
t3 edgen[4040];
int edgec[2020][2020];
vector <pii> IE[2020];
vector <int> nume[2020];
vector <int> numl[2020], numr[2020];
vector <pii> E[20020];
int cs;
void addedge(int x, int y, int c) {
	E[x].pb(pii(c, y));
}

ll dis[4040][4040], dtemp[12020];
int X[100010];
pii query[100010];

typedef pair<ll, pii> plp;

void updplp(plp &a, plp &b) {
	if(a.Fi > b.Fi) a = b;
	else if(a.Fi == b.Fi) {
		a.Se.Fi = min(a.Se.Fi, b.Se.Fi);
		a.Se.Se = min(a.Se.Se, b.Se.Se);
	}
}

ll Val[2020][2020][4][4];
int Idx_l[2020][2020][4];
int Idx_r[2020][2020][4];

struct node {
	node(){}
	node(int s, int e) {
		si = sj = 0;
		rep(a, 4) if(Idx_l[s][e][a] != -1) ++si;
		rep(a, 4) if(Idx_r[s][e][a] != -1) ++sj;
		rep(a, si) rep(b, sj) V[a][b] = Val[s][e][a][b];
		rep(a, sj) ir[a] = Idx_r[s][e][a];
		rep(a, si) il[a] = Idx_l[s][e][a];
	}
	ll V[4][4];
	int ir[4], il[4];
	int si, sj;
	void init() {
		rep(i, 4) ir[i] = il[i] = -1;
		rep(i, 4) rep(j, 4) V[i][j] = 1e18;
	}
	ll Get() {
		ll res = 1e18;
		rep(i, 4) rep(j, 4) res = min(res, V[i][j]);
		return res;
	}
};

node merge(const node &lhs, const node &rhs) {
	node res; res.init();
	rep(i, lhs.si) res.il[i] = lhs.il[i]; res.si = lhs.si;
	rep(i, rhs.sj) res.ir[i] = rhs.ir[i]; res.sj = rhs.sj;
	rep(i, lhs.si) if(lhs.il[i] != -1) {
		rep(j, lhs.sj) if(lhs.ir[j] != -1) {
			ll v1 = lhs.V[i][j];
			if(v1 == 1e18) continue;
			rep(k, rhs.si) if(rhs.il[k] != -1 && rhs.il[k] != lhs.ir[j]) {
				rep(l, rhs.sj) if(rhs.ir[l] != -1) {
					if(res.V[i][l] > rhs.V[k][l] + v1) {
						res.V[i][l] = rhs.V[k][l] + v1;
					}
				}
			}
		}
	}
	return res;
}

node Tr[1<<18];

void Init(int rt, int l, int r) {
	if(l == r) {
		Tr[rt] = node(X[l], X[l+1]);
		return;
	}
	int m = (l + r) >> 1;
	Init(rt<<1, l, m);
	Init(rt<<1|1, m+1, r);
	Tr[rt] = merge(Tr[rt<<1], Tr[rt<<1|1]);
}

void update(int rt, int l, int r, int x) {
	if(l == r) {
		Tr[rt] = node(X[l], X[l+1]);
		return;
	}
	int m = (l + r) >> 1;
	if(x <= m) update(rt<<1, l, m, x);
	else update(rt<<1|1, m+1, r, x);
	Tr[rt] = merge(Tr[rt<<1], Tr[rt<<1|1]);
}

int main() {
	memset(edgec, -1, sizeof edgec);
	memset(Idx_l, -1, sizeof Idx_l);
	memset(Idx_r, -1, sizeof Idx_r);
	scanf("%d%d%d%d", &N, &M, &T, &L);
	rep(i, M) {
		int x, y, z;
		scanf("%d%d%d", &x, &y, &z);
		edgen[i<<1] = t3(x, y, z);
		edgec[x][y] = i<<1;
		edgen[i<<1|1] = t3(y, x, z);
		edgec[y][x] = i<<1|1;
		nume[x].pb(cs++);
		nume[y].pb(cs++);
		IE[x].pb(pii(z, y));
		IE[y].pb(pii(z, x));
	}
	for(int i=1;i<=N;i++) {
		int l = szz(IE[i]);
		numl[i].resize(l);
		numr[i].resize(l);
		rep(j, l) numl[i][j] = cs++;
		rep(j, l) numr[i][j] = cs++;
		for(int j=1;j<l;j++) {
			int x = numl[i][j-1], y = numl[i][j];
			addedge(y, x, 0);
			x = numr[i][j-1], y = numr[i][j];
			addedge(x, y, 0);
		}
		rep(j, l) {
			addedge(numl[i][j], nume[i][j], 0);
			addedge(numr[i][j], nume[i][j], 0);
		}
		rep(j, l) {
			int x = nume[i][j] ^ 1, len = get<2>(edgen[x]);
			if(j) addedge(x, numl[i][j-1], len);
			if(j < l-1) addedge(x, numr[i][j+1], len);
		}
	}
	rep(st, 2*M) {
		rep(i, cs) dtemp[i] = 1e18;
		dtemp[st] = 0;
		priority_queue <pli, vector<pli>, greater<pli> > pq;
		pq.push(pli(0, st));
		while(!pq.empty()) {
			pli t = pq.top(); pq.pop();
			if(dtemp[t.Se] != t.Fi) continue;
			for(pii e : E[t.Se]) {
				if(t.Fi + e.Fi < dtemp[e.Se]) {
					dtemp[e.Se] = t.Fi + e.Fi;
					pq.push(pli(dtemp[e.Se], e.Se));
				}
			}
		}
		rep(i, 2*M) dis[st][i] = dtemp[i];
	}
	
	for(int i=1;i<=N;i++) for(int j=1;j<=N;j++) rep(a, 4) rep(b, 4) Val[i][j][a][b] = 1e18;
	
	for(int i=1;i<=N;i++) for(int j=1;j<=N;j++) {
		int si = szz(IE[i]);
		int sj = szz(IE[j]);
		vector <vector <plp> > mn[4];
		vector <vector <ll> > val;
		rep(a, 4) {
			mn[a].resize(si);
			val.resize(si);
			rep(b, si) mn[a][b].resize(sj), val[b].resize(sj);
		}
		
		rep(k, si) {
			int eidx = nume[i][k];
			rep(l, sj) {
				int fidx = nume[j][l] ^ 1;
				plp pp = plp(dis[eidx][fidx] + get<2>(edgen[fidx]), pii(k, l));
				rep(t, 4) mn[t][k][l] = pp;
				val[k][l] = pp.Fi;
			}
		}
		rep(k, si) for(int l=1;l<sj;l++) for(int a : {0, 2}) updplp(mn[a][k][l], mn[a][k][l-1]);
		rep(k, si) for(int l=sj-2;l>=0;l--) for(int a : {1, 3}) updplp(mn[a][k][l], mn[a][k][l+1]);
		rep(l, sj) for(int k=1;k<si;k++) for(int a : {0, 1}) updplp(mn[a][k][l], mn[a][k-1][l]);
		rep(l, sj) for(int k=si-2;k>=0;k--) for(int a : {2, 3}) updplp(mn[a][k][l], mn[a][k+1][l]);
		set <int> idx_i, idx_j;
		rep(k, si) rep(l, sj) {
			plp r = plp(1e18, pii(-1, -1));
			if(k > 0 && l > 0) updplp(r, mn[0][k-1][l-1]);
			if(k > 0 && l < sj - 1) updplp(r, mn[1][k-1][l+1]);
			if(k < si - 1 && l > 0) updplp(r, mn[2][k+1][l-1]);
			if(k < si - 1 && l < sj - 1) updplp(r, mn[3][k+1][l+1]);
			if(r.Se.Fi != -1) idx_i.insert(r.Se.Fi);
			if(r.Se.Se != -1) idx_j.insert(r.Se.Se);
		}
		rep(k, si) {
			plp r = plp(1e18, pii(-1, -1));
			if(k > 0) updplp(r, mn[0][k-1][sj-1]);
			if(k < si - 1) updplp(r, mn[2][k+1][sj-1]);
			if(r.Se.Fi != -1) idx_i.insert(r.Se.Fi);
			if(r.Se.Se != -1) idx_j.insert(r.Se.Se);
		}
		rep(l, sj) {
			plp r = plp(1e18, pii(-1, -1));
			if(l > 0) updplp(r, mn[0][si-1][l-1]);
			if(l < sj - 1) updplp(r, mn[1][si-1][l+1]);
			if(r.Se.Fi != -1) idx_i.insert(r.Se.Fi);
			if(r.Se.Se != -1) idx_j.insert(r.Se.Se);
		}
		plp r = plp(1e18, pii(-1, -1));
		updplp(r, mn[0][si-1][sj-1]);
		if(r.Se.Fi != -1) idx_i.insert(r.Se.Fi);
		if(r.Se.Se != -1) idx_j.insert(r.Se.Se);
		vector <int> vi, vj;
		for(int e : idx_i) vi.pb(e);
		for(int e : idx_j) vj.pb(e);
		rep(a, szz(vi)) Idx_l[i][j][a] = IE[i][vi[a]].Se;
		rep(a, szz(vj)) Idx_r[i][j][a] = IE[j][vj[a]].Se;
		rep(a, szz(vi)) rep(b, szz(vj)) {
			Val[i][j][a][b] = val[vi[a]][vj[b]];
		}
	}
	
	for(int i=1;i<=L;i++) scanf("%d", X+i);
	for(int i=1;i<=T;i++) {
		int x, y; scanf("%d%d", &x, &y);
		query[i] = pii(x, y);
	}
	
	Init(1, 1, L - 1);
	for(int i=1;i<=T;i++) {
		int x = query[i].Fi;
		int y = query[i].Se;
		X[x] = y;
		if(x > 1) update(1, 1, L - 1, x - 1);
		if(x < L) update(1, 1, L - 1, x);
		ll val = Tr[1].Get();
		if(val >= 1e18) puts("-1");
		else printf("%lld\n", val);
	}

	return 0;
}

Compilation message

wild_boar.cpp: In function 'node merge(const node&, const node&)':
wild_boar.cpp:25:19: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
 #define rep(i, n) for(int i=0;i<n;i++)
                   ^
wild_boar.cpp:90:2: note: in expansion of macro 'rep'
  rep(i, lhs.si) res.il[i] = lhs.il[i]; res.si = lhs.si;
  ^~~
wild_boar.cpp:90:40: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  rep(i, lhs.si) res.il[i] = lhs.il[i]; res.si = lhs.si;
                                        ^~~
wild_boar.cpp:25:19: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
 #define rep(i, n) for(int i=0;i<n;i++)
                   ^
wild_boar.cpp:91:2: note: in expansion of macro 'rep'
  rep(i, rhs.sj) res.ir[i] = rhs.ir[i]; res.sj = rhs.sj;
  ^~~
wild_boar.cpp:91:40: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  rep(i, rhs.sj) res.ir[i] = rhs.ir[i]; res.sj = rhs.sj;
                                        ^~~
wild_boar.cpp: In function 'int main()':
wild_boar.cpp:136:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d%d", &N, &M, &T, &L);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
wild_boar.cpp:139:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &x, &y, &z);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~
wild_boar.cpp:253:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=L;i++) scanf("%d", X+i);
                        ~~~~~^~~~~~~~~~~
wild_boar.cpp:255:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int x, y; scanf("%d%d", &x, &y);
             ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 113 ms 144760 KB Output is correct
2 Correct 120 ms 144868 KB Output is correct
3 Correct 131 ms 144944 KB Output is correct
4 Correct 119 ms 145096 KB Output is correct
5 Correct 122 ms 145096 KB Output is correct
6 Correct 116 ms 145140 KB Output is correct
7 Correct 154 ms 145140 KB Output is correct
8 Correct 130 ms 145140 KB Output is correct
9 Correct 121 ms 145140 KB Output is correct
10 Correct 137 ms 145140 KB Output is correct
11 Correct 141 ms 145140 KB Output is correct
12 Correct 138 ms 145140 KB Output is correct
13 Correct 159 ms 145160 KB Output is correct
14 Correct 140 ms 145160 KB Output is correct
15 Correct 115 ms 145216 KB Output is correct
16 Correct 131 ms 145216 KB Output is correct
17 Correct 115 ms 145216 KB Output is correct
18 Correct 144 ms 145216 KB Output is correct
19 Correct 120 ms 145216 KB Output is correct
20 Correct 112 ms 145216 KB Output is correct
21 Correct 144 ms 145216 KB Output is correct
22 Correct 113 ms 145216 KB Output is correct
23 Correct 116 ms 145216 KB Output is correct
24 Correct 128 ms 145220 KB Output is correct
25 Correct 116 ms 145220 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 113 ms 144760 KB Output is correct
2 Correct 120 ms 144868 KB Output is correct
3 Correct 131 ms 144944 KB Output is correct
4 Correct 119 ms 145096 KB Output is correct
5 Correct 122 ms 145096 KB Output is correct
6 Correct 116 ms 145140 KB Output is correct
7 Correct 154 ms 145140 KB Output is correct
8 Correct 130 ms 145140 KB Output is correct
9 Correct 121 ms 145140 KB Output is correct
10 Correct 137 ms 145140 KB Output is correct
11 Correct 141 ms 145140 KB Output is correct
12 Correct 138 ms 145140 KB Output is correct
13 Correct 159 ms 145160 KB Output is correct
14 Correct 140 ms 145160 KB Output is correct
15 Correct 115 ms 145216 KB Output is correct
16 Correct 131 ms 145216 KB Output is correct
17 Correct 115 ms 145216 KB Output is correct
18 Correct 144 ms 145216 KB Output is correct
19 Correct 120 ms 145216 KB Output is correct
20 Correct 112 ms 145216 KB Output is correct
21 Correct 144 ms 145216 KB Output is correct
22 Correct 113 ms 145216 KB Output is correct
23 Correct 116 ms 145216 KB Output is correct
24 Correct 128 ms 145220 KB Output is correct
25 Correct 116 ms 145220 KB Output is correct
26 Correct 146 ms 145576 KB Output is correct
27 Correct 231 ms 191276 KB Output is correct
28 Correct 265 ms 191376 KB Output is correct
29 Correct 493 ms 195564 KB Output is correct
30 Correct 464 ms 195744 KB Output is correct
31 Correct 524 ms 195744 KB Output is correct
32 Correct 474 ms 195744 KB Output is correct
33 Correct 452 ms 197364 KB Output is correct
34 Correct 506 ms 197364 KB Output is correct
35 Correct 357 ms 197492 KB Output is correct
36 Correct 417 ms 197492 KB Output is correct
37 Correct 494 ms 197492 KB Output is correct
38 Correct 425 ms 199652 KB Output is correct
39 Correct 470 ms 199864 KB Output is correct
40 Correct 408 ms 199864 KB Output is correct
41 Correct 514 ms 199864 KB Output is correct
42 Correct 465 ms 201700 KB Output is correct
43 Correct 486 ms 202884 KB Output is correct
44 Correct 489 ms 202988 KB Output is correct
45 Correct 470 ms 206552 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 113 ms 144760 KB Output is correct
2 Correct 120 ms 144868 KB Output is correct
3 Correct 131 ms 144944 KB Output is correct
4 Correct 119 ms 145096 KB Output is correct
5 Correct 122 ms 145096 KB Output is correct
6 Correct 116 ms 145140 KB Output is correct
7 Correct 154 ms 145140 KB Output is correct
8 Correct 130 ms 145140 KB Output is correct
9 Correct 121 ms 145140 KB Output is correct
10 Correct 137 ms 145140 KB Output is correct
11 Correct 141 ms 145140 KB Output is correct
12 Correct 138 ms 145140 KB Output is correct
13 Correct 159 ms 145160 KB Output is correct
14 Correct 140 ms 145160 KB Output is correct
15 Correct 115 ms 145216 KB Output is correct
16 Correct 131 ms 145216 KB Output is correct
17 Correct 115 ms 145216 KB Output is correct
18 Correct 144 ms 145216 KB Output is correct
19 Correct 120 ms 145216 KB Output is correct
20 Correct 112 ms 145216 KB Output is correct
21 Correct 144 ms 145216 KB Output is correct
22 Correct 113 ms 145216 KB Output is correct
23 Correct 116 ms 145216 KB Output is correct
24 Correct 128 ms 145220 KB Output is correct
25 Correct 116 ms 145220 KB Output is correct
26 Correct 146 ms 145576 KB Output is correct
27 Correct 231 ms 191276 KB Output is correct
28 Correct 265 ms 191376 KB Output is correct
29 Correct 493 ms 195564 KB Output is correct
30 Correct 464 ms 195744 KB Output is correct
31 Correct 524 ms 195744 KB Output is correct
32 Correct 474 ms 195744 KB Output is correct
33 Correct 452 ms 197364 KB Output is correct
34 Correct 506 ms 197364 KB Output is correct
35 Correct 357 ms 197492 KB Output is correct
36 Correct 417 ms 197492 KB Output is correct
37 Correct 494 ms 197492 KB Output is correct
38 Correct 425 ms 199652 KB Output is correct
39 Correct 470 ms 199864 KB Output is correct
40 Correct 408 ms 199864 KB Output is correct
41 Correct 514 ms 199864 KB Output is correct
42 Correct 465 ms 201700 KB Output is correct
43 Correct 486 ms 202884 KB Output is correct
44 Correct 489 ms 202988 KB Output is correct
45 Correct 470 ms 206552 KB Output is correct
46 Correct 870 ms 206552 KB Output is correct
47 Correct 13597 ms 349244 KB Output is correct
48 Correct 12991 ms 399488 KB Output is correct
49 Correct 11979 ms 445388 KB Output is correct
50 Correct 11920 ms 445592 KB Output is correct
51 Correct 13336 ms 445592 KB Output is correct
52 Correct 15698 ms 445592 KB Output is correct
53 Correct 16440 ms 445592 KB Output is correct
54 Correct 15468 ms 445592 KB Output is correct
55 Correct 15650 ms 445592 KB Output is correct
56 Correct 15274 ms 472092 KB Output is correct
57 Correct 15651 ms 501244 KB Output is correct
58 Correct 13627 ms 532988 KB Output is correct
59 Correct 13308 ms 567196 KB Output is correct
60 Correct 14682 ms 603836 KB Output is correct
61 Correct 15153 ms 642952 KB Output is correct
62 Correct 14002 ms 684708 KB Output is correct
63 Correct 12466 ms 728764 KB Output is correct
64 Correct 10039 ms 821832 KB Output is correct
65 Correct 10003 ms 821832 KB Output is correct

Subtask #4
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 113 ms 144760 KB Output is correct
2 Correct 120 ms 144868 KB Output is correct
3 Correct 131 ms 144944 KB Output is correct
4 Correct 119 ms 145096 KB Output is correct
5 Correct 122 ms 145096 KB Output is correct
6 Correct 116 ms 145140 KB Output is correct
7 Correct 154 ms 145140 KB Output is correct
8 Correct 130 ms 145140 KB Output is correct
9 Correct 121 ms 145140 KB Output is correct
10 Correct 137 ms 145140 KB Output is correct
11 Correct 141 ms 145140 KB Output is correct
12 Correct 138 ms 145140 KB Output is correct
13 Correct 159 ms 145160 KB Output is correct
14 Correct 140 ms 145160 KB Output is correct
15 Correct 115 ms 145216 KB Output is correct
16 Correct 131 ms 145216 KB Output is correct
17 Correct 115 ms 145216 KB Output is correct
18 Correct 144 ms 145216 KB Output is correct
19 Correct 120 ms 145216 KB Output is correct
20 Correct 112 ms 145216 KB Output is correct
21 Correct 144 ms 145216 KB Output is correct
22 Correct 113 ms 145216 KB Output is correct
23 Correct 116 ms 145216 KB Output is correct
24 Correct 128 ms 145220 KB Output is correct
25 Correct 116 ms 145220 KB Output is correct
26 Correct 146 ms 145576 KB Output is correct
27 Correct 231 ms 191276 KB Output is correct
28 Correct 265 ms 191376 KB Output is correct
29 Correct 493 ms 195564 KB Output is correct
30 Correct 464 ms 195744 KB Output is correct
31 Correct 524 ms 195744 KB Output is correct
32 Correct 474 ms 195744 KB Output is correct
33 Correct 452 ms 197364 KB Output is correct
34 Correct 506 ms 197364 KB Output is correct
35 Correct 357 ms 197492 KB Output is correct
36 Correct 417 ms 197492 KB Output is correct
37 Correct 494 ms 197492 KB Output is correct
38 Correct 425 ms 199652 KB Output is correct
39 Correct 470 ms 199864 KB Output is correct
40 Correct 408 ms 199864 KB Output is correct
41 Correct 514 ms 199864 KB Output is correct
42 Correct 465 ms 201700 KB Output is correct
43 Correct 486 ms 202884 KB Output is correct
44 Correct 489 ms 202988 KB Output is correct
45 Correct 470 ms 206552 KB Output is correct
46 Correct 870 ms 206552 KB Output is correct
47 Correct 13597 ms 349244 KB Output is correct
48 Correct 12991 ms 399488 KB Output is correct
49 Correct 11979 ms 445388 KB Output is correct
50 Correct 11920 ms 445592 KB Output is correct
51 Correct 13336 ms 445592 KB Output is correct
52 Correct 15698 ms 445592 KB Output is correct
53 Correct 16440 ms 445592 KB Output is correct
54 Correct 15468 ms 445592 KB Output is correct
55 Correct 15650 ms 445592 KB Output is correct
56 Correct 15274 ms 472092 KB Output is correct
57 Correct 15651 ms 501244 KB Output is correct
58 Correct 13627 ms 532988 KB Output is correct
59 Correct 13308 ms 567196 KB Output is correct
60 Correct 14682 ms 603836 KB Output is correct
61 Correct 15153 ms 642952 KB Output is correct
62 Correct 14002 ms 684708 KB Output is correct
63 Correct 12466 ms 728764 KB Output is correct
64 Correct 10039 ms 821832 KB Output is correct
65 Correct 10003 ms 821832 KB Output is correct
66 Correct 198 ms 821832 KB Output is correct
67 Correct 2358 ms 821832 KB Output is correct
68 Correct 8893 ms 821832 KB Output is correct
69 Correct 8086 ms 821832 KB Output is correct
70 Correct 9075 ms 824868 KB Output is correct
71 Correct 15442 ms 824868 KB Output is correct
72 Correct 13675 ms 824868 KB Output is correct
73 Correct 15360 ms 824868 KB Output is correct
74 Correct 15394 ms 824868 KB Output is correct
75 Correct 16389 ms 824868 KB Output is correct
76 Correct 13878 ms 824868 KB Output is correct
77 Correct 14001 ms 824868 KB Output is correct
78 Correct 13722 ms 824868 KB Output is correct
79 Correct 16113 ms 824868 KB Output is correct
80 Correct 14110 ms 824868 KB Output is correct
81 Correct 13273 ms 824868 KB Output is correct
82 Correct 14338 ms 824868 KB Output is correct
83 Correct 15051 ms 824868 KB Output is correct
84 Correct 14360 ms 824868 KB Output is correct
85 Correct 9448 ms 842416 KB Output is correct