oj.uz

Submission #792566

# Submission time Handle Problem Language Result Execution time Memory
792566 2023-07-25T06:57:59 Z 이종영(#10088) Real Mountains (CCO23_day1problem2) C++17
16 / 25
 5000 ms 31864 KB 
#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
//#include <bits/extc++.h>
//using namespace __gnu_pbds;
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
using ll=long long;
//uniform_int_distribution<> gen(1,100);
template <int MOD_> struct modnum{
private:
	int v;
public:
	static const int MOD = MOD_;
	modnum() : v(0) {}
	modnum(ll v_) : v(int(v_ % MOD)) { if (v < 0) v += MOD; }
	explicit operator int () const { return v; }
	friend bool operator == (const modnum& a, const modnum& b) { return a.v == b.v; }
	friend bool operator != (const modnum& a, const modnum& b) { return a.v != b.v; }
	friend bool operator < (const modnum& a, const modnum& b) { return a.v < b.v; }
	friend bool operator <= (const modnum& a, const modnum& b) { return a.v <= b.v; }
	friend bool operator > (const modnum& a, const modnum& b) { return a.v > b.v; }
	friend bool operator >= (const modnum& a, const modnum& b) { return a.v >= b.v; }
	modnum& operator += (const modnum& o) {
		v += o.v;
		if (v >= MOD) v -= MOD;
		return *this;
	}
	modnum& operator -= (const modnum& o) {
		v -= o.v;
		if (v < 0) v += MOD;
		return *this;
	}
	modnum& operator *= (const modnum& o) {
		v = int(ll(v) * ll(o.v) % MOD);
		return *this;
	}
	friend modnum pow(modnum a, ll p) {
		modnum ans = 1;
		for (; p; p /= 2, a *= a) if (p&1) ans *= a;
		return ans;
	}
	modnum operator ~ () const {
		modnum res;
		res.v = pow((modnum)v, MOD - 2).v;
		return res;
	}
	modnum& operator /= (const modnum& o) {
		return *this *= (~o);
	}
	modnum operator-() const { return modnum(-v); }
	modnum& operator++() { return *this += 1; }
	modnum operator++(int){ modnum tmp=*this; ++*this; return tmp; }
	modnum& operator--() { return *this -= 1; }
	modnum operator--(int){ modnum tmp=*this; --*this; return tmp; }
	friend modnum operator + (const modnum& a, const modnum& b) { return modnum(a) += b; }
	friend modnum operator - (const modnum& a, const modnum& b) { return modnum(a) -= b; }
	friend modnum operator * (const modnum& a, const modnum& b) { return modnum(a) *= b; }
	friend modnum operator / (const modnum& a, const modnum& b) { return modnum(a) /= b; }
	friend ostream& operator<<(std::ostream& os, const modnum& o)
	{
		os << o.v;
		return os;
	}
	friend istream& operator>>(std::istream& is, modnum& o)
	{
		is >> o.v;
		return is;
	}
};
const ll mod=1000003;
const int N=1e6+5;
using mi=modnum<mod>;
int n,l,r,p=1;
ll 	a[N],pfx[N],sfx[N];
mi ans;
set<int> S;
mi F(ll a){
	return a*(a+1)/2;
}
bool chk(){
	debug(vector<int>(a+1,a+n+1));
	for(int i=l;i<p;i++) if(a[i]>a[i+1]) return false;
	for(int i=p;i<r;i++) if(a[i]<a[i+1]) return false;
	return true;
}
int main(){
	ios::sync_with_stdio(false); cin.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++) cin>>a[i];
	for(int i=2;i<=n;i++) if(a[p]<a[i]) p=i;
	l=1; r=n;
	while(!chk()){
		int q=l;
		for(int i=l+1;i<=r;i++) if(a[i]<a[q]) q=i;
		if(a[q]==a[l]){
			l++; continue;
		}
		if(a[q]==a[r]){
			r--; continue;
		}
		int qq=0;
		for(int i=l;i<=r;i++) if(a[q]<a[i]&&(qq==0||a[i]<a[qq])) qq=i;
		pfx[l-1]=sfx[r+1]=(int)1e9+1;
		for(int i=l;i<=r;i++){
			pfx[i]=pfx[i-1];
			if(a[i]!=a[q]) pfx[i]=min(pfx[i],a[i]);
		}
		for(int i=r;i>=l;i--){
			sfx[i]=sfx[i+1];
			if(a[i]!=a[q]) sfx[i]=min(sfx[i],a[i]);
		}
		vector<int> v;
		for(int i=l;i<=r;i++) if(a[i]==a[q]) v.emplace_back(i);
		int sz=v.size();
		ans+=(F(a[qq]-1)-F(a[q]-1))*sz;
		debug((int)ans);
		if(v.size()==1){
			ans+=1ll*(a[qq]-a[q])*(pfx[v[0]]+sfx[v[0]]);
		} else{
			// p0 s0 sn
			// p0 pn sn
			int i=v[0],j=v.back();
			if(sfx[i]<pfx[j]){
				ans+=1ll*(a[qq]-a[q])%mod*(pfx[i]+sfx[i]+sfx[j])%mod;
			} else{
				ans+=1ll*(a[qq]-a[q])%mod*(pfx[i]+pfx[j]+sfx[j])%mod;
			}
			int sz=v.size();
			ans+=(F(a[qq])-F(a[q]))*(1+2*(sz-2));
		}
		for(int i: v) a[i]=a[qq];
	}
	cout<<ans;
	return 0;
}

