oj.uz

Submission #916383

# Submission time Handle Problem Language Result Execution time Memory
916383 2024-01-25T19:18:17 Z biank Rail (IOI14_rail) C++14
100 / 100
 55 ms 976 KB 
#include "rail.h"
#include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define forn(i,n) for(int i=0;i<int(n);i++)
#define forsn(i,s,n) for(int i=int(s);i<int(n);i++)
#define fst first
#define snd second
typedef pair<int,int> ii;

const int C = 1, D = 2;

void findLocation(int n, int first, int loc[], int stype[]) {
    vector<ii> p(n);
    forsn(i,1,n) p[i]={getDistance(0,i),i};
    sort(ALL(p));
    set<ii> Cs, Ds;
    for(auto [d0,i]:p) {
        if(Cs.empty()) {
            loc[i]=first;
            stype[i]=C;
            Cs.insert((ii){loc[i],i});
            continue;
        }
        int minC = Cs.begin()->snd;
        if(Ds.empty()) {
            loc[i]=loc[minC]+d0;
            stype[i]=D;
            Ds.insert((ii){loc[i],i});
            continue;
        }
        int maxD = Ds.rbegin()->snd;
        int distItoC = getDistance(i,minC);
        int distItoD = getDistance(maxD,i);
        loc[i] = loc[minC] + distItoC;
        int target = (loc[i] + loc[maxD] - distItoD)/2;
        auto it = Cs.lower_bound((ii){target,0});
        if(it != Cs.end() && loc[i] - it->fst + loc[maxD] - it->fst == distItoD) {
            stype[i] = D;
            Ds.insert((ii){loc[i],i});
            continue;
        }
        loc[i] = loc[maxD] - distItoD;
        target = (distItoC + loc[i] + loc[minC])/2;
        it = Ds.lower_bound((ii){target,0});
        if(it != Ds.end() && it->fst - loc[i] + it->fst - loc[minC] == distItoC) {
            stype[i] = C;
            Cs.insert((ii){loc[i],i});
            continue;
        }
        
        loc[i] = loc[minC] + distItoC;
        if(d0 == loc[i] - loc[0]) {
            stype[i] = D;
            Ds.insert((ii){loc[i],i});
        } else {
            loc[i] = loc[maxD] - distItoD;
            stype[i] = C;
            Cs.insert((ii){loc[i],i});
        }
    }
}

Compilation message

rail.cpp: In function 'void findLocation(int, int, int*, int*)':
rail.cpp:18:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   18 |     for(auto [d0,i]:p) {
      |              ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #2
22.0 / 22.0

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

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 888 KB Output is correct
2 Correct 46 ms 892 KB Output is correct
3 Correct 48 ms 668 KB Output is correct
4 Correct 48 ms 852 KB Output is correct
5 Correct 48 ms 852 KB Output is correct
6 Correct 53 ms 976 KB Output is correct
7 Correct 48 ms 892 KB Output is correct
8 Correct 47 ms 900 KB Output is correct
9 Correct 48 ms 672 KB Output is correct
10 Correct 47 ms 676 KB Output is correct

Subtask #4
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 848 KB Output is correct
2 Correct 51 ms 884 KB Output is correct
3 Correct 47 ms 852 KB Output is correct
4 Correct 48 ms 900 KB Output is correct
5 Correct 47 ms 900 KB Output is correct
6 Correct 50 ms 892 KB Output is correct
7 Correct 48 ms 856 KB Output is correct
8 Correct 47 ms 852 KB Output is correct
9 Correct 47 ms 884 KB Output is correct
10 Correct 49 ms 888 KB Output is correct
11 Correct 47 ms 900 KB Output is correct
12 Correct 49 ms 852 KB Output is correct
13 Correct 48 ms 852 KB Output is correct
14 Correct 48 ms 888 KB Output is correct
15 Correct 47 ms 852 KB Output is correct
16 Correct 55 ms 884 KB Output is correct
17 Correct 47 ms 900 KB Output is correct
18 Correct 47 ms 904 KB Output is correct
19 Correct 48 ms 884 KB Output is correct
20 Correct 47 ms 852 KB Output is correct