# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
68838 | 2018-08-18T18:05:00 Z | duality | Bulldozer (JOI17_bulldozer) | C++11 | 3 ms | 512 KB |
#include <bits/stdc++.h> using namespace std; #define mp make_pair #define pb push_back 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]; 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) { int m = 0,ans = 0; for (j = 0; j < N; j++) { m += p[j].w; if (m < 0) m = 0; ans = max(ans,m); } printf("%d\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; } int ans = 0; sort(events.begin(),events.end(),comp2); for (i = 0; i < events.size(); i++) { int m = 0; for (j = 0; j < N; j++) { m += arr[j]; if (m < 0) m = 0; ans = max(ans,m); } swap(arr[pos[events[i].i]],arr[pos[events[i].j]]); swap(pos[events[i].i],pos[events[i].j]); } printf("%d\n",ans); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 512 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 512 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 512 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |