oj.uz

Submission #96061

# Submission time Handle Problem Language Result Execution time Memory
96061 2019-02-05T14:46:53 Z HIR180 Bulldozer (JOI17_bulldozer) C++17
100 / 100
 1771 ms 133812 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<P,int> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
int n,cur;
int x[4005],y[4005],w[4005];
vector<pair<P,vector<int> > >vi;
P1 za[4005];
bool cmp(const int&p,const int&q){
	//cur-p-q
	P a = za[cur].fi,b = za[p].fi,c = za[q].fi;
	ll val = 1LL*(b.fi-a.fi)*(c.sc-a.sc)-1LL*(b.sc-a.sc)*(c.fi-a.fi);
	if(val) return val > 0LL;
	else return 1LL*(b.fi-a.fi)*(b.fi-a.fi)+1LL*(b.sc-a.sc)*(b.sc-a.sc) < 1LL*(c.fi-a.fi)*(c.fi-a.fi)+1LL*(c.sc-a.sc)*(c.sc-a.sc);
}
bool eq(P a,P b,P c){
	return 1LL*(b.fi-a.fi)*(c.sc-a.sc)-1LL*(b.sc-a.sc)*(c.fi-a.fi) == 0;
}
bool cmp2(const pair<P,vector<int> >&p,const pair<P,vector<int> >&q){
	P a = mp(0,0),b = p.fi,c = q.fi;
	ll val = 1LL*(b.fi-a.fi)*(c.sc-a.sc)-1LL*(b.sc-a.sc)*(c.fi-a.fi);
	return val > 0ll;
}
bool cmp3(const P1 &a,const P1&b){
	if(a.fi.sc != b.fi.sc){
		return a.fi.sc < b.fi.sc;
	}
	else{
		return a.fi.fi > b.fi.fi;
	}
}
int rev[4005],now[4005]; //rev[i] .. where is node i on segtree

struct segtree{
	ll seg[(1<<13)],L[(1<<13)],R[(1<<13)],sum[(1<<13)];
	void update(int k,int val){
		k += (1<<12)-1;
		seg[k] = max(0ll,1LL*val);
		L[k] = max(0ll,1LL*val);
		R[k] = max(0ll,1LL*val);
		sum[k] = 1LL*val;
		
		while(k>0){
			k = (k-1)/2;
			sum[k] = sum[k*2+1]+sum[k*2+2];
			L[k] = max(L[k*2+1],sum[k*2+1]+L[k*2+2]);
			R[k] = max(R[k*2+2],sum[k*2+2]+R[k*2+1]);
			seg[k] = max(max(seg[k*2+1],seg[k*2+2]),R[k*2+1]+L[k*2+2]);
		}
	}
	ll query(){ return seg[0]; }
	int get(int k){ return sum[k+(1<<12)-1]; }
}seg;
bool used[4005][4005];
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d%d%d",&x[i],&y[i],&w[i]);
		za[i] = mp(mp(x[i],y[i]),i);
	}
	sort(za+1,za+n+1,cmp3);
	for(int i=1;i<=n;i++){
		vector<int>vec;
		for(int j=i+1;j<=n;j++){
			int X = za[j].fi.fi-za[i].fi.fi,Y = za[j].fi.sc-za[i].fi.sc;
			{
				vec.push_back(j);
			}
		}
		cur = i;
		sort(vec.begin(),vec.end(),cmp);
		vector<int>L; L.clear(); L.pb(za[i].sc);
		for(int j=0;j<vec.size();j++){
			L.pb(za[vec[j]].sc);
			if(j+1 != vec.size() && eq(za[i].fi,za[vec[j]].fi,za[vec[j+1]].fi)){
				continue;
			}
			if(used[L[0]][L[1]]) {L.clear(); L.pb(za[i].sc); continue;}
			P p = mp(za[vec[j]].fi.fi-za[i].fi.fi,za[vec[j]].fi.sc-za[i].fi.sc);
			vi.pb(mp(p,L));
			for(int k=0;k<L.size();k++) for(int l=k+1;l<L.size();l++) used[L[k]][L[l]] = used[L[l]][L[k]] = 1;
			L.clear(); L.pb(za[i].sc);
		}
	}
	sort(vi.begin(),vi.end(),cmp2);
	//0+eps kara start
