Submission #315637

# Submission time Handle Problem Language Result Execution time Memory
315637 2020-10-23T13:06:58 Z Sorting Stations (IOI20_stations) C++17
0 / 100
872 ms 1024 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 >>= 1;
    }
    assert(lower_bound(c.begin(), c.end(), t) != c.end());
    return t;
}
/*
1
5 10
0 1
0 2
1 3
1 4
*/
# Verdict Execution time Memory Grader output
1 Runtime error 4 ms 1024 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 507 ms 880 KB Wrong query response.
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 4 ms 1024 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 872 ms 644 KB Output is correct
2 Runtime error 2 ms 896 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 4 ms 1024 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -