oj.uz

Submission #541560

# Submission time Handle Problem Language Result Execution time Memory
541560 2022-03-23T18:32:59 Z dxz05 Rail (IOI14_rail) C++14
100 / 100
 95 ms 736 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];
    });
    
    int P = perm[0];
    perm.erase(perm.begin());

    location[P] = first + dist[P];
    stype[P] = 2;
    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;
            if (location[i] > location[R]) R = i;
        } else {
            location[i] = location[R] - dR;
            stype[i] = 1;
            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:33:36: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   33 |         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 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 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 0 ms 340 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 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 91 ms 708 KB Output is correct
2 Correct 74 ms 708 KB Output is correct
3 Correct 76 ms 704 KB Output is correct
4 Correct 79 ms 724 KB Output is correct
5 Correct 85 ms 720 KB Output is correct
6 Correct 71 ms 712 KB Output is correct
7 Correct 93 ms 712 KB Output is correct
8 Correct 76 ms 712 KB Output is correct
9 Correct 81 ms 712 KB Output is correct
10 Correct 75 ms 720 KB Output is correct

Subtask #4
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 724 KB Output is correct
2 Correct 76 ms 712 KB Output is correct
3 Correct 80 ms 716 KB Output is correct
4 Correct 82 ms 716 KB Output is correct
5 Correct 73 ms 712 KB Output is correct
6 Correct 73 ms 712 KB Output is correct
7 Correct 77 ms 736 KB Output is correct
8 Correct 87 ms 712 KB Output is correct
9 Correct 73 ms 716 KB Output is correct
10 Correct 74 ms 708 KB Output is correct
11 Correct 84 ms 716 KB Output is correct
12 Correct 95 ms 708 KB Output is correct
13 Correct 89 ms 720 KB Output is correct
14 Correct 76 ms 708 KB Output is correct
15 Correct 76 ms 720 KB Output is correct
16 Correct 77 ms 716 KB Output is correct
17 Correct 90 ms 724 KB Output is correct
18 Correct 76 ms 728 KB Output is correct
19 Correct 76 ms 712 KB Output is correct
20 Correct 85 ms 712 KB Output is correct