oj.uz

Submission #154557

# Submission time Handle Problem Language Result Execution time Memory
154557 2019-09-22T17:36:32 Z liwi Rectangles (IOI19_rect) C++14
72 / 100
 5000 ms 931220 KB 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse4,popcnt,abm,mmx,tune=native")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;

#define scan(x) do{while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0');}while(0)
char _;
#define complete_unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define all(a) a.begin(),a.end()
#define println printf("\n");
#define readln(x) getline(cin,x);
#define pb push_back
#define endl "\n"
#define INT_INF 0x3f3f3f3f
#define LL_INF 0x3f3f3f3f3f3f3f3f
#define MOD 1000000007
#define MOD2 1494318097
#define SEED 131
#define mp make_pair
#define fastio cin.tie(0); cin.sync_with_stdio(0);

#define MAXN 2501

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef unordered_map<int,int> umii;
typedef pair<int,int> pii;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef pair<int,pii> triple;
typedef int8_t byte;

mt19937 g1(time(0));

int randint(int a, int b){return uniform_int_distribution<int>(a, b)(g1);}
ll randlong(ll a,ll b){return uniform_int_distribution<long long>(a, b)(g1);}

ll gcd(ll a, ll b){return b == 0 ? a : gcd(b, a % b);}
ll lcm(ll a, ll b){return a*b/gcd(a,b);}
ll fpow(ll  b, ll exp, ll mod){if(exp == 0) return 1;ll t = fpow(b,exp/2,mod);if(exp&1) return t*t%mod*b%mod;return t*t%mod;}
ll divmod(ll i, ll j, ll mod){i%=mod,j%=mod;return i*fpow(j,mod-2,mod)%mod;}

int num_rows,num_cols,arr[MAXN][MAXN],bit[MAXN],cnt[MAXN][MAXN],ans,l,r,lst[MAXN],pp;
vector<pii> row_dp[MAXN][MAXN],col_dp[MAXN][MAXN];
pii dq[MAXN];
//vector<pii> rows[MAXN],cols[MAXN];
//vector<int> h_segs[MAXN][MAXN],v_segs[MAXN][MAXN];
//vector<int> r_range[MAXN][MAXN],v_range[MAXN][MAXN];

inline void update(int pos, int val, int curr){
	for(int i=pos; i<=num_cols; i+=i&-i){
		if(lst[i] != curr) bit[i] = val, lst[i] = curr;
		else bit[i]+=val;
	}
}

inline int query(int pos, int curr){
	int res = 0;
	for(int i=pos; i>0; i-=i&-i)
		if(lst[i] == curr)
			res+=bit[i];
	return res;
}

inline void init_rows(){
//	memset(cnt,0,sizeof cnt);
	for(int i=2; i<num_rows; i++){
		l = 1, r = 0;
		for(int k=1; k<=num_cols; k++){
			while(r-l+1 > 0 && dq[r].first < arr[i][k]) r--;
			int lft = (r-l+1>0?dq[r].second:INT_INF);
			if(lft < k-1 && (row_dp[lft+1][k-1].empty() || row_dp[lft+1][k-1].back().first != i))
				row_dp[lft+1][k-1].emplace_back(i,i), cnt[lft+1][k-1]++; //rows[i].pb(mp(lft+1,k-1));
			while(r-l+1 > 0 && dq[r].first == arr[i][k]) r--;
			dq[++r] = mp(arr[i][k],k);
		}
		l = 1, r = 0;
		for(int k=num_cols; k>=1; k--){
			while(r-l+1 > 0 && dq[r].first < arr[i][k]) r--;
			int rgt = (r-l+1>0?dq[r].second:-INT_INF);
			if(rgt > k+1 && (row_dp[k+1][rgt-1].empty() || row_dp[k+1][rgt-1].back().first != i))
				row_dp[k+1][rgt-1].emplace_back(i,i), cnt[k+1][rgt-1]++; //rows[i].pb(mp(k+1,rgt-1));
			while(r-l+1 > 0 && dq[r].first == arr[i][k]) r--;
			dq[++r] = mp(arr[i][k],k);
		}
	}
}

