oj.uz

Submission #350200

# Submission time Handle Problem Language Result Execution time Memory
350200 2021-01-19T04:12:52 Z talant117408 Stations (IOI20_stations) C++17
0 / 100
 896 ms 1124 KB 
#include "stations.h"
#include <bits/stdc++.h>
#ifndef EVAL
#include "stub.cpp"
#endif
using namespace std;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;

vector <vector <int>> graph(1003);
int timer, num[1003];

void dfs(int v, int p = 0){
    num[v] = ++timer;
    for(auto to : graph[v]){
        if(to != p){
            dfs(to, v);
        }
    }
}

vector<int> label(int n, int k, vector<int> u, vector<int> v){
    timer = -1;
    for(int i = 0; i < n; i++){
        graph[i].clear();
    }
    vector <int> labels(n);
    for(int i = 0; i < sz(u); i++){
        graph[u[i]].pb(v[i]);
        graph[v[i]].pb(u[i]);
    }
    dfs(0);
    for(int i = 0; i < n; i++){
        labels[i] = num[i];
    }
    return labels;
}

int find_next_station(int s, int t, vector<int> c){
	if(t <= c[0]) return c[0];
    auto it = lb(all(c), t);
    if(it == c.end()){
        it--;
        return *it;
    }
    else if(*it == t) return t;
    else{
        it--;
        return *it;
    }
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 456 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 523 ms 1124 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 896 ms 864 KB Output is correct
2 Correct 864 ms 864 KB Output is correct
3 Incorrect 754 ms 948 KB Wrong query response.
4 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

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