oj.uz

Submission #315537

# Submission time Handle Problem Language Result Execution time Memory
315537 2020-10-23T03:56:06 Z qpwoeirut Rail (IOI14_rail) C++17
30 / 100
 84 ms 512 KB 
#include <bits/stdc++.h>
#include "rail.h"

using namespace std;

#define dist first
#define idx second

typedef pair<int,int> pii;

const int MN = 5001;

pii station[MN];

void findLocation(int N, int first, int location[], int stype[]) {
    for (int i=0; i<N; ++i) {
        station[i].dist = getDistance(0, i);
        station[i].idx = i;
    }

    sort(station+1, station+N);
    int closest = station[1].idx;
    int mdst = station[1].dist;

    location[0] = first;
    location[closest] = first + mdst;
    for (int i=2; i<N; ++i) {
        int cur = getDistance(closest, station[i].idx);
        if (mdst + cur == station[i].dist) {
            int offset = station[i].dist - (mdst * 2);
            location[station[i].idx] = first - offset;
        } else {
            location[station[i].idx] = first + station[i].dist;
        }
    }

    for (int i=0; i<N; ++i) {
        stype[i] = (location[i] <= first ? 1 : 2);
    }
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct

Subtask #3
0 / 26.0

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

Subtask #4
0 / 44.0

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