inline void init_cols(){
	memset(cnt,0,sizeof cnt);
	for(int i=2; i<num_cols; i++){
		l = 1, r = 0;
		for(int k=1; k<=num_rows; k++){
			while(r-l+1 > 0 && dq[r].first < arr[k][i]) r--;
			int lft = (r-l+1>0?dq[r].second:INT_INF);
			if(lft < k-1 && (col_dp[lft+1][k-1].empty() || col_dp[lft+1][k-1].back().first != i))
				col_dp[lft+1][k-1].emplace_back(i,i), cnt[lft+1][k-1]++; //cols[i].pb(mp(lft+1,k-1));
			while(r-l+1 > 0 && dq[r].first == arr[k][i]) r--;
			dq[++r] = mp(arr[k][i],k);
		}
		l = 1, r = 0;
		for(int k=num_rows; k>=1; k--){
			while(r-l+1 > 0 && dq[r].first < arr[k][i]) r--;
			int rgt = (r-l+1>0?dq[r].second:-INT_INF);
			if(rgt > k+1 && (col_dp[k+1][rgt-1].empty() || col_dp[k+1][rgt-1].back().first != i))
				col_dp[k+1][rgt-1].emplace_back(i,i), cnt[k+1][rgt-1]++; //cols[i].pb(mp(k+1,rgt-1));
			while(r-l+1 > 0 && dq[r].first == arr[k][i]) r--;
			dq[++r] = mp(arr[k][i],k);
		}
	}
}

inline void calc_hor_dp(){
//	for(int i=2; i<num_rows; i++){
//		sort(all(rows[i])); complete_unique(rows[i]);
//		for(pii check:rows[i]){
//			h_segs[check.first][check.second].pb(i);
////			r_range[i][check.first].pb(check.second);
//		}
//		rows[i].clear();
//	}
	vector<pair<pii,int>> dep[MAXN];
	for(int l=2; l<=num_cols-1; l++){
		for(int r=l; r<=num_cols-1; r++){
			if(cnt[l][r] == 0) continue;
			vector<pii> &nums = row_dp[l][r];
//			sort(all(nums)); complete_unique(nums);
//			vector<pii> t;
			int lst = 0;
			for(int i=1; i<cnt[l][r]; i++){
				if(nums[i].first == nums[i-1].first+1) continue;
				for(int k=nums[lst].first; k<=nums[i-1].first; k++)
					dep[nums[i-1].first-k+1].emplace_back(mp(k,l),r);
//					row_dp[k][l].pb(mp(nums[i-1].first-k+1,r));
				lst = i;
			}
			for(int k=nums[lst].first; k<=nums[cnt[l][r]-1].first; k++)
				dep[nums[cnt[l][r]-1].first-k+1].emplace_back(mp(k,l),r);
//				row_dp[k][l].pb(mp(nums[cnt[l][r]-1].first-k+1,r));
			nums.clear();
		}
	}
	for(int i=1; i<=num_rows; i++){
		for(auto &check:dep[i])
			row_dp[check.first.first][check.first.second].emplace_back(i,check.second);
	}
//	for(int l=2; l<=num_cols-1; l++){
//		for(int r=l; r<=num_cols-1; r++){
//			reverse(all(row_dp[l][r]));
//			while(cnt[l][r]--) row_dp[l][r].pop_back();
//			reverse(all(row_dp[l][r]));
//		}
//	}
}

