oj.uz

Submission #68841

# Submission time Handle Problem Language Result Execution time Memory
68841 2018-08-18T18:14:17 Z duality Bulldozer (JOI17_bulldozer) C++11
60 / 100
 1147 ms 33656 KB 
#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;

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) {
    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;
    int sub1 = 1;
    scanf("%d",&N);
    for (i = 0; i < N; i++) scanf("%d %d %d",&p[i].x,&p[i].y,&p[i].w),sub1 &= (p[i].y == 0);
    sort(p,p+N,comp);

    int j;
    if (sub1) {
        LLI m = 0,ans = 0;
        for (j = 0; j < N; j++) {
            m += p[j].w;
            if (m < 0) m = 0;
            ans = max(ans,m);
        }
        printf("%lld\n",ans);
        return 0;
    }

    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;
            events.pb((event){i,j,atan2(dy,dx)});
        }
        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++) {
        ans = max(ans,vec[0]);
        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]]);
    }
    printf("%lld\n",ans);

    return 0;
}

Compilation message

bulldozer.cpp: In function 'int main()':
bulldozer.cpp:71:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < events.size(); i++) {
                 ~~^~~~~~~~~~~~~~~
bulldozer.cpp:44:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&N);
     ~~~~~^~~~~~~~~
bulldozer.cpp:45:70: 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),sub1 &= (p[i].y == 0);
                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 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 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 640 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 4 ms 560 KB Output is correct
