| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1335890 | yc11 | 통행료 (IOI18_highway) | C++20 | 6 ms | 712 KiB |
#include<bits/stdc++.h>
#include "highway.h"
using namespace std;
void find_pair(int N, std::vector<int> U, std::vector<int> V, int A, int B) {
int M = U.size();
vector<int> n1;
n1.assign(N,0);
vector<int> w1;
w1.assign(M,0);
int l = ask(w1)/A;
for (int i = 0;i<M;i++){
vector<int> w;
w.assign(M,0);
w[i] = 1;
if (ask(w)!=A*l){
n1[U[i]]++;
n1[V[i]]++;
}
}
vector<int> n2;
for (int i = 0;i<N;i++){
if (n1[i]==1) n2.push_back(i);
}
answer(n2[0],n2[1]);
}| # | 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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