inline void calc_col_dp(){
//	for(int i=2; i<num_cols; i++){
//		sort(all(cols[i])); complete_unique(cols[i]);
//		for(pii check:cols[i]){
//			v_segs[check.first][check.second].pb(i);
////			v_range[check.first][i].pb(check.second);
//		}
//		cols[i].clear();
//	}
	for(int l=2; l<=num_rows-1; l++){
		for(int r=l; r<=num_rows-1; r++){
			if(cnt[l][r] == 0) continue;
			vector<pii> &nums = col_dp[l][r];
//			sort(all(nums)); complete_unique(nums);
			int lst = 0;
			for(int i=1; i<cnt[l][r]; i++){
				if(nums[i].first == nums[i-1].first+1) continue;
				for(int k=nums[lst].first; k<=nums[i-1].first; k++)
					col_dp[l][k].emplace_back(r,nums[i-1].first);
				lst = i;
			}
			for(int k=nums[lst].first; k<=nums[cnt[l][r]-1].first; k++)
				col_dp[l][k].emplace_back(r,nums[cnt[l][r]-1].first);
		}
	}
//	for(int l=2; l<=num_cols-1; l++){
//		for(int r=l; r<=num_cols-1; r++){
//			reverse(all(col_dp[l][r]));
//			while(cnt[l][r]--) col_dp[l][r].pop_back();
//			reverse(all(col_dp[l][r]));
//		}
//	}
}

ll count_rectangles(vector<vector<int>> a){
	ans = 0, num_rows = (int)a.size(), num_cols = (int)a[0].size();
	for(int i=0; i<a.size(); i++)
		for(int k=0; k<a[i].size(); k++)
			arr[i+1][k+1] = a[i][k];
	init_rows(); calc_hor_dp();
	init_cols(); calc_col_dp();
	for(int i=num_rows-1; i>=2; i--){
		for(int k=num_cols-1; k>=2; k--){
//			sort(all(row_dp[i][k]));
//			sort(all(col_dp[i][k]));
			int ptr = cnt[i][k], res = 0, cc = 0; ++pp;
			for(int v=0; v<row_dp[i][k].size(); v++){
//				pii curr = row_dp[i][k][v];
				while(ptr < col_dp[i][k].size() && col_dp[i][k][ptr].first-i+1 <= row_dp[i][k][v].first){
//					assert(col_dp[i][k][ptr].second>=k);
					update(col_dp[i][k][ptr].second-k+1,1,pp);
					ptr++, cc++;
				}
				res+=cc-query(row_dp[i][k][v].second-k,pp);
			}
//			while(--ptr >= cnt[i][k]) update(col_dp[i][k][ptr].second-k+1,-1);
			ans+=res;
		}
	}
	return ans;
}

Compilation message

rect.cpp: In function 'll count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:200:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<a.size(); i++)
               ~^~~~~~~~~
rect.cpp:201:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int k=0; k<a[i].size(); k++)
                ~^~~~~~~~~~~~
