답안 #68846 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
68846	2018-08-18T18:50:01 Z	duality	Bulldozer (JOI17_bulldozer)	C++11	80 / 100	1222 ms	33624 KB

bulldozer

#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
typedef long long int LLI;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
const double PI = acos(-1.0);

struct point { int x,y,w; };
bool comp(point a,point b) {
    if (a.y == b.y) return a.x > b.x;
    else return a.y < b.y;
}
point p[2000];
struct event { int i,j; double t; };
vector<event> events;
bool comp2(event a,event b) {
    if (abs(a.t-b.t) < 1e-15) {
        if (a.i == b.i) return a.j < b.j;
        else return a.i < b.i;
    }
    else return a.t < b.t;
}
int arr[2000],pos[2000];
LLI sum[1 << 12],pre[1 << 12],suff[1 << 12],vec[1 << 12];
int update(int s,int e,int ai,int i,int num) {
    if ((s > ai) || (e < ai)) return 0;
    else if (s == e) {
        sum[i] = num;
        pre[i] = suff[i] = vec[i] = max(num,0);
        return 0;
    }

    int mid = (s+e) / 2;
    update(s,mid,ai,2*i+1,num);
    update(mid+1,e,ai,2*i+2,num);
    sum[i] = sum[2*i+1] + sum[2*i+2];
    pre[i] = max(pre[2*i+1],sum[2*i+1]+pre[2*i+2]);
    suff[i] = max(suff[2*i+2],sum[2*i+2]+suff[2*i+1]);
    vec[i] = max(max(vec[2*i+1],vec[2*i+2]),suff[2*i+1]+pre[2*i+2]);
    return 0;
}
int main() {
    int i;
    int N;
    scanf("%d",&N);
    for (i = 0; i < N; i++) scanf("%d %d %d",&p[i].x,&p[i].y,&p[i].w);
    sort(p,p+N,comp);

    int j;
    for (i = 0; i < N; i++) {
        for (j = i+1; j < N; j++) {
            int dx = p[i].x-p[j].x;
            int dy = p[i].y-p[j].y;
            double t = atan2(dy,dx);
            if (t < 1e-15) t += 2*PI;
            events.pb((event){i,j,t});
        }
        arr[i] = p[i].w,pos[i] = i;
        update(0,N-1,i,0,p[i].w);
    }
    LLI ans = vec[0];
    sort(events.begin(),events.end(),comp2);
    for (i = 0; i < events.size(); i++) {
        //cout<<events[i].t<<endl;
        swap(arr[pos[events[i].i]],arr[pos[events[i].j]]);
        swap(pos[events[i].i],pos[events[i].j]);
        update(0,N-1,pos[events[i].i],0,arr[pos[events[i].i]]);
        update(0,N-1,pos[events[i].j],0,arr[pos[events[i].j]]);
        if ((i == events.size()-1) || (abs(events[i].t-events[i+1].t) > 1e-15)) ans = max(ans,vec[0]);
        //for(j=0;j<N;j++)cout<<arr[j]<<" ";
        //cout<<endl;
        //cout<<ans<<endl;
    }
    printf("%lld\n",ans);

    return 0;
}

Compilation message

bulldozer.cpp: In function 'int main()':
bulldozer.cpp:66:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < events.size(); i++) {
                 ~~^~~~~~~~~~~~~~~
bulldozer.cpp:72:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if ((i == events.size()-1) || (abs(events[i].t-events[i+1].t) > 1e-15)) ans = max(ans,vec[0]);
              ~~^~~~~~~~~~~~~~~~~~
bulldozer.cpp:48:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&N);
     ~~~~~^~~~~~~~~
bulldozer.cpp:49:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (i = 0; i < N; i++) scanf("%d %d %d",&p[i].x,&p[i].y,&p[i].w);
                             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	512 KB	Output is correct
2	Correct	3 ms	640 KB	Output is correct
3	Correct	3 ms	512 KB	Output is correct
4	Correct	3 ms	512 KB	Output is correct
5	Correct	3 ms	512 KB	Output is correct
6	Correct	3 ms	512 KB	Output is correct
7	Correct	3 ms	512 KB	Output is correct
8	Correct	3 ms	640 KB	Output is correct
9	Correct	3 ms	512 KB	Output is correct
10	Correct	3 ms	512 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	384 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	512 KB	Output is correct
2	Correct	4 ms	640 KB	Output is correct
3	Correct	4 ms	512 KB	Output is correct
4	Correct	4 ms	512 KB	Output is correct
5	Correct	4 ms	640 KB	Output is correct
6	Correct	4 ms	640 KB	Output is correct
7	Correct	4 ms	512 KB	Output is correct
8	Correct	4 ms	512 KB	Output is correct
9	Correct	4 ms	512 KB	Output is correct
10	Correct	4 ms	560 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	384 KB	Output is correct
14	Correct	2 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	4 ms	640 KB	Output is correct
22	Correct	4 ms	512 KB	Output is correct
23	Correct	4 ms	512 KB	Output is correct
24	Correct	4 ms	512 KB	Output is correct
25	Correct	4 ms	512 KB	Output is correct
26	Correct	3 ms	512 KB	Output is correct
27	Correct	4 ms	512 KB	Output is correct
28	Correct	4 ms	512 KB	Output is correct
29	Correct	4 ms	512 KB	Output is correct
30	Correct	4 ms	512 KB	Output is correct
31	Correct	4 ms	640 KB	Output is correct
32	Correct	4 ms	512 KB	Output is correct

Subtask #3
35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	512 KB	Output is correct
2	Correct	4 ms	640 KB	Output is correct
3	Correct	4 ms	512 KB	Output is correct
4	Correct	4 ms	512 KB	Output is correct
5	Correct	4 ms	640 KB	Output is correct
6	Correct	4 ms	640 KB	Output is correct
7	Correct	4 ms	512 KB	Output is correct
8	Correct	4 ms	512 KB	Output is correct
9	Correct	4 ms	512 KB	Output is correct
10	Correct	4 ms	560 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	384 KB	Output is correct
14	Correct	2 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	4 ms	640 KB	Output is correct
22	Correct	4 ms	512 KB	Output is correct
23	Correct	4 ms	512 KB	Output is correct
24	Correct	4 ms	512 KB	Output is correct
25	Correct	4 ms	512 KB	Output is correct
26	Correct	3 ms	512 KB	Output is correct
27	Correct	4 ms	512 KB	Output is correct
28	Correct	4 ms	512 KB	Output is correct
29	Correct	4 ms	512 KB	Output is correct
30	Correct	4 ms	512 KB	Output is correct
31	Correct	4 ms	640 KB	Output is correct
32	Correct	4 ms	512 KB	Output is correct
33	Correct	1147 ms	33468 KB	Output is correct
34	Correct	1108 ms	33468 KB	Output is correct
35	Correct	1142 ms	33400 KB	Output is correct
36	Correct	1112 ms	33468 KB	Output is correct
37	Correct	1106 ms	33468 KB	Output is correct
38	Correct	1116 ms	33468 KB	Output is correct
39	Correct	1120 ms	33468 KB	Output is correct
40	Correct	1102 ms	33468 KB	Output is correct
41	Correct	1133 ms	33468 KB	Output is correct
42	Correct	1169 ms	33468 KB	Output is correct
43	Correct	1112 ms	33472 KB	Output is correct
44	Correct	1101 ms	33468 KB	Output is correct
45	Correct	1082 ms	33624 KB	Output is correct
46	Correct	1106 ms	33592 KB	Output is correct
47	Correct	1107 ms	33468 KB	Output is correct
48	Correct	1099 ms	33468 KB	Output is correct
49	Correct	1103 ms	33468 KB	Output is correct
50	Correct	1081 ms	33472 KB	Output is correct
51	Correct	1094 ms	33468 KB	Output is correct
52	Correct	1085 ms	33500 KB	Output is correct
53	Correct	1090 ms	33468 KB	Output is correct
54	Correct	1157 ms	33468 KB	Output is correct

Subtask #4
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	512 KB	Output is correct
2	Correct	4 ms	640 KB	Output is correct
3	Correct	4 ms	512 KB	Output is correct
4	Correct	4 ms	512 KB	Output is correct
5	Correct	4 ms	640 KB	Output is correct
6	Correct	4 ms	640 KB	Output is correct
7	Correct	4 ms	512 KB	Output is correct
8	Correct	4 ms	512 KB	Output is correct
9	Correct	4 ms	512 KB	Output is correct
10	Correct	4 ms	560 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	384 KB	Output is correct
14	Correct	2 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	4 ms	640 KB	Output is correct
22	Correct	4 ms	512 KB	Output is correct
23	Correct	4 ms	512 KB	Output is correct
24	Correct	4 ms	512 KB	Output is correct
25	Correct	4 ms	512 KB	Output is correct
26	Correct	3 ms	512 KB	Output is correct
27	Correct	4 ms	512 KB	Output is correct
28	Correct	4 ms	512 KB	Output is correct
29	Correct	4 ms	512 KB	Output is correct
30	Correct	4 ms	512 KB	Output is correct
31	Correct	4 ms	640 KB	Output is correct
32	Correct	4 ms	512 KB	Output is correct
33	Correct	1147 ms	33468 KB	Output is correct
34	Correct	1108 ms	33468 KB	Output is correct
35	Correct	1142 ms	33400 KB	Output is correct
36	Correct	1112 ms	33468 KB	Output is correct
37	Correct	1106 ms	33468 KB	Output is correct
38	Correct	1116 ms	33468 KB	Output is correct
39	Correct	1120 ms	33468 KB	Output is correct
40	Correct	1102 ms	33468 KB	Output is correct
41	Correct	1133 ms	33468 KB	Output is correct
42	Correct	1169 ms	33468 KB	Output is correct
43	Correct	1112 ms	33472 KB	Output is correct
44	Correct	1101 ms	33468 KB	Output is correct
45	Correct	1082 ms	33624 KB	Output is correct
46	Correct	1106 ms	33592 KB	Output is correct
47	Correct	1107 ms	33468 KB	Output is correct
48	Correct	1099 ms	33468 KB	Output is correct
49	Correct	1103 ms	33468 KB	Output is correct
50	Correct	1081 ms	33472 KB	Output is correct
51	Correct	1094 ms	33468 KB	Output is correct
52	Correct	1085 ms	33500 KB	Output is correct
53	Correct	1090 ms	33468 KB	Output is correct
54	Correct	1157 ms	33468 KB	Output is correct
55	Correct	1115 ms	33468 KB	Output is correct
56	Correct	1103 ms	33468 KB	Output is correct
57	Correct	1096 ms	33556 KB	Output is correct
58	Correct	1101 ms	33468 KB	Output is correct
59	Correct	1102 ms	33492 KB	Output is correct
60	Correct	1096 ms	33468 KB	Output is correct
61	Correct	1123 ms	33468 KB	Output is correct
62	Correct	1102 ms	33468 KB	Output is correct
63	Correct	1087 ms	33468 KB	Output is correct
64	Correct	1099 ms	33432 KB	Output is correct
65	Correct	1099 ms	33468 KB	Output is correct
66	Correct	1135 ms	33468 KB	Output is correct
67	Correct	1202 ms	33468 KB	Output is correct
68	Correct	1121 ms	33468 KB	Output is correct
69	Correct	1222 ms	33468 KB	Output is correct
70	Correct	1100 ms	33468 KB	Output is correct
71	Correct	1092 ms	33420 KB	Output is correct
72	Correct	1126 ms	33368 KB	Output is correct
73	Correct	1145 ms	33528 KB	Output is correct
74	Correct	1145 ms	33496 KB	Output is correct

