Submission #1347216

#TimeUsernameProblemLanguageResultExecution timeMemory
1347216orgiloogii세계 지도 (IOI25_worldmap)C++20
0 / 100
22 ms4808 KiB
#include "worldmap.h"
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> create_map(int n, int m, vector<int> a, vector<int> b) {
    int k = 4 * n;
    if (m == n * (n - 1) / 2) {
        vector<vector<int>> ans(k, vector<int>(k, 1));
        for (int i = 0;i < 2 * n;i += 2) {
            for (int j = 0;j < n;j++) {
                ans[i][j] = i + 1;
            }
            for (int j = 0;j < n;j++) {
                ans[i + 1][j] = j + 1;
            }
        }
        return ans;
    }
    vector<vector<int>> ans(k, vector<int>(k, 0));
    int cnt[n + 1] = {0};
    vector <pair <int, int>> v;
    for (int i = 0;i < m;i++) {
        cnt[a[i]]++;
        cnt[b[i]]++;
    }
    for (int i = 1;i <= n;i++) {
        v.push_back({cnt[i], i});
    }
    sort(v.begin(), v.end());
    for (int i = 0;i < k;i++) {
        for (int j = 0;j < k;j++) {
            ans[i][j] = min((max(i, j) + 1), n);
        }
    }
    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...