제출 #1342731

#제출 시각아이디문제언어결과실행 시간메모리
1342731KasymK세계 지도 (IOI25_worldmap)C++20
5 / 100
3 ms580 KiB
#include "bits/stdc++.h"
// #include "grader.cpp"
#include "worldmap.h"
using namespace std;
#define ff first
#define ss second    
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
#define mm make_pair
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}

vector<vector<int>> create_map(int n, int m, vector<int> A, vector<int> B) {
    vector<vector<int>> ans(n, vector<int> (n));
    for(int j = 0; j < n; ++j)
        for(int i = 0; i < n; ++i)
            ans[i][j]=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...