//	sort(za+1,za+n+1,cmp3);
	for(int i=1;i<=n;i++){
		seg.update(i,1LL*w[za[i].sc]);
		rev[za[i].sc] = i; now[i] = za[i].sc;
	}
	ll ans = seg.query();
	for(int i=0;i<vi.size();i++){
		vector<int>&hoge = vi[i].sc;
		int e = -1;
		for(int j=0;j<hoge.size();j++){
			int hs = hoge.size(); int f = rev[hoge[hs-1-j]];
			assert(e==-1 || abs(e-f) == 1); e = f;
			seg.update(rev[hoge[j]],w[now[f]]);
		}
		for(int j=0;;j++){
			int hs = hoge.size();
			int f = rev[hoge[j]],g = rev[hoge[hs-1-j]];
			if(0 >= hs-1-j*2) break;
			swap(now[f],now[g]);
			swap(rev[hoge[j]],rev[hoge[hs-1-j]]);
		}
		if(i+1 != vi.size() && eq(mp(0,0),vi[i].fi,vi[i+1].fi)) continue;
		ans = max(ans,seg.query());
	}
	printf("%lld\n",ans);
}

Compilation message

bulldozer.cpp: In function 'int main()':
bulldozer.cpp:79:8: warning: unused variable 'X' [-Wunused-variable]
    int X = za[j].fi.fi-za[i].fi.fi,Y = za[j].fi.sc-za[i].fi.sc;
        ^
bulldozer.cpp:79:36: warning: unused variable 'Y' [-Wunused-variable]
    int X = za[j].fi.fi-za[i].fi.fi,Y = za[j].fi.sc-za[i].fi.sc;
                                    ^
bulldozer.cpp:87:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j=0;j<vec.size();j++){
               ~^~~~~~~~~~~
bulldozer.cpp:89:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if(j+1 != vec.size() && eq(za[i].fi,za[vec[j]].fi,za[vec[j+1]].fi)){
       ~~~~^~~~~~~~~~~~~
bulldozer.cpp:95:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int k=0;k<L.size();k++) for(int l=k+1;l<L.size();l++) used[L[k]][L[l]] = used[L[l]][L[k]] = 1;
                ~^~~~~~~~~
bulldozer.cpp:95:47: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int k=0;k<L.size();k++) for(int l=k+1;l<L.size();l++) used[L[k]][L[l]] = used[L[l]][L[k]] = 1;
                                              ~^~~~~~~~~
