oj.uz

Submission #683119

# Submission time Handle Problem Language Result Execution time Memory
683119 2023-01-17T18:22:56 Z bleahbleah Roller Coaster Railroad (IOI16_railroad) C++17
30 / 100
 869 ms 77564 KB 
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
using namespace std;

using ll = long long;

//#define int ll
#define sz(x) ((int)(x).size())

using pii = pair<int,int>;
using tii = tuple<int,int,int>;

const int nmax = 5e5 + 5, inf = 1e9 + 5; 

vector<int> g[nmax];
bool occ[nmax];
void dfs(int node) {
  if(occ[node]) return;
  occ[node] = 1;
  for(auto x : g[node]) {
    dfs(x);
  }
  return;
}

long long plan_roller_coaster(vector<int> s, vector<int> t) {
  t.emplace_back(0);
  s.emplace_back(inf);
  
  unordered_map<int,int> nrm;
  map<int,int> smen;
  for(auto x : s)
    smen[x]++;
  for(auto x : t)
    smen[x]--;
  
  int edgc = 0;
  int last = 0, cnt = 0;
  
  for(auto [a, b] : smen)  {
    nrm[a] = cnt++;
    if(edgc != 0)
      g[nrm[a]].emplace_back(nrm[last]),
      g[nrm[last]].emplace_back(nrm[a]);
    edgc += b;
    if(edgc > 0) return 3;
    last = a;
    //cerr << a << ' ' << edgc << '\n';
  }
  for(int i = 0; i < sz(s); i++)
    g[nrm[s[i]]].emplace_back(nrm[t[i]]),
    g[nrm[t[i]]].emplace_back(nrm[s[i]]);
  dfs(0);
  for(auto x : s)
    if(occ[nrm[x]] == 0) return 3;
  for(auto x : t)
    if(occ[nrm[x]] == 0) return 3;
  return 0;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB n = 2
2 Correct 6 ms 11988 KB n = 2
3 Correct 6 ms 11988 KB n = 2
4 Correct 6 ms 12020 KB n = 2
5 Correct 6 ms 11988 KB n = 2
6 Incorrect 6 ms 11988 KB answer is not correct: 3 instead of 523688153
7 Halted 0 ms 0 KB -

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB n = 2
2 Correct 6 ms 11988 KB n = 2
3 Correct 6 ms 11988 KB n = 2
4 Correct 6 ms 12020 KB n = 2
5 Correct 6 ms 11988 KB n = 2
6 Incorrect 6 ms 11988 KB answer is not correct: 3 instead of 523688153
7 Halted 0 ms 0 KB -

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 869 ms 73680 KB n = 199999
2 Correct 319 ms 37760 KB n = 199991
3 Correct 304 ms 37764 KB n = 199993
4 Correct 616 ms 59964 KB n = 152076
5 Correct 375 ms 42748 KB n = 93249
6 Correct 653 ms 64316 KB n = 199910
7 Correct 847 ms 75692 KB n = 199999
8 Correct 672 ms 64780 KB n = 199997
9 Correct 683 ms 66088 KB n = 171294
10 Correct 534 ms 56980 KB n = 140872
11 Correct 607 ms 64492 KB n = 199886
12 Correct 792 ms 74208 KB n = 199996
13 Correct 648 ms 65112 KB n = 200000
14 Correct 299 ms 36636 KB n = 199998
15 Correct 333 ms 36280 KB n = 200000
16 Correct 307 ms 37288 KB n = 199998
17 Correct 255 ms 37848 KB n = 200000
18 Correct 329 ms 36700 KB n = 190000
19 Correct 681 ms 70876 KB n = 177777
20 Correct 418 ms 44700 KB n = 100000
21 Correct 841 ms 77440 KB n = 200000
22 Correct 669 ms 68480 KB n = 200000
23 Correct 821 ms 77564 KB n = 200000

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB n = 2
2 Correct 6 ms 11988 KB n = 2
3 Correct 6 ms 11988 KB n = 2
4 Correct 6 ms 12020 KB n = 2
5 Correct 6 ms 11988 KB n = 2
6 Incorrect 6 ms 11988 KB answer is not correct: 3 instead of 523688153
7 Halted 0 ms 0 KB -