Submission #68837

#	Time	Username	Problem	Language	Result	Execution time	Memory
68837		duality	Bulldozer (JOI17_bulldozer)	C++11	0 / 100	3 ms	512 KiB

bulldozer

#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;
    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;
            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 (stderr)

bulldozer.cpp: In function 'int main()':
bulldozer.cpp:39:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < events.size(); i++) {
                 ~~^~~~~~~~~~~~~~~
bulldozer.cpp:24:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&N);
     ~~~~~^~~~~~~~~
bulldozer.cpp:25: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: 0 / 5
• Subtask 2: 0 / 20
• Subtask 3: 0 / 35
• Subtask 4: 0 / 20
• Subtask 5: 0 / 20