답안 #68885 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
68885	2018-08-18T23:09:22 Z	duality	Bulldozer (JOI17_bulldozer)	C++11	100 / 100	1228 ms	17128 KB

bulldozer

#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------
#define x first
#define y second
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; };
vector<event> events;
LLI cross(event a,event b) {
    pii av = mp(p[a.j].x-p[a.i].x,p[a.j].y-p[a.i].y);
    pii bv = mp(p[b.j].x-p[b.i].x,p[b.j].y-p[b.i].y);
    return (LLI) av.x*bv.y-(LLI) av.y*bv.x;
}
bool comp2(event a,event b) {
    LLI c = cross(a,b);
    if (c == 0) {
        if (a.i == b.i) return a.j < b.j;
        else return a.i < b.i;
    }
    else return c > 0;
}
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++) events.pb((event){i,j});
        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++) {
        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) || (cross(events[i],events[i+1]) != 0)) ans = max(ans,vec[0]);
    }
    printf("%lld\n",ans);

    return 0;
}

Compilation message

bulldozer.cpp: In function 'int main()':
bulldozer.cpp:116:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < events.size(); i++) {
                 ~~^~~~~~~~~~~~~~~
bulldozer.cpp:121:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if ((i == events.size()-1) || (cross(events[i],events[i+1]) != 0)) ans = max(ans,vec[0]);
              ~~^~~~~~~~~~~~~~~~~~
bulldozer.cpp:104:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&N);
     ~~~~~^~~~~~~~~
bulldozer.cpp:105: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	512 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	512 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	512 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	512 KB	Output is correct
6	Correct	4 ms	512 KB	Output is correct
7	Correct	4 ms	512 KB	Output is correct
8	Correct	4 ms	512 KB	Output is correct
9	Correct	3 ms	512 KB	Output is correct
10	Correct	4 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	2 ms	384 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	2 ms	356 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct
20	Correct	2 ms	384 KB	Output is correct
21	Correct	3 ms	512 KB	Output is correct
22	Correct	3 ms	512 KB	Output is correct
23	Correct	3 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	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	3 ms	512 KB	Output is correct
30	Correct	3 ms	512 KB	Output is correct
31	Correct	3 ms	512 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	512 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	512 KB	Output is correct
6	Correct	4 ms	512 KB	Output is correct
7	Correct	4 ms	512 KB	Output is correct
8	Correct	4 ms	512 KB	Output is correct
9	Correct	3 ms	512 KB	Output is correct
10	Correct	4 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	2 ms	384 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	2 ms	356 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct
20	Correct	2 ms	384 KB	Output is correct
21	Correct	3 ms	512 KB	Output is correct
22	Correct	3 ms	512 KB	Output is correct
23	Correct	3 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	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	3 ms	512 KB	Output is correct
30	Correct	3 ms	512 KB	Output is correct
31	Correct	3 ms	512 KB	Output is correct
32	Correct	4 ms	512 KB	Output is correct
33	Correct	1138 ms	16988 KB	Output is correct
34	Correct	1171 ms	16988 KB	Output is correct
35	Correct	1147 ms	16984 KB	Output is correct
36	Correct	1157 ms	17128 KB	Output is correct
37	Correct	1174 ms	16988 KB	Output is correct
38	Correct	1167 ms	16992 KB	Output is correct
39	Correct	1201 ms	16988 KB	Output is correct
40	Correct	1162 ms	16988 KB	Output is correct
41	Correct	1177 ms	16984 KB	Output is correct
42	Correct	1144 ms	17072 KB	Output is correct
43	Correct	1161 ms	16988 KB	Output is correct
44	Correct	1148 ms	16972 KB	Output is correct
45	Correct	1142 ms	17056 KB	Output is correct
46	Correct	1123 ms	16984 KB	Output is correct
47	Correct	1135 ms	16992 KB	Output is correct
48	Correct	1166 ms	17060 KB	Output is correct
49	Correct	1136 ms	16984 KB	Output is correct
50	Correct	1144 ms	16992 KB	Output is correct
51	Correct	1163 ms	16988 KB	Output is correct
52	Correct	1153 ms	16984 KB	Output is correct
53	Correct	1149 ms	16984 KB	Output is correct
54	Correct	1186 ms	17000 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	512 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	512 KB	Output is correct
6	Correct	4 ms	512 KB	Output is correct
7	Correct	4 ms	512 KB	Output is correct
8	Correct	4 ms	512 KB	Output is correct
9	Correct	3 ms	512 KB	Output is correct
10	Correct	4 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	2 ms	384 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	2 ms	356 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct
20	Correct	2 ms	384 KB	Output is correct
21	Correct	3 ms	512 KB	Output is correct
22	Correct	3 ms	512 KB	Output is correct
23	Correct	3 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	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	3 ms	512 KB	Output is correct
30	Correct	3 ms	512 KB	Output is correct
31	Correct	3 ms	512 KB	Output is correct
32	Correct	4 ms	512 KB	Output is correct
33	Correct	1138 ms	16988 KB	Output is correct
34	Correct	1171 ms	16988 KB	Output is correct
35	Correct	1147 ms	16984 KB	Output is correct
36	Correct	1157 ms	17128 KB	Output is correct
37	Correct	1174 ms	16988 KB	Output is correct
38	Correct	1167 ms	16992 KB	Output is correct
39	Correct	1201 ms	16988 KB	Output is correct
40	Correct	1162 ms	16988 KB	Output is correct
41	Correct	1177 ms	16984 KB	Output is correct
42	Correct	1144 ms	17072 KB	Output is correct
43	Correct	1161 ms	16988 KB	Output is correct
44	Correct	1148 ms	16972 KB	Output is correct
45	Correct	1142 ms	17056 KB	Output is correct
46	Correct	1123 ms	16984 KB	Output is correct
47	Correct	1135 ms	16992 KB	Output is correct
48	Correct	1166 ms	17060 KB	Output is correct
49	Correct	1136 ms	16984 KB	Output is correct
50	Correct	1144 ms	16992 KB	Output is correct
51	Correct	1163 ms	16988 KB	Output is correct
52	Correct	1153 ms	16984 KB	Output is correct
53	Correct	1149 ms	16984 KB	Output is correct
54	Correct	1186 ms	17000 KB	Output is correct
55	Correct	1147 ms	17000 KB	Output is correct
56	Correct	1139 ms	16992 KB	Output is correct
57	Correct	1147 ms	17000 KB	Output is correct
58	Correct	1147 ms	17000 KB	Output is correct
59	Correct	1168 ms	17000 KB	Output is correct
60	Correct	1171 ms	16988 KB	Output is correct
61	Correct	1228 ms	16976 KB	Output is correct
62	Correct	1138 ms	17040 KB	Output is correct
63	Correct	1139 ms	16992 KB	Output is correct
64	Correct	1155 ms	16984 KB	Output is correct
65	Correct	1172 ms	17028 KB	Output is correct
66	Correct	1133 ms	16988 KB	Output is correct
67	Correct	1147 ms	16984 KB	Output is correct
68	Correct	1177 ms	16956 KB	Output is correct
69	Correct	1151 ms	16992 KB	Output is correct
70	Correct	1128 ms	17112 KB	Output is correct
71	Correct	1131 ms	17000 KB	Output is correct
72	Correct	1161 ms	17084 KB	Output is correct
73	Correct	1158 ms	16988 KB	Output is correct
74	Correct	1142 ms	16976 KB	Output is correct

Subtask #5
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	512 KB	Output is correct
2	Correct	3 ms	512 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	512 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	512 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	512 KB	Output is correct
21	Correct	4 ms	512 KB	Output is correct
22	Correct	4 ms	512 KB	Output is correct
23	Correct	4 ms	512 KB	Output is correct
24	Correct	3 ms	512 KB	Output is correct
25	Correct	4 ms	512 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	356 KB	Output is correct
34	Correct	2 ms	384 KB	Output is correct
35	Correct	2 ms	384 KB	Output is correct
36	Correct	3 ms	512 KB	Output is correct
37	Correct	3 ms	512 KB	Output is correct
38	Correct	3 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	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	3 ms	512 KB	Output is correct
45	Correct	3 ms	512 KB	Output is correct
46	Correct	3 ms	512 KB	Output is correct
47	Correct	4 ms	512 KB	Output is correct
48	Correct	1138 ms	16988 KB	Output is correct
49	Correct	1171 ms	16988 KB	Output is correct
50	Correct	1147 ms	16984 KB	Output is correct
51	Correct	1157 ms	17128 KB	Output is correct
52	Correct	1174 ms	16988 KB	Output is correct
53	Correct	1167 ms	16992 KB	Output is correct
54	Correct	1201 ms	16988 KB	Output is correct
55	Correct	1162 ms	16988 KB	Output is correct
56	Correct	1177 ms	16984 KB	Output is correct
57	Correct	1144 ms	17072 KB	Output is correct
58	Correct	1161 ms	16988 KB	Output is correct
59	Correct	1148 ms	16972 KB	Output is correct
60	Correct	1142 ms	17056 KB	Output is correct
61	Correct	1123 ms	16984 KB	Output is correct
62	Correct	1135 ms	16992 KB	Output is correct
63	Correct	1166 ms	17060 KB	Output is correct
64	Correct	1136 ms	16984 KB	Output is correct
65	Correct	1144 ms	16992 KB	Output is correct
66	Correct	1163 ms	16988 KB	Output is correct
67	Correct	1153 ms	16984 KB	Output is correct
68	Correct	1149 ms	16984 KB	Output is correct
69	Correct	1186 ms	17000 KB	Output is correct
70	Correct	1147 ms	17000 KB	Output is correct
71	Correct	1139 ms	16992 KB	Output is correct
72	Correct	1147 ms	17000 KB	Output is correct
73	Correct	1147 ms	17000 KB	Output is correct
74	Correct	1168 ms	17000 KB	Output is correct
75	Correct	1171 ms	16988 KB	Output is correct
76	Correct	1228 ms	16976 KB	Output is correct
77	Correct	1138 ms	17040 KB	Output is correct
78	Correct	1139 ms	16992 KB	Output is correct
79	Correct	1155 ms	16984 KB	Output is correct
80	Correct	1172 ms	17028 KB	Output is correct
81	Correct	1133 ms	16988 KB	Output is correct
82	Correct	1147 ms	16984 KB	Output is correct
83	Correct	1177 ms	16956 KB	Output is correct
84	Correct	1151 ms	16992 KB	Output is correct
85	Correct	1128 ms	17112 KB	Output is correct
86	Correct	1131 ms	17000 KB	Output is correct
87	Correct	1161 ms	17084 KB	Output is correct
88	Correct	1158 ms	16988 KB	Output is correct
89	Correct	1142 ms	16976 KB	Output is correct
90	Correct	1153 ms	16956 KB	Output is correct
91	Correct	1181 ms	17096 KB	Output is correct
92	Correct	1156 ms	16984 KB	Output is correct
93	Correct	1165 ms	17036 KB	Output is correct
94	Correct	1176 ms	17000 KB	Output is correct
95	Correct	1174 ms	17000 KB	Output is correct
96	Correct	1165 ms	17000 KB	Output is correct
97	Correct	1137 ms	16992 KB	Output is correct
98	Correct	1156 ms	16988 KB	Output is correct
99	Correct	1130 ms	17076 KB	Output is correct
100	Correct	1090 ms	16988 KB	Output is correct
101	Correct	1108 ms	16988 KB	Output is correct
102	Correct	1071 ms	17000 KB	Output is correct
103	Correct	1063 ms	16984 KB	Output is correct
104	Correct	1109 ms	16976 KB	Output is correct
105	Correct	1101 ms	16988 KB	Output is correct
106	Correct	1155 ms	17060 KB	Output is correct
107	Correct	1122 ms	16984 KB	Output is correct
108	Correct	1086 ms	16992 KB	Output is correct
109	Correct	1130 ms	17000 KB	Output is correct
110	Correct	1103 ms	16984 KB	Output is correct
111	Correct	1097 ms	16996 KB	Output is correct
112	Correct	1112 ms	16988 KB	Output is correct
113	Correct	1089 ms	16976 KB	Output is correct
114	Correct	1092 ms	16984 KB	Output is correct
115	Correct	1105 ms	16984 KB	Output is correct
116	Correct	1103 ms	16976 KB	Output is correct
117	Correct	1089 ms	17000 KB	Output is correct
118	Correct	1066 ms	17120 KB	Output is correct
119	Correct	1076 ms	17092 KB	Output is correct
120	Correct	2 ms	384 KB	Output is correct
121	Correct	2 ms	384 KB	Output is correct
122	Correct	1152 ms	17000 KB	Output is correct
123	Correct	1141 ms	17056 KB	Output is correct
124	Correct	1132 ms	16984 KB	Output is correct
125	Correct	1158 ms	17000 KB	Output is correct
126	Correct	1132 ms	16984 KB	Output is correct
127	Correct	1157 ms	17000 KB	Output is correct
128	Correct	1156 ms	16992 KB	Output is correct
129	Correct	1143 ms	16984 KB	Output is correct
130	Correct	1159 ms	16984 KB	Output is correct
131	Correct	1135 ms	16976 KB	Output is correct
132	Correct	1144 ms	16992 KB	Output is correct
133	Correct	1156 ms	16984 KB	Output is correct

답안 #68885

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 20.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
20.0 / 20.0