#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));
int us=0;
for(int j=0;j<K;j+=2){
for(int i=0;i<K;i++){
g[i][j]=(us%N)+1;
}
us++;
}
for(int j=1;j<K;j+=2){
for(int i=0;i<K;i++){
g[i][j]=(i%N)+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... |