제출 #1263014

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1263014		vtnoo	World Map (IOI25_worldmap)	C++20	15 / 100	153 ms	18604 KiB

worldmap

#include <bits/stdc++.h>

using namespace std;

const int K=240;
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));
    vector<pair<int,int>> ed;
    for(int i=0;i<M;i++){
        if(A[i]!=1&&B[i]!=1){
            ed.push_back({A[i], B[i]});
        }
    }
    int cur=0;
    for(int i=0;i<K;i+=2){
        g[i][0]=(cur%N)+1;
        cur++;
    }
    int e=0;
    for(int j=2;j<K;j+=2){
        for(int i=0;i+1<K&&e<(int)ed.size();i+=3){
            g[i][j]=ed[e].first;
            g[i+1][j]=ed[e].second;
            e++;
        }
    }
    for(int i=0;i<K;i++){
        for(int j=0;j<K;j++){
            if(g[i][j]==-1){
                g[i][j]=1;
            }
        }
    }
    return g;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 7 / 7
• Subtask 4: 8 / 8
• Subtask 5: 0 / 14
• Subtask 6: 0 / 56