Compilation message

Main.cpp: In function 'bool chk()':
Main.cpp:14:20: warning: statement has no effect [-Wunused-value]
   14 | #define debug(...) 42
      |                    ^~
Main.cpp:90:2: note: in expansion of macro 'debug'
   90 |  debug(vector<int>(a+1,a+n+1));
      |  ^~~~~
Main.cpp: In function 'int main()':
Main.cpp:14:20: warning: statement has no effect [-Wunused-value]
   14 | #define debug(...) 42
      |                    ^~
Main.cpp:125:3: note: in expansion of macro 'debug'
  125 |   debug((int)ans);
      |   ^~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 5 ms 468 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 4 ms 500 KB Output is correct
12 Correct 4 ms 468 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 5 ms 468 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 4 ms 500 KB Output is correct
12 Correct 4 ms 468 KB Output is correct
13 Correct 7 ms 468 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 7 ms 468 KB Output is correct
17 Correct 8 ms 468 KB Output is correct
18 Correct 7 ms 468 KB Output is correct
19 Correct 7 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 512 KB Output is correct
23 Correct 4 ms 520 KB Output is correct
24 Correct 3 ms 468 KB Output is correct
25 Correct 4 ms 468 KB Output is correct
26 Correct 9 ms 468 KB Output is correct
27 Correct 5 ms 524 KB Output is correct
28 Correct 4 ms 472 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 5 ms 468 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 4 ms 500 KB Output is correct
12 Correct 4 ms 468 KB Output is correct
13 Correct 7 ms 468 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 7 ms 468 KB Output is correct
17 Correct 8 ms 468 KB Output is correct
18 Correct 7 ms 468 KB Output is correct
19 Correct 7 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 512 KB Output is correct
23 Correct 4 ms 520 KB Output is correct
24 Correct 3 ms 468 KB Output is correct
25 Correct 4 ms 468 KB Output is correct
26 Correct 9 ms 468 KB Output is correct
27 Correct 5 ms 524 KB Output is correct
28 Correct 4 ms 472 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 186 ms 480 KB Output is correct
36 Correct 179 ms 480 KB Output is correct
37 Correct 192 ms 500 KB Output is correct
38 Correct 202 ms 476 KB Output is correct
39 Correct 182 ms 476 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 146 ms 460 KB Output is correct
44 Correct 140 ms 476 KB Output is correct
45 Correct 173 ms 468 KB Output is correct
46 Correct 155 ms 468 KB Output is correct
47 Correct 148 ms 480 KB Output is correct
48 Correct 147 ms 468 KB Output is correct

Subtask #4
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 5 ms 468 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 4 ms 500 KB Output is correct
12 Correct 4 ms 468 KB Output is correct
13 Correct 7 ms 468 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 7 ms 468 KB Output is correct
17 Correct 8 ms 468 KB Output is correct
18 Correct 7 ms 468 KB Output is correct
19 Correct 7 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 512 KB Output is correct
23 Correct 4 ms 520 KB Output is correct
24 Correct 3 ms 468 KB Output is correct
25 Correct 4 ms 468 KB Output is correct
26 Correct 9 ms 468 KB Output is correct
27 Correct 5 ms 524 KB Output is correct
28 Correct 4 ms 472 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 186 ms 480 KB Output is correct
36 Correct 179 ms 480 KB Output is correct
37 Correct 192 ms 500 KB Output is correct
38 Correct 202 ms 476 KB Output is correct
39 Correct 182 ms 476 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 146 ms 460 KB Output is correct
44 Correct 140 ms 476 KB Output is correct
45 Correct 173 ms 468 KB Output is correct
46 Correct 155 ms 468 KB Output is correct
47 Correct 148 ms 480 KB Output is correct
48 Correct 147 ms 468 KB Output is correct
49 Correct 186 ms 500 KB Output is correct
50 Correct 203 ms 484 KB Output is correct
51 Correct 204 ms 480 KB Output is correct
52 Correct 183 ms 508 KB Output is correct
53 Correct 186 ms 468 KB Output is correct
54 Correct 1 ms 468 KB Output is correct
55 Correct 1 ms 468 KB Output is correct
56 Correct 1 ms 480 KB Output is correct
57 Correct 141 ms 468 KB Output is correct
58 Correct 156 ms 480 KB Output is correct
59 Correct 161 ms 476 KB Output is correct
60 Correct 168 ms 488 KB Output is correct
61 Correct 166 ms 496 KB Output is correct
62 Correct 150 ms 508 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 5 ms 468 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 4 ms 500 KB Output is correct
12 Correct 4 ms 468 KB Output is correct
13 Correct 7 ms 468 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 7 ms 468 KB Output is correct
17 Correct 8 ms 468 KB Output is correct
18 Correct 7 ms 468 KB Output is correct
19 Correct 7 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 512 KB Output is correct
23 Correct 4 ms 520 KB Output is correct
24 Correct 3 ms 468 KB Output is correct
25 Correct 4 ms 468 KB Output is correct
26 Correct 9 ms 468 KB Output is correct
27 Correct 5 ms 524 KB Output is correct
28 Correct 4 ms 472 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1546 ms 31732 KB Output is correct
36 Correct 1538 ms 31788 KB Output is correct
37 Correct 1792 ms 31700 KB Output is correct
38 Correct 1597 ms 31732 KB Output is correct
39 Correct 1542 ms 31748 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 208 ms 31728 KB Output is correct
43 Correct 207 ms 31816 KB Output is correct
44 Correct 217 ms 31832 KB Output is correct
45 Correct 975 ms 31776 KB Output is correct
46 Correct 935 ms 31864 KB Output is correct
47 Correct 899 ms 31704 KB Output is correct
48 Correct 1272 ms 31732 KB Output is correct
49 Correct 1947 ms 31732 KB Output is correct
50 Correct 1894 ms 31740 KB Output is correct

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 5 ms 468 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 4 ms 500 KB Output is correct
12 Correct 4 ms 468 KB Output is correct
13 Correct 7 ms 468 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 7 ms 468 KB Output is correct
17 Correct 8 ms 468 KB Output is correct
18 Correct 7 ms 468 KB Output is correct
19 Correct 7 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 512 KB Output is correct
23 Correct 4 ms 520 KB Output is correct
24 Correct 3 ms 468 KB Output is correct
25 Correct 4 ms 468 KB Output is correct
26 Correct 9 ms 468 KB Output is correct
27 Correct 5 ms 524 KB Output is correct
28 Correct 4 ms 472 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 186 ms 480 KB Output is correct
36 Correct 179 ms 480 KB Output is correct
37 Correct 192 ms 500 KB Output is correct
38 Correct 202 ms 476 KB Output is correct
39 Correct 182 ms 476 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 146 ms 460 KB Output is correct
44 Correct 140 ms 476 KB Output is correct
45 Correct 173 ms 468 KB Output is correct
46 Correct 155 ms 468 KB Output is correct
47 Correct 148 ms 480 KB Output is correct
48 Correct 147 ms 468 KB Output is correct
49 Correct 1546 ms 31732 KB Output is correct
50 Correct 1538 ms 31788 KB Output is correct
51 Correct 1792 ms 31700 KB Output is correct
52 Correct 1597 ms 31732 KB Output is correct
53 Correct 1542 ms 31748 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 208 ms 31728 KB Output is correct
57 Correct 207 ms 31816 KB Output is correct
58 Correct 217 ms 31832 KB Output is correct
59 Correct 975 ms 31776 KB Output is correct
60 Correct 935 ms 31864 KB Output is correct
61 Correct 899 ms 31704 KB Output is correct
62 Correct 1272 ms 31732 KB Output is correct
63 Correct 1947 ms 31732 KB Output is correct
64 Correct 1894 ms 31740 KB Output is correct
65 Execution timed out 5053 ms 23816 KB Time limit exceeded
66 Halted 0 ms 0 KB -

