oj.uz

Submission #966360

# Submission time Handle Problem Language Result Execution time Memory
966360 2024-04-19T18:13:36 Z njoop Best Place (NOI17_bestplace) C++14
36 / 100
 27 ms 1116 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;

int n, x[100010], y[100010], px, py;
ll ax, ay, mnx, mny;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n;
    for(int i=1; i<=n; i++) {
        cin >> x[i] >> y[i];
        ax += x[i];
        ay += y[i];
    }
    sort(x+1, x+n+1);
    sort(y+1, y+n+1);
    mnx = ax;
    mny = ay;
    px = x[1];
    py = y[1];
    for(int i=2; i<=n; i++) {
        ax -= (n-i+1)*(x[i]-x[i-1]);
        ax += (i-1)*(x[i]-x[i-1]);
        if(mnx > ax) {
            ax = mnx;
            px = x[i];
        }
        ay -= (n-i+1)*(y[i]-y[i-1]);
        ay += (i-1)*(y[i]-y[i-1]);
        if(mny > ay) {
            ay = mny;
            py = y[i];
        }
    }
    cout << px << " " << py;
    return 0;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1028 KB Output is correct
2 Incorrect 19 ms 1116 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 472 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 27 ms 1116 KB Output isn't correct
2 Halted 0 ms 0 KB -