5 Correct 4 ms 640 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 4 ms 640 KB Output is correct
8 Correct 3 ms 512 KB Output is correct
9 Correct 4 ms 640 KB Output is correct
10 Correct 4 ms 612 KB Output is correct
11 Correct 16 ms 384 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 3 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 512 KB Output is correct
22 Correct 5 ms 640 KB Output is correct
23 Correct 4 ms 572 KB Output is correct
24 Correct 5 ms 512 KB Output is correct
25 Correct 3 ms 512 KB Output is correct
26 Correct 4 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 640 KB Output is correct
30 Correct 4 ms 612 KB Output is correct
31 Correct 4 ms 512 KB Output is correct
32 Correct 4 ms 512 KB Output is correct

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 640 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 4 ms 560 KB Output is correct
5 Correct 4 ms 640 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 4 ms 640 KB Output is correct
8 Correct 3 ms 512 KB Output is correct
9 Correct 4 ms 640 KB Output is correct
10 Correct 4 ms 612 KB Output is correct
11 Correct 16 ms 384 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 3 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 512 KB Output is correct
22 Correct 5 ms 640 KB Output is correct
23 Correct 4 ms 572 KB Output is correct
24 Correct 5 ms 512 KB Output is correct
25 Correct 3 ms 512 KB Output is correct
26 Correct 4 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 640 KB Output is correct
30 Correct 4 ms 612 KB Output is correct
31 Correct 4 ms 512 KB Output is correct
32 Correct 4 ms 512 KB Output is correct
33 Correct 1065 ms 33400 KB Output is correct
34 Correct 1054 ms 33476 KB Output is correct
35 Correct 1072 ms 33496 KB Output is correct
36 Correct 1079 ms 33468 KB Output is correct
37 Correct 1059 ms 33468 KB Output is correct
38 Correct 1048 ms 33472 KB Output is correct
39 Correct 1070 ms 33468 KB Output is correct
40 Correct 1046 ms 33472 KB Output is correct
41 Correct 1089 ms 33656 KB Output is correct
42 Correct 1123 ms 33468 KB Output is correct
43 Correct 1071 ms 33528 KB Output is correct
44 Correct 1033 ms 33468 KB Output is correct
45 Correct 1042 ms 33468 KB Output is correct
46 Correct 1046 ms 33496 KB Output is correct
47 Correct 1083 ms 33552 KB Output is correct
48 Correct 1091 ms 33468 KB Output is correct
49 Correct 1057 ms 33468 KB Output is correct
50 Correct 1069 ms 33468 KB Output is correct
51 Correct 1077 ms 33468 KB Output is correct
52 Correct 1086 ms 33456 KB Output is correct
53 Correct 1147 ms 33468 KB Output is correct
54 Correct 1068 ms 33468 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 640 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 4 ms 560 KB Output is correct
5 Correct 4 ms 640 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 4 ms 640 KB Output is correct
8 Correct 3 ms 512 KB Output is correct
9 Correct 4 ms 640 KB Output is correct
10 Correct 4 ms 612 KB Output is correct
11 Correct 16 ms 384 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 3 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 512 KB Output is correct
22 Correct 5 ms 640 KB Output is correct
23 Correct 4 ms 572 KB Output is correct
24 Correct 5 ms 512 KB Output is correct
25 Correct 3 ms 512 KB Output is correct
26 Correct 4 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 640 KB Output is correct
30 Correct 4 ms 612 KB Output is correct
31 Correct 4 ms 512 KB Output is correct
32 Correct 4 ms 512 KB Output is correct
33 Correct 1065 ms 33400 KB Output is correct
34 Correct 1054 ms 33476 KB Output is correct
35 Correct 1072 ms 33496 KB Output is correct
36 Correct 1079 ms 33468 KB Output is correct
37 Correct 1059 ms 33468 KB Output is correct
38 Correct 1048 ms 33472 KB Output is correct
39 Correct 1070 ms 33468 KB Output is correct
40 Correct 1046 ms 33472 KB Output is correct
41 Correct 1089 ms 33656 KB Output is correct
42 Correct 1123 ms 33468 KB Output is correct
43 Correct 1071 ms 33528 KB Output is correct
44 Correct 1033 ms 33468 KB Output is correct
45 Correct 1042 ms 33468 KB Output is correct
46 Correct 1046 ms 33496 KB Output is correct
47 Correct 1083 ms 33552 KB Output is correct
48 Correct 1091 ms 33468 KB Output is correct
49 Correct 1057 ms 33468 KB Output is correct
50 Correct 1069 ms 33468 KB Output is correct
51 Correct 1077 ms 33468 KB Output is correct
52 Correct 1086 ms 33456 KB Output is correct
53 Correct 1147 ms 33468 KB Output is correct
54 Correct 1068 ms 33468 KB Output is correct
55 Correct 1077 ms 33440 KB Output is correct
56 Correct 1061 ms 33432 KB Output is correct
57 Correct 1103 ms 33468 KB Output is correct
58 Correct 1080 ms 33468 KB Output is correct
59 Correct 1085 ms 33468 KB Output is correct
60 Correct 1075 ms 33468 KB Output is correct
61 Correct 1088 ms 33484 KB Output is correct
62 Correct 1066 ms 33472 KB Output is correct
63 Correct 1064 ms 33468 KB Output is correct
64 Correct 1074 ms 33468 KB Output is correct
65 Incorrect 1091 ms 33440 KB Output isn't correct
66 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 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 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 4 ms 640 KB Output is correct
17 Correct 4 ms 512 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 4 ms 560 KB Output is correct
20 Correct 4 ms 640 KB Output is correct
21 Correct 4 ms 512 KB Output is correct
22 Correct 4 ms 640 KB Output is correct
23 Correct 3 ms 512 KB Output is correct
24 Correct 4 ms 640 KB Output is correct
25 Correct 4 ms 612 KB Output is correct
26 Correct 16 ms 384 KB Output is correct
27 Correct 2 ms 256 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 3 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 512 KB Output is correct
37 Correct 5 ms 640 KB Output is correct
38 Correct 4 ms 572 KB Output is correct
39 Correct 5 ms 512 KB Output is correct
40 Correct 3 ms 512 KB Output is correct
41 Correct 4 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 640 KB Output is correct
45 Correct 4 ms 612 KB Output is correct
46 Correct 4 ms 512 KB Output is correct
47 Correct 4 ms 512 KB Output is correct
48 Correct 1065 ms 33400 KB Output is correct
49 Correct 1054 ms 33476 KB Output is correct
50 Correct 1072 ms 33496 KB Output is correct
51 Correct 1079 ms 33468 KB Output is correct
52 Correct 1059 ms 33468 KB Output is correct
53 Correct 1048 ms 33472 KB Output is correct
54 Correct 1070 ms 33468 KB Output is correct
55 Correct 1046 ms 33472 KB Output is correct
56 Correct 1089 ms 33656 KB Output is correct
57 Correct 1123 ms 33468 KB Output is correct
58 Correct 1071 ms 33528 KB Output is correct
59 Correct 1033 ms 33468 KB Output is correct
60 Correct 1042 ms 33468 KB Output is correct
61 Correct 1046 ms 33496 KB Output is correct
62 Correct 1083 ms 33552 KB Output is correct
63 Correct 1091 ms 33468 KB Output is correct
64 Correct 1057 ms 33468 KB Output is correct
65 Correct 1069 ms 33468 KB Output is correct
66 Correct 1077 ms 33468 KB Output is correct
67 Correct 1086 ms 33456 KB Output is correct
68 Correct 1147 ms 33468 KB Output is correct
69 Correct 1068 ms 33468 KB Output is correct
70 Correct 1077 ms 33440 KB Output is correct
71 Correct 1061 ms 33432 KB Output is correct
72 Correct 1103 ms 33468 KB Output is correct
73 Correct 1080 ms 33468 KB Output is correct
74 Correct 1085 ms 33468 KB Output is correct
75 Correct 1075 ms 33468 KB Output is correct
76 Correct 1088 ms 33484 KB Output is correct
77 Correct 1066 ms 33472 KB Output is correct
78 Correct 1064 ms 33468 KB Output is correct
79 Correct 1074 ms 33468 KB Output is correct
80 Incorrect 1091 ms 33440 KB Output isn't correct
81 Halted 0 ms 0 KB -