답안 #68843 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
68843	2018-08-18T18:39:58 Z	duality	Bulldozer (JOI17_bulldozer)	C++11	5 / 100	10 ms	768 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-9) {
        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 = 0; j < N; j++) {
            if (i == j) continue;
            int dx = p[i].x-p[j].x;
            int dy = p[i].y-p[j].y;
            double t = atan2(dy,dx);
            if (t < 1e-9) 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-9)) 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:67:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < events.size(); i++) {
                 ~~^~~~~~~~~~~~~~~
bulldozer.cpp:73: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-9)) 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	5 ms	768 KB	Output is correct
2	Correct	4 ms	768 KB	Output is correct
3	Correct	5 ms	768 KB	Output is correct
4	Correct	5 ms	768 KB	Output is correct
5	Correct	4 ms	768 KB	Output is correct
6	Correct	5 ms	768 KB	Output is correct
7	Correct	10 ms	768 KB	Output is correct
8	Correct	5 ms	768 KB	Output is correct
9	Correct	5 ms	768 KB	Output is correct
10	Correct	6 ms	768 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	3 ms	384 KB	Output is correct

Subtask #2
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	768 KB	Output is correct
2	Correct	5 ms	768 KB	Output is correct
3	Correct	6 ms	768 KB	Output is correct
4	Correct	6 ms	768 KB	Output is correct
5	Correct	6 ms	768 KB	Output is correct
6	Correct	6 ms	768 KB	Output is correct
7	Correct	5 ms	768 KB	Output is correct
8	Correct	6 ms	768 KB	Output is correct
9	Correct	5 ms	768 KB	Output is correct
10	Correct	6 ms	768 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	1 ms	384 KB	Output is correct
16	Correct	2 ms	300 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	356 KB	Output is correct
20	Correct	2 ms	384 KB	Output is correct
21	Incorrect	5 ms	768 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Subtask #3
0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	768 KB	Output is correct
2	Correct	5 ms	768 KB	Output is correct
3	Correct	6 ms	768 KB	Output is correct
4	Correct	6 ms	768 KB	Output is correct
5	Correct	6 ms	768 KB	Output is correct
6	Correct	6 ms	768 KB	Output is correct
7	Correct	5 ms	768 KB	Output is correct
8	Correct	6 ms	768 KB	Output is correct
9	Correct	5 ms	768 KB	Output is correct
10	Correct	6 ms	768 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	1 ms	384 KB	Output is correct
16	Correct	2 ms	300 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	356 KB	Output is correct
20	Correct	2 ms	384 KB	Output is correct
21	Incorrect	5 ms	768 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Subtask #4
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	768 KB	Output is correct
2	Correct	5 ms	768 KB	Output is correct
3	Correct	6 ms	768 KB	Output is correct
4	Correct	6 ms	768 KB	Output is correct
5	Correct	6 ms	768 KB	Output is correct
6	Correct	6 ms	768 KB	Output is correct
7	Correct	5 ms	768 KB	Output is correct
8	Correct	6 ms	768 KB	Output is correct
9	Correct	5 ms	768 KB	Output is correct
10	Correct	6 ms	768 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	1 ms	384 KB	Output is correct
16	Correct	2 ms	300 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	356 KB	Output is correct
20	Correct	2 ms	384 KB	Output is correct
21	Incorrect	5 ms	768 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Subtask #5
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	768 KB	Output is correct
2	Correct	4 ms	768 KB	Output is correct
3	Correct	5 ms	768 KB	Output is correct
4	Correct	5 ms	768 KB	Output is correct
5	Correct	4 ms	768 KB	Output is correct
6	Correct	5 ms	768 KB	Output is correct
7	Correct	10 ms	768 KB	Output is correct
8	Correct	5 ms	768 KB	Output is correct
9	Correct	5 ms	768 KB	Output is correct
10	Correct	6 ms	768 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	3 ms	384 KB	Output is correct
16	Correct	6 ms	768 KB	Output is correct
17	Correct	5 ms	768 KB	Output is correct
18	Correct	6 ms	768 KB	Output is correct
19	Correct	6 ms	768 KB	Output is correct
20	Correct	6 ms	768 KB	Output is correct
21	Correct	6 ms	768 KB	Output is correct
22	Correct	5 ms	768 KB	Output is correct
23	Correct	6 ms	768 KB	Output is correct
24	Correct	5 ms	768 KB	Output is correct
25	Correct	6 ms	768 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	1 ms	384 KB	Output is correct
31	Correct	2 ms	300 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	356 KB	Output is correct
35	Correct	2 ms	384 KB	Output is correct
36	Incorrect	5 ms	768 KB	Output isn't correct
37	Halted	0 ms	0 KB	-

답안 #68843

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 0 / 20.0

Subtask #3 0 / 35.0

Subtask #4 0 / 20.0

Subtask #5 0 / 20.0

Subtask #1
5.0 / 5.0

Subtask #2
0 / 20.0

Subtask #3
0 / 35.0

Subtask #4
0 / 20.0

Subtask #5
0 / 20.0