rect.cpp:210:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int v=0; v<row_dp[i][k].size(); v++){
                 ~^~~~~~~~~~~~~~~~~~~~
rect.cpp:212:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(ptr < col_dp[i][k].size() && col_dp[i][k][ptr].first-i+1 <= row_dp[i][k][v].first){
           ~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 327 ms 318712 KB Output is correct
2 Correct 307 ms 318812 KB Output is correct
3 Correct 314 ms 318888 KB Output is correct
4 Correct 308 ms 318972 KB Output is correct
5 Correct 308 ms 318712 KB Output is correct
6 Correct 309 ms 318804 KB Output is correct
7 Correct 317 ms 318852 KB Output is correct
8 Correct 312 ms 318924 KB Output is correct
9 Correct 315 ms 318844 KB Output is correct
10 Correct 329 ms 318840 KB Output is correct
11 Correct 310 ms 318876 KB Output is correct
12 Correct 309 ms 318824 KB Output is correct
13 Correct 313 ms 318680 KB Output is correct
14 Correct 309 ms 318712 KB Output is correct
15 Correct 322 ms 318740 KB Output is correct
16 Correct 312 ms 318588 KB Output is correct
17 Correct 323 ms 318672 KB Output is correct
18 Correct 311 ms 318648 KB Output is correct
19 Correct 306 ms 318840 KB Output is correct
20 Correct 309 ms 318788 KB Output is correct
21 Correct 320 ms 318712 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 327 ms 318712 KB Output is correct
2 Correct 307 ms 318812 KB Output is correct
3 Correct 314 ms 318888 KB Output is correct
4 Correct 308 ms 318972 KB Output is correct
5 Correct 308 ms 318712 KB Output is correct
6 Correct 309 ms 318804 KB Output is correct
7 Correct 317 ms 318852 KB Output is correct
8 Correct 312 ms 318924 KB Output is correct
9 Correct 315 ms 318844 KB Output is correct
10 Correct 329 ms 318840 KB Output is correct
11 Correct 310 ms 318876 KB Output is correct
12 Correct 309 ms 318824 KB Output is correct
13 Correct 313 ms 318680 KB Output is correct
14 Correct 309 ms 318712 KB Output is correct
15 Correct 322 ms 318740 KB Output is correct
16 Correct 312 ms 318588 KB Output is correct
17 Correct 311 ms 319608 KB Output is correct
18 Correct 323 ms 319796 KB Output is correct
19 Correct 311 ms 319596 KB Output is correct
20 Correct 311 ms 319220 KB Output is correct
21 Correct 312 ms 319480 KB Output is correct
22 Correct 311 ms 319452 KB Output is correct
23 Correct 311 ms 319480 KB Output is correct
24 Correct 318 ms 319160 KB Output is correct
25 Correct 323 ms 318672 KB Output is correct
26 Correct 311 ms 318648 KB Output is correct
27 Correct 306 ms 318840 KB Output is correct
28 Correct 309 ms 318788 KB Output is correct
29 Correct 320 ms 318712 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 327 ms 318712 KB Output is correct
2 Correct 307 ms 318812 KB Output is correct
3 Correct 314 ms 318888 KB Output is correct
4 Correct 308 ms 318972 KB Output is correct
5 Correct 308 ms 318712 KB Output is correct
6 Correct 309 ms 318804 KB Output is correct
7 Correct 317 ms 318852 KB Output is correct
8 Correct 312 ms 318924 KB Output is correct
9 Correct 315 ms 318844 KB Output is correct
10 Correct 329 ms 318840 KB Output is correct
11 Correct 310 ms 318876 KB Output is correct
12 Correct 309 ms 318824 KB Output is correct
13 Correct 313 ms 318680 KB Output is correct
14 Correct 309 ms 318712 KB Output is correct
15 Correct 322 ms 318740 KB Output is correct
16 Correct 312 ms 318588 KB Output is correct
17 Correct 311 ms 319608 KB Output is correct
18 Correct 323 ms 319796 KB Output is correct
19 Correct 311 ms 319596 KB Output is correct
20 Correct 311 ms 319220 KB Output is correct
21 Correct 312 ms 319480 KB Output is correct
22 Correct 311 ms 319452 KB Output is correct
23 Correct 311 ms 319480 KB Output is correct
24 Correct 318 ms 319160 KB Output is correct
25 Correct 329 ms 323420 KB Output is correct
26 Correct 330 ms 323408 KB Output is correct
27 Correct 322 ms 323568 KB Output is correct
28 Correct 320 ms 321368 KB Output is correct
29 Correct 328 ms 322476 KB Output is correct
30 Correct 332 ms 322592 KB Output is correct
31 Correct 329 ms 322424 KB Output is correct
32 Correct 329 ms 322304 KB Output is correct
33 Correct 323 ms 318672 KB Output is correct
34 Correct 311 ms 318648 KB Output is correct
35 Correct 306 ms 318840 KB Output is correct
36 Correct 309 ms 318788 KB Output is correct
37 Correct 320 ms 318712 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 327 ms 318712 KB Output is correct
2 Correct 307 ms 318812 KB Output is correct
3 Correct 314 ms 318888 KB Output is correct
4 Correct 308 ms 318972 KB Output is correct
5 Correct 308 ms 318712 KB Output is correct
6 Correct 309 ms 318804 KB Output is correct
7 Correct 317 ms 318852 KB Output is correct
8 Correct 312 ms 318924 KB Output is correct
9 Correct 315 ms 318844 KB Output is correct
10 Correct 329 ms 318840 KB Output is correct
11 Correct 310 ms 318876 KB Output is correct
12 Correct 309 ms 318824 KB Output is correct
13 Correct 313 ms 318680 KB Output is correct
14 Correct 309 ms 318712 KB Output is correct
15 Correct 322 ms 318740 KB Output is correct
16 Correct 312 ms 318588 KB Output is correct
17 Correct 311 ms 319608 KB Output is correct
18 Correct 323 ms 319796 KB Output is correct
19 Correct 311 ms 319596 KB Output is correct
20 Correct 311 ms 319220 KB Output is correct
21 Correct 312 ms 319480 KB Output is correct
22 Correct 311 ms 319452 KB Output is correct
23 Correct 311 ms 319480 KB Output is correct
24 Correct 318 ms 319160 KB Output is correct
25 Correct 329 ms 323420 KB Output is correct
26 Correct 330 ms 323408 KB Output is correct
27 Correct 322 ms 323568 KB Output is correct
28 Correct 320 ms 321368 KB Output is correct
29 Correct 328 ms 322476 KB Output is correct
30 Correct 332 ms 322592 KB Output is correct
31 Correct 329 ms 322424 KB Output is correct
32 Correct 329 ms 322304 KB Output is correct
33 Correct 509 ms 352072 KB Output is correct
34 Correct 452 ms 351236 KB Output is correct
35 Correct 452 ms 351140 KB Output is correct
36 Correct 424 ms 350244 KB Output is correct
37 Correct 516 ms 371164 KB Output is correct
38 Correct 518 ms 371024 KB Output is correct
39 Correct 514 ms 371360 KB Output is correct
40 Correct 500 ms 368376 KB Output is correct
41 Correct 425 ms 338660 KB Output is correct
42 Correct 468 ms 342768 KB Output is correct
43 Correct 713 ms 356228 KB Output is correct
44 Correct 710 ms 357684 KB Output is correct
45 Correct 480 ms 339660 KB Output is correct
46 Correct 464 ms 338468 KB Output is correct
47 Correct 609 ms 354852 KB Output is correct
48 Correct 615 ms 355424 KB Output is correct
49 Correct 323 ms 318672 KB Output is correct
50 Correct 311 ms 318648 KB Output is correct
51 Correct 306 ms 318840 KB Output is correct
52 Correct 309 ms 318788 KB Output is correct
53 Correct 320 ms 318712 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 320 ms 319144 KB Output is correct
2 Correct 317 ms 319068 KB Output is correct
3 Correct 322 ms 318840 KB Output is correct
4 Correct 310 ms 318708 KB Output is correct
5 Correct 346 ms 319000 KB Output is correct
6 Correct 363 ms 318968 KB Output is correct
7 Correct 319 ms 319000 KB Output is correct
8 Correct 319 ms 318916 KB Output is correct
9 Correct 321 ms 318948 KB Output is correct
10 Correct 323 ms 318712 KB Output is correct
11 Correct 347 ms 318712 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 309 ms 318708 KB Output is correct
2 Correct 1123 ms 418352 KB Output is correct
3 Correct 2268 ms 530264 KB Output is correct
4 Correct 2276 ms 531188 KB Output is correct
5 Correct 2279 ms 531208 KB Output is correct
6 Correct 458 ms 356532 KB Output is correct
7 Correct 616 ms 390520 KB Output is correct
8 Correct 631 ms 393592 KB Output is correct
9 Correct 323 ms 318672 KB Output is correct
10 Correct 311 ms 318648 KB Output is correct
11 Correct 306 ms 318840 KB Output is correct
12 Correct 309 ms 318788 KB Output is correct
13 Correct 320 ms 318712 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 327 ms 318712 KB Output is correct
2 Correct 307 ms 318812 KB Output is correct
3 Correct 314 ms 318888 KB Output is correct
4 Correct 308 ms 318972 KB Output is correct
5 Correct 308 ms 318712 KB Output is correct
6 Correct 309 ms 318804 KB Output is correct
7 Correct 317 ms 318852 KB Output is correct
8 Correct 312 ms 318924 KB Output is correct
9 Correct 315 ms 318844 KB Output is correct
10 Correct 329 ms 318840 KB Output is correct
11 Correct 310 ms 318876 KB Output is correct
12 Correct 309 ms 318824 KB Output is correct
13 Correct 313 ms 318680 KB Output is correct
14 Correct 309 ms 318712 KB Output is correct
15 Correct 322 ms 318740 KB Output is correct
16 Correct 312 ms 318588 KB Output is correct
17 Correct 311 ms 319608 KB Output is correct
18 Correct 323 ms 319796 KB Output is correct
19 Correct 311 ms 319596 KB Output is correct
20 Correct 311 ms 319220 KB Output is correct
21 Correct 312 ms 319480 KB Output is correct
22 Correct 311 ms 319452 KB Output is correct
23 Correct 311 ms 319480 KB Output is correct
24 Correct 318 ms 319160 KB Output is correct
25 Correct 329 ms 323420 KB Output is correct
26 Correct 330 ms 323408 KB Output is correct
27 Correct 322 ms 323568 KB Output is correct
28 Correct 320 ms 321368 KB Output is correct
29 Correct 328 ms 322476 KB Output is correct
30 Correct 332 ms 322592 KB Output is correct
31 Correct 329 ms 322424 KB Output is correct
32 Correct 329 ms 322304 KB Output is correct
33 Correct 509 ms 352072 KB Output is correct
34 Correct 452 ms 351236 KB Output is correct
35 Correct 452 ms 351140 KB Output is correct
36 Correct 424 ms 350244 KB Output is correct
37 Correct 516 ms 371164 KB Output is correct
38 Correct 518 ms 371024 KB Output is correct
39 Correct 514 ms 371360 KB Output is correct
40 Correct 500 ms 368376 KB Output is correct
41 Correct 425 ms 338660 KB Output is correct
42 Correct 468 ms 342768 KB Output is correct
43 Correct 713 ms 356228 KB Output is correct
44 Correct 710 ms 357684 KB Output is correct
45 Correct 480 ms 339660 KB Output is correct
46 Correct 464 ms 338468 KB Output is correct
47 Correct 609 ms 354852 KB Output is correct
48 Correct 615 ms 355424 KB Output is correct
49 Correct 320 ms 319144 KB Output is correct
50 Correct 317 ms 319068 KB Output is correct
51 Correct 322 ms 318840 KB Output is correct
52 Correct 310 ms 318708 KB Output is correct
53 Correct 346 ms 319000 KB Output is correct
54 Correct 363 ms 318968 KB Output is correct
55 Correct 319 ms 319000 KB Output is correct
56 Correct 319 ms 318916 KB Output is correct
57 Correct 321 ms 318948 KB Output is correct
58 Correct 323 ms 318712 KB Output is correct
59 Correct 347 ms 318712 KB Output is correct
60 Correct 309 ms 318708 KB Output is correct
61 Correct 1123 ms 418352 KB Output is correct
62 Correct 2268 ms 530264 KB Output is correct
63 Correct 2276 ms 531188 KB Output is correct
64 Correct 2279 ms 531208 KB Output is correct
65 Correct 458 ms 356532 KB Output is correct
66 Correct 616 ms 390520 KB Output is correct
67 Correct 631 ms 393592 KB Output is correct
68 Correct 3246 ms 686364 KB Output is correct
69 Correct 2690 ms 668336 KB Output is correct
70 Correct 2523 ms 668120 KB Output is correct
71 Correct 1552 ms 650128 KB Output is correct
72 Correct 3423 ms 931220 KB Output is correct
73 Correct 3382 ms 582320 KB Output is correct
74 Correct 3616 ms 612284 KB Output is correct
75 Execution timed out 5053 ms 751692 KB Time limit exceeded
76 Halted 0 ms 0 KB -