oj.uz

Submission #985509

# Submission time Handle Problem Language Result Execution time Memory
985509 2024-05-18T02:13:07 Z Maaxle Stations (IOI20_stations) C++17
0 / 100
 591 ms 936 KB 
#include "stations.h"
#include <bits/stdc++.h>

#define range(it, a, b) for (ll it = a; it < b; it++)
#define all(x) begin(x), end(x)
#define ll long long
#define ull unsigned long long
#define INF64 ((ll) 1 << 62)
#define INF32 (1 << 30)
#define mset multiset
#define uset unordered_set
#define umap unordered_map 
#define pqueue priority_queue 
#define ptr(A) shared_ptr<A>

using namespace std;

static void dfs(int i, int p, int d, int& timer, vector<vector<int>>& adj, vector<int>& l) {    
    if (!(d & 1))
        l[i] = timer;
    timer++;

    for (int& k : adj[i]) {
        if (k != p)
            dfs(k, i, d+1, timer, adj, l);
    }

    if (d & 1)  
        l[i] = timer;
    timer++;
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
    vector<vector<int>> adj (n);
    vector<int> l (n);

    range(i, 0, n-1) {
        adj[u[i]].push_back(v[i]);
        adj[v[i]].push_back(u[i]);
    }

    int timer = 0;
    dfs(0, 0, 0, timer, adj, l);
    
    vector<int> ans = l;
    sort(all(l));
    range(i, 0, n) 
        ans[i] = distance(begin(l), lower_bound(all(l), ans[i]));
    return ans;
}
		

int find_next_station(int s, int t, vector<int> c) {
    if (c.size() == 1)
        return c[0];

    // CASE 1 -> s has an 'in' value
    // every node in c has value 'out'
    // the parent of them all is the right-most value
    // s is the left-most value
    if (s < c[0]) {

        // CASE 1.1 -> t is not a decendant of s
        // and t is before s
        if (t < s) 
            return c.back();
            
        // CASE 1.2 -> t may or not be decendant of s
        // ancestor of t is the first in c that is >= t
        for (int& i : c) {
            if (i >= t)
                return i;
        }
    }

    // CASE 2 -> s has an 'out' value
    // every node in c has value 'in'
    // the parent of them all is the left-most value
    // s is the right-most value
    
    // CASE 2.1 -> t is not a decendant of s
    //  and t is after s
    if (t > s) 
        return c[0];
    
    // CASE 2.2 -> t may or not be a decendant of s
    // ancestor of t is the first in c that is <= t (backwards)
    for (auto i = rbegin(c); 1; i++) {
        if (*i <= t)
            return *i;
    }
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 16.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 591 ms 684 KB Output is correct
2 Correct 419 ms 684 KB Output is correct
3 Correct 366 ms 684 KB Output is correct
4 Correct 1 ms 768 KB Output is correct
5 Incorrect 2 ms 768 KB Wrong query response.
6 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

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