oj.uz

Submission #541557

# Submission time Handle Problem Language Result Execution time Memory
541557 2022-03-23T18:29:30 Z dxz05 Rail (IOI14_rail) C++14
100 / 100
 76 ms 1024 KB 
#include "rail.h"
#include <bits/stdc++.h>

using namespace std;

void findLocation(int N, int first, int location[], int stype[]){
    location[0] = first;
    stype[0] = 1;

    vector<int> dist(N);
    for (int i = 1; i < N; i++) dist[i] = getDistance(0, i);

    vector<int> perm(N - 1);
    iota(perm.begin(), perm.end(), 1);

    sort(perm.begin(), perm.end(), [&](int i, int j){
        return dist[i] < dist[j];
    });

    set<int> C, D;
    C.insert(first);

    int P = perm[0];
    perm.erase(perm.begin());

    location[P] = first + dist[P];
    stype[P] = 2;
    D.insert(location[P]);

    map<int, int> id = {make_pair(location[0], 0), make_pair(location[P], P)};

    int L = 0, R = P;
    for (int i : perm){
        int dL = getDistance(i, L), dR = getDistance(i, R);

        int p = (location[L] + location[R] + dL - dR) / 2;

        if (id.find(p) == id.end() && p > first || id.find(p) != id.end() && stype[id[p]] == 1){
            location[i] = location[L] + dL;
            stype[i] = 2;
            D.insert(location[i]);
            if (location[i] > location[R]) R = i;
        } else {
            location[i] = location[R] - dR;
            stype[i] = 1;
            C.insert(location[i]);
            if (location[i] < location[L]) L = i;
        }

        id[location[i]] = i;
    }
}

Compilation message

rail.cpp: In function 'void findLocation(int, int, int*, int*)':
rail.cpp:38:36: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   38 |         if (id.find(p) == id.end() && p > first || id.find(p) != id.end() && stype[id[p]] == 1){
      |             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
22.0 / 22.0

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

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 964 KB Output is correct
2 Correct 68 ms 896 KB Output is correct
3 Correct 69 ms 972 KB Output is correct
4 Correct 72 ms 892 KB Output is correct
5 Correct 67 ms 1024 KB Output is correct
6 Correct 70 ms 896 KB Output is correct
7 Correct 70 ms 1012 KB Output is correct
8 Correct 69 ms 892 KB Output is correct
9 Correct 68 ms 896 KB Output is correct
10 Correct 73 ms 1012 KB Output is correct

Subtask #4
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 852 KB Output is correct
2 Correct 73 ms 1012 KB Output is correct
3 Correct 71 ms 900 KB Output is correct
4 Correct 69 ms 980 KB Output is correct
5 Correct 70 ms 972 KB Output is correct
6 Correct 72 ms 896 KB Output is correct
7 Correct 70 ms 892 KB Output is correct
8 Correct 69 ms 888 KB Output is correct
9 Correct 72 ms 1008 KB Output is correct
10 Correct 71 ms 972 KB Output is correct
11 Correct 69 ms 1020 KB Output is correct
12 Correct 71 ms 1012 KB Output is correct
13 Correct 74 ms 1012 KB Output is correct
14 Correct 72 ms 972 KB Output is correct
15 Correct 70 ms 1016 KB Output is correct
16 Correct 72 ms 1012 KB Output is correct
17 Correct 69 ms 972 KB Output is correct
18 Correct 70 ms 1008 KB Output is correct
19 Correct 72 ms 1008 KB Output is correct
20 Correct 68 ms 1012 KB Output is correct