#include <bits/stdc++.h>
using namespace std;
const int K=239;
vector<vector<int>> g;
std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B){
g.resize(0);
g.resize(K, vector<int> (K, -1));
vector<pair<int,int>> ed;
for(int i=0;i<M;i++){
if(A[i]!=1&&B[i]!=1){
ed.push_back({A[i], B[i]});
}
}
for(int i=0;i<=2;i+=2){
for(int j=0;j<K;j++){
g[i][j]=1;
}
}
for(int i=0;i<K;i++){
g[i][1]=(i%N)+1;
}
int j=3;
for(auto [a, b]:ed){
g[0][j]=a;
g[1][j]=b;
j+=2;
}
for(int i=0;i<K;i++){
for(int j0=0;j0<K;j0++){
if(g[i][j0]==-1){
g[i][j0]=1;
}
}
}
return g;
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |