Submission #1252651

#TimeUsernameProblemLanguageResultExecution timeMemory
1252651ollelapWorld Map (IOI25_worldmap)C++20
0 / 100
2 ms580 KiB
using namespace std;
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i,a,b) for(int i = a; i < b; i++)

#include "worldmap.h"

std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B) {

    int n = N;
    std::vector<std::vector<int>> ans(2 * N, std::vector<int>(2 * N, 1));

    rep(i,0,n) rep(j,0,n) {
        ans[i][j] = min(N, i+j+1);
    }

    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...