| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1338734 | jenterjongle45 | 기지국 (IOI20_stations) | C++20 | 393 ms | 440 KiB |
#include "stations.h"
#include <vector>
using namespace std;
vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
vector<int> labels(n);
for (int i = 0; i < n; i++) {
labels[i] = i+1;
}
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
while(t!=s*2&&t!=2*s+1&&t!=0) t>>=1;
return (t==0?s/2:t);
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
