Submission #315638

# Submission time Handle Problem Language Result Execution time Memory
315638 2020-10-23T13:13:18 Z Sorting Stations (IOI20_stations) C++17
8 / 100
1081 ms 1064 KB
#include "stations.h"
#include <bits/stdc++.h>

using namespace std;

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

int find_next_station(int s, int t, vector<int> c){
    while(true){
        if(t <= s) return c[0];
        if(t == 2 * s + 1 || t == 2 * s + 2) break;
        t = (t - 1) >> 1;
    }
    return t;
}
/*
2
5 10
0 1
0 2
1 3
1 4
1
0 4 0
2 1
0 1
1
1 0 0
*/
# Verdict Execution time Memory Grader output
1 Incorrect 557 ms 876 KB Wrong query response.
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 513 ms 1064 KB Output is correct
2 Correct 666 ms 768 KB Output is correct
3 Correct 1081 ms 640 KB Output is correct
4 Correct 649 ms 640 KB Output is correct
5 Correct 570 ms 640 KB Output is correct
6 Correct 431 ms 888 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 609 ms 884 KB Wrong query response.
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1020 ms 640 KB Output is correct
2 Incorrect 863 ms 640 KB Wrong query response.
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 681 ms 1024 KB Wrong query response.
2 Halted 0 ms 0 KB -