Subtask #7
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 5 ms 468 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 4 ms 500 KB Output is correct
12 Correct 4 ms 468 KB Output is correct
13 Correct 7 ms 468 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 7 ms 468 KB Output is correct
17 Correct 8 ms 468 KB Output is correct
18 Correct 7 ms 468 KB Output is correct
19 Correct 7 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 512 KB Output is correct
23 Correct 4 ms 520 KB Output is correct
24 Correct 3 ms 468 KB Output is correct
25 Correct 4 ms 468 KB Output is correct
26 Correct 9 ms 468 KB Output is correct
27 Correct 5 ms 524 KB Output is correct
28 Correct 4 ms 472 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 186 ms 480 KB Output is correct
36 Correct 179 ms 480 KB Output is correct
37 Correct 192 ms 500 KB Output is correct
38 Correct 202 ms 476 KB Output is correct
39 Correct 182 ms 476 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 146 ms 460 KB Output is correct
44 Correct 140 ms 476 KB Output is correct
45 Correct 173 ms 468 KB Output is correct
46 Correct 155 ms 468 KB Output is correct
47 Correct 148 ms 480 KB Output is correct
48 Correct 147 ms 468 KB Output is correct
49 Correct 186 ms 500 KB Output is correct
50 Correct 203 ms 484 KB Output is correct
51 Correct 204 ms 480 KB Output is correct
52 Correct 183 ms 508 KB Output is correct
53 Correct 186 ms 468 KB Output is correct
54 Correct 1 ms 468 KB Output is correct
55 Correct 1 ms 468 KB Output is correct
56 Correct 1 ms 480 KB Output is correct
57 Correct 141 ms 468 KB Output is correct
58 Correct 156 ms 480 KB Output is correct
59 Correct 161 ms 476 KB Output is correct
60 Correct 168 ms 488 KB Output is correct
61 Correct 166 ms 496 KB Output is correct
62 Correct 150 ms 508 KB Output is correct
63 Correct 1546 ms 31732 KB Output is correct
64 Correct 1538 ms 31788 KB Output is correct
65 Correct 1792 ms 31700 KB Output is correct
66 Correct 1597 ms 31732 KB Output is correct
67 Correct 1542 ms 31748 KB Output is correct
68 Correct 1 ms 340 KB Output is correct
69 Correct 1 ms 340 KB Output is correct
70 Correct 208 ms 31728 KB Output is correct
71 Correct 207 ms 31816 KB Output is correct
72 Correct 217 ms 31832 KB Output is correct
73 Correct 975 ms 31776 KB Output is correct
74 Correct 935 ms 31864 KB Output is correct
75 Correct 899 ms 31704 KB Output is correct
76 Correct 1272 ms 31732 KB Output is correct
77 Correct 1947 ms 31732 KB Output is correct
78 Correct 1894 ms 31740 KB Output is correct
79 Execution timed out 5053 ms 23816 KB Time limit exceeded
80 Halted 0 ms 0 KB -