oj.uz

Submission #306769

# Submission time Handle Problem Language Result Execution time Memory
306769 2020-09-26T08:57:38 Z VEGAnn Stations (IOI20_stations) C++14
0 / 100
 978 ms 1024 KB 
#include "stations.h"
#include <bits/stdc++.h>
#define PB push_back
#define sz(x) ((int)x.size())
using namespace std;
vector<int> g[1000];
int tin[1000], tout[1000], tt = 0;

void dfs(int v, int p){
    tin[v] = tt++;

    for (int u : g[v]){
        if (u == p) continue;
        dfs(u, v);
    }

    tout[v] = tt - 1;
}

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
    for (int i = 0; i < n; i++)
        g[i].clear();

    tt = 0;

    for (int i = 0; i < sz(u); i++){
        g[u[i]].PB(v[i]);
        g[v[i]].PB(u[i]);
    }

    dfs(0, -1);

    vector<int> labels;

    labels.resize(n);

    for (int i = 0; i < n; i++) {
        labels[i] = tin[i] * 1000 + tout[i];
        assert(labels[i] <= k);
    }

	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
//    int N = 1000;
//
//    int tin_s = s / N;
//    int tout_s = s % N;
//
//    int tin_t = t / N;
//    int tout_t = t % N;
//
//    if (tin_s <= tin_t && tout_s >= tout_t){
//        for (int v : c) {
//            int tin_v = v / N;
//            int tout_v = v % N;
//
//            if (tin_v > tin_s && tin_v <= tin_t && tout_v >= tout_t)
//                return v;
//        }
//    } else {
//        for (int v : c)
//            if (v / N < tin_s)
//                return v;
//    }
    return c[0];
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 640 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 978 ms 872 KB Output is correct
2 Incorrect 739 ms 1024 KB Wrong query response.
3 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

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