Submission #1263038

#TimeUsernameProblemLanguageResultExecution timeMemory
1263038nerrrminWorld Map (IOI25_worldmap)C++20
7 / 100
8 ms1352 KiB
#include "worldmap.h"
#define pb push_back
#include <bits/stdc++.h>
using namespace std;
int n, m;
std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B)
{
    n = N;
    m = M;
    std::vector<std::vector<int>> ans(2*n, std::vector<int>(2*n, 0));

    for (int i = 0; i < 2*n; ++ i)
    {
        int val = i+1;
        if(val > n)val = i - n + 1;
        int jj = 1;
        for (int j = 0; j < 2*n; ++ j)
        {

                if(j % 2 == 0)
                    ans[i][j] = val;
                else
                {
                    ans[i][j] = jj;
                    jj ++;
                    if(jj > n)jj = 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...