| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1354421 | sally | Sopsug (EGOI23_sopsug) | C++20 | 18 ms | 4396 KiB |
#include<iostream>
#include<vector>
using namespace std;
typedef pair<int,int> pii;
int N, M, K;
vector<pii> must;
vector<pii> no;
int main() {
cin>>N>>M>>K;
for(int i=0; i<M; i++) {
int a, b;
cin>>a>>b;
must.push_back({a, b});
}
for(int i=0; i<K; i++) {
int a, b;
cin>>a>>b;
no.push_back({a, b});
}
int a = no[0].first, b = no[0].second;
cout<<b<<' '<<a<<'\n';
int pre = a;
for(int i=0; i<N; i++) {
if(i == a || i == b) continue;
cout<<pre<<' '<<i<<'\n';
pre = i;
}
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
