oj.uz

Submission #985492

# Submission time Handle Problem Language Result Execution time Memory
985492 2024-05-18T01:13:22 Z Alex0x0 Stations (IOI20_stations) C++14
5 / 100
 587 ms 944 KB 
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
// #pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define f first
#define s second
#define fore(i,a,b) for(int i = (a), ThxMK = (b); i < ThxMK; ++i)
#define pb push_back
#define all(s) begin(s), end(s)
#define _ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sz(s) int(s.size())
#define ENDL '\n'
using namespace std;
typedef long double ld;
typedef int lli;
typedef pair<lli,lli> ii;
typedef vector<lli> vi;
typedef vector<ii> vii;
#define deb(x) cout << #x": " << (x) << endl;

vector <vi> adj;

vi tk;
lli curVis = 0;

void dfs(lli u){
  tk[u] = curVis++;
  // cout << u << ' ';
  for (auto & i : adj[u]){
    if (tk[i] == -1) dfs(i);
  }
}

vi label(lli n, lli k, vi u, vi v){
  adj.resize(n + 5);
  for (auto &i : adj) i.clear();
  tk.resize(n);
  for (auto &i : tk) i = -1ll;
  curVis = 0;
  fore(i,0,n-1){
    adj[u[i]].pb(v[i]);
    adj[v[i]].pb(u[i]);
    // cout << u[i] << ' ' << v[i] << ENDL;
  }
  lli lst = 0;
  fore(i,0,n) if (sz(adj[i]) == 1) lst = i;
  // fore(i,0,n) cout << i << ": " << sz(adj[i]) << ENDL;
  dfs(lst); // cout << ENDL;
  return tk;
}


lli find_next_station(lli s, lli t, vi c){
  if (t > s) return s + 1;
  return s - 1;
}

// int main(){ _
//   // freopen("file.in","r",stdin);
//   // freopen("file.out","w",stdout);
//   vector<vi> vv;
//   lli t; cin >> t;
//   while (t--){
//     lli n, k; cin >> n >> k;
//     vi a(n-1); vi b(n-1);
//     fore(i,0,n-1) cin >> a[i] >> b[i];
//     vi v = label(n, k, a, b);
//     for (auto & i : v) cout << i << ' '; cout << ENDL;
//     vv.pb(v);
//   }
//   return 0;
// }

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 331 ms 884 KB Output is correct
2 Correct 294 ms 896 KB Output is correct
3 Correct 585 ms 856 KB Output is correct
4 Correct 429 ms 684 KB Output is correct
5 Correct 340 ms 684 KB Output is correct
6 Correct 287 ms 876 KB Output is correct
7 Correct 336 ms 684 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 3 ms 768 KB Output is correct
10 Correct 0 ms 764 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 294 ms 860 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 332 ms 908 KB Output is correct
2 Correct 282 ms 896 KB Output is correct
3 Correct 549 ms 684 KB Output is correct
4 Correct 421 ms 684 KB Output is correct
5 Correct 374 ms 684 KB Output is correct
6 Correct 273 ms 880 KB Output is correct
7 Correct 312 ms 684 KB Output is correct
8 Correct 2 ms 764 KB Output is correct
9 Correct 2 ms 768 KB Output is correct
10 Correct 0 ms 768 KB Output is correct
11 Incorrect 378 ms 680 KB Wrong query response.
12 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 587 ms 944 KB Output is correct
2 Correct 413 ms 684 KB Output is correct
3 Correct 372 ms 684 KB Output is correct
4 Correct 2 ms 764 KB Output is correct
5 Correct 2 ms 768 KB Output is correct
6 Correct 0 ms 768 KB Output is correct
7 Incorrect 357 ms 684 KB Wrong query response.
8 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 329 ms 908 KB Output is correct
2 Correct 321 ms 888 KB Output is correct
3 Correct 570 ms 684 KB Output is correct
4 Correct 432 ms 684 KB Output is correct
5 Correct 363 ms 684 KB Output is correct
6 Correct 285 ms 892 KB Output is correct
7 Correct 281 ms 684 KB Output is correct
8 Correct 2 ms 764 KB Output is correct
9 Correct 2 ms 764 KB Output is correct
10 Correct 0 ms 768 KB Output is correct
11 Incorrect 300 ms 860 KB Wrong query response.
12 Halted 0 ms 0 KB -