bulldozer.cpp:107:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<vi.size();i++){
              ~^~~~~~~~~~
bulldozer.cpp:110:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j=0;j<hoge.size();j++){
               ~^~~~~~~~~~~~
bulldozer.cpp:122:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(i+1 != vi.size() && eq(mp(0,0),vi[i].fi,vi[i+1].fi)) continue;
      ~~~~^~~~~~~~~~~~
bulldozer.cpp:70:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
bulldozer.cpp:72:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d",&x[i],&y[i],&w[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 896 KB Output is correct
2 Correct 3 ms 768 KB Output is correct
3 Correct 2 ms 896 KB Output is correct
4 Correct 2 ms 768 KB Output is correct
5 Correct 2 ms 896 KB Output is correct
6 Correct 3 ms 896 KB Output is correct
7 Correct 3 ms 768 KB Output is correct
8 Correct 2 ms 768 KB Output is correct
9 Correct 3 ms 868 KB Output is correct
10 Correct 3 ms 768 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 512 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1152 KB Output is correct
2 Correct 5 ms 1152 KB Output is correct
3 Correct 5 ms 1152 KB Output is correct
4 Correct 5 ms 1152 KB Output is correct
5 Correct 4 ms 1152 KB Output is correct
6 Correct 4 ms 1152 KB Output is correct
7 Correct 5 ms 1152 KB Output is correct
8 Correct 5 ms 1152 KB Output is correct
9 Correct 5 ms 1152 KB Output is correct
10 Correct 5 ms 1152 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 5 ms 1276 KB Output is correct
22 Correct 5 ms 1152 KB Output is correct
23 Correct 5 ms 1152 KB Output is correct
24 Correct 4 ms 1152 KB Output is correct
25 Correct 5 ms 1152 KB Output is correct
26 Correct 4 ms 1152 KB Output is correct
27 Correct 5 ms 1152 KB Output is correct
28 Correct 5 ms 1152 KB Output is correct
29 Correct 5 ms 1152 KB Output is correct
30 Correct 6 ms 1152 KB Output is correct
31 Correct 5 ms 1152 KB Output is correct
32 Correct 5 ms 1152 KB Output is correct

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1152 KB Output is correct
2 Correct 5 ms 1152 KB Output is correct
3 Correct 5 ms 1152 KB Output is correct
4 Correct 5 ms 1152 KB Output is correct
5 Correct 4 ms 1152 KB Output is correct
6 Correct 4 ms 1152 KB Output is correct
7 Correct 5 ms 1152 KB Output is correct
8 Correct 5 ms 1152 KB Output is correct
9 Correct 5 ms 1152 KB Output is correct
10 Correct 5 ms 1152 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 5 ms 1276 KB Output is correct
22 Correct 5 ms 1152 KB Output is correct
23 Correct 5 ms 1152 KB Output is correct
24 Correct 4 ms 1152 KB Output is correct
25 Correct 5 ms 1152 KB Output is correct
26 Correct 4 ms 1152 KB Output is correct
27 Correct 5 ms 1152 KB Output is correct
28 Correct 5 ms 1152 KB Output is correct
29 Correct 5 ms 1152 KB Output is correct
30 Correct 6 ms 1152 KB Output is correct
31 Correct 5 ms 1152 KB Output is correct
32 Correct 5 ms 1152 KB Output is correct
33 Correct 1639 ms 133704 KB Output is correct
34 Correct 1648 ms 133696 KB Output is correct
35 Correct 1691 ms 133700 KB Output is correct
36 Correct 1660 ms 133692 KB Output is correct
37 Correct 1711 ms 133736 KB Output is correct
38 Correct 1673 ms 133612 KB Output is correct
39 Correct 1635 ms 133616 KB Output is correct
40 Correct 1677 ms 133804 KB Output is correct
41 Correct 1630 ms 133708 KB Output is correct
42 Correct 1712 ms 133744 KB Output is correct
43 Correct 1642 ms 133736 KB Output is correct
44 Correct 1583 ms 133696 KB Output is correct
45 Correct 1561 ms 133704 KB Output is correct
46 Correct 1593 ms 133684 KB Output is correct
47 Correct 1626 ms 133732 KB Output is correct
48 Correct 1604 ms 133696 KB Output is correct
49 Correct 1610 ms 133704 KB Output is correct
50 Correct 1584 ms 133688 KB Output is correct
51 Correct 1594 ms 133748 KB Output is correct
52 Correct 1548 ms 133704 KB Output is correct
53 Correct 1554 ms 133684 KB Output is correct
54 Correct 1573 ms 133612 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1152 KB Output is correct
2 Correct 5 ms 1152 KB Output is correct
3 Correct 5 ms 1152 KB Output is correct
4 Correct 5 ms 1152 KB Output is correct
5 Correct 4 ms 1152 KB Output is correct
6 Correct 4 ms 1152 KB Output is correct
7 Correct 5 ms 1152 KB Output is correct
8 Correct 5 ms 1152 KB Output is correct
9 Correct 5 ms 1152 KB Output is correct
10 Correct 5 ms 1152 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 5 ms 1276 KB Output is correct
22 Correct 5 ms 1152 KB Output is correct
23 Correct 5 ms 1152 KB Output is correct
24 Correct 4 ms 1152 KB Output is correct
25 Correct 5 ms 1152 KB Output is correct
26 Correct 4 ms 1152 KB Output is correct
27 Correct 5 ms 1152 KB Output is correct
28 Correct 5 ms 1152 KB Output is correct
29 Correct 5 ms 1152 KB Output is correct
30 Correct 6 ms 1152 KB Output is correct
31 Correct 5 ms 1152 KB Output is correct
32 Correct 5 ms 1152 KB Output is correct
33 Correct 1639 ms 133704 KB Output is correct
34 Correct 1648 ms 133696 KB Output is correct
35 Correct 1691 ms 133700 KB Output is correct
36 Correct 1660 ms 133692 KB Output is correct
37 Correct 1711 ms 133736 KB Output is correct
38 Correct 1673 ms 133612 KB Output is correct
39 Correct 1635 ms 133616 KB Output is correct
40 Correct 1677 ms 133804 KB Output is correct
41 Correct 1630 ms 133708 KB Output is correct
42 Correct 1712 ms 133744 KB Output is correct
43 Correct 1642 ms 133736 KB Output is correct
44 Correct 1583 ms 133696 KB Output is correct
45 Correct 1561 ms 133704 KB Output is correct
46 Correct 1593 ms 133684 KB Output is correct
47 Correct 1626 ms 133732 KB Output is correct
48 Correct 1604 ms 133696 KB Output is correct
49 Correct 1610 ms 133704 KB Output is correct
50 Correct 1584 ms 133688 KB Output is correct
51 Correct 1594 ms 133748 KB Output is correct
52 Correct 1548 ms 133704 KB Output is correct
53 Correct 1554 ms 133684 KB Output is correct
54 Correct 1573 ms 133612 KB Output is correct
55 Correct 1666 ms 133688 KB Output is correct
56 Correct 1669 ms 133708 KB Output is correct
57 Correct 1739 ms 133712 KB Output is correct
58 Correct 1699 ms 133728 KB Output is correct
59 Correct 1771 ms 133620 KB Output is correct
60 Correct 1625 ms 133740 KB Output is correct
61 Correct 1623 ms 133704 KB Output is correct
62 Correct 1592 ms 133776 KB Output is correct
63 Correct 1603 ms 133764 KB Output is correct
64 Correct 1647 ms 133700 KB Output is correct
65 Correct 1533 ms 133604 KB Output is correct
66 Correct 1578 ms 133692 KB Output is correct
67 Correct 1565 ms 133692 KB Output is correct
68 Correct 1582 ms 133684 KB Output is correct
69 Correct 1593 ms 133688 KB Output is correct
70 Correct 1564 ms 133728 KB Output is correct
71 Correct 1553 ms 133696 KB Output is correct
72 Correct 1596 ms 133700 KB Output is correct
73 Correct 1562 ms 133688 KB Output is correct
74 Correct 1644 ms 133716 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 896 KB Output is correct
2 Correct 3 ms 768 KB Output is correct
3 Correct 2 ms 896 KB Output is correct
4 Correct 2 ms 768 KB Output is correct
5 Correct 2 ms 896 KB Output is correct
6 Correct 3 ms 896 KB Output is correct
7 Correct 3 ms 768 KB Output is correct
8 Correct 2 ms 768 KB Output is correct
9 Correct 3 ms 868 KB Output is correct
10 Correct 3 ms 768 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 5 ms 1152 KB Output is correct
17 Correct 5 ms 1152 KB Output is correct
18 Correct 5 ms 1152 KB Output is correct
19 Correct 5 ms 1152 KB Output is correct
20 Correct 4 ms 1152 KB Output is correct
21 Correct 4 ms 1152 KB Output is correct
22 Correct 5 ms 1152 KB Output is correct
23 Correct 5 ms 1152 KB Output is correct
24 Correct 5 ms 1152 KB Output is correct
25 Correct 5 ms 1152 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 2 ms 512 KB Output is correct
29 Correct 4 ms 384 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 2 ms 384 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 5 ms 1276 KB Output is correct
37 Correct 5 ms 1152 KB Output is correct
38 Correct 5 ms 1152 KB Output is correct
39 Correct 4 ms 1152 KB Output is correct
40 Correct 5 ms 1152 KB Output is correct
41 Correct 4 ms 1152 KB Output is correct
42 Correct 5 ms 1152 KB Output is correct
43 Correct 5 ms 1152 KB Output is correct
44 Correct 5 ms 1152 KB Output is correct
45 Correct 6 ms 1152 KB Output is correct
46 Correct 5 ms 1152 KB Output is correct
47 Correct 5 ms 1152 KB Output is correct
48 Correct 1639 ms 133704 KB Output is correct
49 Correct 1648 ms 133696 KB Output is correct
50 Correct 1691 ms 133700 KB Output is correct
51 Correct 1660 ms 133692 KB Output is correct
52 Correct 1711 ms 133736 KB Output is correct
53 Correct 1673 ms 133612 KB Output is correct
54 Correct 1635 ms 133616 KB Output is correct
55 Correct 1677 ms 133804 KB Output is correct
56 Correct 1630 ms 133708 KB Output is correct
57 Correct 1712 ms 133744 KB Output is correct
58 Correct 1642 ms 133736 KB Output is correct
59 Correct 1583 ms 133696 KB Output is correct
60 Correct 1561 ms 133704 KB Output is correct
61 Correct 1593 ms 133684 KB Output is correct
62 Correct 1626 ms 133732 KB Output is correct
63 Correct 1604 ms 133696 KB Output is correct
64 Correct 1610 ms 133704 KB Output is correct
65 Correct 1584 ms 133688 KB Output is correct
66 Correct 1594 ms 133748 KB Output is correct
67 Correct 1548 ms 133704 KB Output is correct
68 Correct 1554 ms 133684 KB Output is correct
69 Correct 1573 ms 133612 KB Output is correct
70 Correct 1666 ms 133688 KB Output is correct
71 Correct 1669 ms 133708 KB Output is correct
72 Correct 1739 ms 133712 KB Output is correct
73 Correct 1699 ms 133728 KB Output is correct
74 Correct 1771 ms 133620 KB Output is correct
75 Correct 1625 ms 133740 KB Output is correct
76 Correct 1623 ms 133704 KB Output is correct
77 Correct 1592 ms 133776 KB Output is correct
78 Correct 1603 ms 133764 KB Output is correct
79 Correct 1647 ms 133700 KB Output is correct
80 Correct 1533 ms 133604 KB Output is correct
81 Correct 1578 ms 133692 KB Output is correct
82 Correct 1565 ms 133692 KB Output is correct
83 Correct 1582 ms 133684 KB Output is correct
84 Correct 1593 ms 133688 KB Output is correct
85 Correct 1564 ms 133728 KB Output is correct
86 Correct 1553 ms 133696 KB Output is correct
87 Correct 1596 ms 133700 KB Output is correct
88 Correct 1562 ms 133688 KB Output is correct
89 Correct 1644 ms 133716 KB Output is correct
90 Correct 1656 ms 133692 KB Output is correct
91 Correct 1608 ms 133708 KB Output is correct
92 Correct 1619 ms 133688 KB Output is correct
93 Correct 1668 ms 133756 KB Output is correct
94 Correct 1739 ms 133696 KB Output is correct
95 Correct 1651 ms 133704 KB Output is correct
96 Correct 1694 ms 133692 KB Output is correct
97 Correct 1724 ms 133720 KB Output is correct
98 Correct 1630 ms 133696 KB Output is correct
99 Correct 1628 ms 133704 KB Output is correct
100 Correct 1010 ms 71180 KB Output is correct
101 Correct 956 ms 71220 KB Output is correct
102 Correct 930 ms 71192 KB Output is correct
103 Correct 934 ms 71208 KB Output is correct
104 Correct 930 ms 71092 KB Output is correct
105 Correct 1190 ms 106796 KB Output is correct
106 Correct 1186 ms 106708 KB Output is correct
107 Correct 1204 ms 106720 KB Output is correct
108 Correct 1404 ms 106844 KB Output is correct
109 Correct 1255 ms 106716 KB Output is correct
110 Correct 1116 ms 106932 KB Output is correct
111 Correct 1121 ms 106824 KB Output is correct
112 Correct 1099 ms 106936 KB Output is correct
113 Correct 1176 ms 106820 KB Output is correct
114 Correct 1076 ms 106828 KB Output is correct
115 Correct 1069 ms 106908 KB Output is correct
116 Correct 1128 ms 106900 KB Output is correct
117 Correct 1078 ms 106908 KB Output is correct
118 Correct 1082 ms 107020 KB Output is correct
119 Correct 1085 ms 106956 KB Output is correct
120 Correct 2 ms 384 KB Output is correct
121 Correct 2 ms 384 KB Output is correct
122 Correct 1521 ms 133548 KB Output is correct
123 Correct 1619 ms 133540 KB Output is correct
124 Correct 1545 ms 133564 KB Output is correct
125 Correct 1523 ms 133716 KB Output is correct
126 Correct 1604 ms 133660 KB Output is correct
127 Correct 1604 ms 133632 KB Output is correct
128 Correct 1538 ms 133636 KB Output is correct
129 Correct 1555 ms 133628 KB Output is correct
130 Correct 1567 ms 133612 KB Output is correct
131 Correct 1606 ms 133692 KB Output is correct
132 Correct 1594 ms 133684 KB Output is correct
133 Correct 1526 ms 133812 KB Output is correct