Subtask #5
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	512 KB	Output is correct
2	Correct	3 ms	640 KB	Output is correct
3	Correct	3 ms	512 KB	Output is correct
4	Correct	3 ms	512 KB	Output is correct
5	Correct	3 ms	512 KB	Output is correct
6	Correct	3 ms	512 KB	Output is correct
7	Correct	3 ms	512 KB	Output is correct
8	Correct	3 ms	640 KB	Output is correct
9	Correct	3 ms	512 KB	Output is correct
10	Correct	3 ms	512 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	384 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	4 ms	512 KB	Output is correct
17	Correct	4 ms	640 KB	Output is correct
18	Correct	4 ms	512 KB	Output is correct
19	Correct	4 ms	512 KB	Output is correct
20	Correct	4 ms	640 KB	Output is correct
21	Correct	4 ms	640 KB	Output is correct
22	Correct	4 ms	512 KB	Output is correct
23	Correct	4 ms	512 KB	Output is correct
24	Correct	4 ms	512 KB	Output is correct
25	Correct	4 ms	560 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	384 KB	Output is correct
29	Correct	2 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	4 ms	640 KB	Output is correct
37	Correct	4 ms	512 KB	Output is correct
38	Correct	4 ms	512 KB	Output is correct
39	Correct	4 ms	512 KB	Output is correct
40	Correct	4 ms	512 KB	Output is correct
41	Correct	3 ms	512 KB	Output is correct
42	Correct	4 ms	512 KB	Output is correct
43	Correct	4 ms	512 KB	Output is correct
44	Correct	4 ms	512 KB	Output is correct
45	Correct	4 ms	512 KB	Output is correct
46	Correct	4 ms	640 KB	Output is correct
47	Correct	4 ms	512 KB	Output is correct
48	Correct	1147 ms	33468 KB	Output is correct
49	Correct	1108 ms	33468 KB	Output is correct
50	Correct	1142 ms	33400 KB	Output is correct
51	Correct	1112 ms	33468 KB	Output is correct
52	Correct	1106 ms	33468 KB	Output is correct
53	Correct	1116 ms	33468 KB	Output is correct
54	Correct	1120 ms	33468 KB	Output is correct
55	Correct	1102 ms	33468 KB	Output is correct
56	Correct	1133 ms	33468 KB	Output is correct
57	Correct	1169 ms	33468 KB	Output is correct
58	Correct	1112 ms	33472 KB	Output is correct
59	Correct	1101 ms	33468 KB	Output is correct
60	Correct	1082 ms	33624 KB	Output is correct
61	Correct	1106 ms	33592 KB	Output is correct
62	Correct	1107 ms	33468 KB	Output is correct
63	Correct	1099 ms	33468 KB	Output is correct
64	Correct	1103 ms	33468 KB	Output is correct
65	Correct	1081 ms	33472 KB	Output is correct
66	Correct	1094 ms	33468 KB	Output is correct
67	Correct	1085 ms	33500 KB	Output is correct
68	Correct	1090 ms	33468 KB	Output is correct
69	Correct	1157 ms	33468 KB	Output is correct
70	Correct	1115 ms	33468 KB	Output is correct
71	Correct	1103 ms	33468 KB	Output is correct
72	Correct	1096 ms	33556 KB	Output is correct
73	Correct	1101 ms	33468 KB	Output is correct
74	Correct	1102 ms	33492 KB	Output is correct
75	Correct	1096 ms	33468 KB	Output is correct
76	Correct	1123 ms	33468 KB	Output is correct
77	Correct	1102 ms	33468 KB	Output is correct
78	Correct	1087 ms	33468 KB	Output is correct
79	Correct	1099 ms	33432 KB	Output is correct
80	Correct	1099 ms	33468 KB	Output is correct
81	Correct	1135 ms	33468 KB	Output is correct
82	Correct	1202 ms	33468 KB	Output is correct
83	Correct	1121 ms	33468 KB	Output is correct
84	Correct	1222 ms	33468 KB	Output is correct
85	Correct	1100 ms	33468 KB	Output is correct
86	Correct	1092 ms	33420 KB	Output is correct
87	Correct	1126 ms	33368 KB	Output is correct
88	Correct	1145 ms	33528 KB	Output is correct
89	Correct	1145 ms	33496 KB	Output is correct
90	Correct	1122 ms	33472 KB	Output is correct
91	Correct	1122 ms	33472 KB	Output is correct
92	Correct	1098 ms	33428 KB	Output is correct
93	Correct	1115 ms	33468 KB	Output is correct
94	Correct	1150 ms	33448 KB	Output is correct
95	Correct	1087 ms	33480 KB	Output is correct
96	Correct	1090 ms	33448 KB	Output is correct
97	Correct	1091 ms	33472 KB	Output is correct
98	Correct	1097 ms	33468 KB	Output is correct
99	Correct	1104 ms	33576 KB	Output is correct
100	Correct	990 ms	33468 KB	Output is correct
101	Correct	997 ms	33468 KB	Output is correct
102	Incorrect	1010 ms	33468 KB	Output isn't correct
103	Halted	0 ms	0 KB	-

답안 #68846

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 20.0 / 20.0

Subtask #3 35.0 / 35.0

Subtask #4 20.0 / 20.0

Subtask #5 0 / 20.0

Subtask #1
5.0 / 5.0

Subtask #2
20.0 / 20.0

Subtask #3
35.0 / 35.0

Subtask #4
20.0 / 20.0

Subtask #5
0 / 20.0