oj.uz

Submission #306890

# Submission time Handle Problem Language Result Execution time Memory
306890 2020-09-26T13:44:28 Z giorgikob Stations (IOI20_stations) C++14
0 / 100
 869 ms 880 KB 
#include "stations.h"
#include <vector>
#include<bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define pb push_back
using namespace std;

const int N = 1e3+5;

/*int cnt = 0;
int c = 0;
int answer[N][N];

void dfs(int x){
    fix[x] = 1;
    answer[root][x] = c;
    for(auto to : gr[x]){
        if(fix[to]) continue;
        dfs(to);
    }
}*/

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	std::vector<int> labels(n);
	for (int i = 0; i < n; i++) {
		labels[i] = i;
		//cnt++;
	}

	/*for(int i = 0; i < n; i++){
        int x = u[i];
        int y = v[i];
        gr[x].pb(y);
        gr[y].pb(x);
	}

	for(int x = 0; x < n; x ++){
        fix[x] = 1;
        for(auto to : gr[x]){
            dfs(to);
        }
	}*/
	return labels;
}

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

Subtask #1
0 / 5.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 16.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 869 ms 640 KB Output is correct
2 Incorrect 688 ms 652 KB Wrong query response.
3 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

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