Submission #1259776

#	Time	Username	Problem	Language	Result	Execution time	Memory
1259776		aritro_	World Map (IOI25_worldmap)	C++20	15 / 100	15 ms	2116 KiB

worldmap

#include<bits/stdc++.h>
#include "worldmap.h"
using namespace std;

typedef long long ll;
#define int ll
#define endl '\n'
#define pb push_back
#define ff first
#define ss second
#define all(a) a.begin(),a.end()

const int MOD=1000000007;

#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*(b/gcd(a,b)))

#define fios(); ios_base::sync_with_stdio(0);cin.tie(0);
#define fraction(x); cout.unsetf(ios::floatfield); cout.precision(x); cout.setf(ios::fixed,ios::floatfield);
#define file(); freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);

vector<vector<int32_t>> create_map(int32_t n, int32_t m,vector<int32_t> a, vector<int32_t> b){
    if(n==1){
        vector<vector<int32_t>> ans(1,vector<int32_t>(1));
        ans[0][0]=1;
        return ans;
    }
    vector<vector<int32_t>> ans((n-1)*2,vector<int32_t>((n-1)*2));
    vector<vector<int>>graph(n+1);
    for(int i=0;i<m;i++){
        graph[a[i]].pb(b[i]);
    }
    int cur=2;
    for(int i=0;i<((n-1)*2);i++){
        if(i%2==0){
            for(int j=0;j<((n-1)*2);j++){
                ans[i][j]=1;
            }
        }else{
            for(int j=0;j<((n-1)*2);j++){
                if(cur==0) continue;
                ans[i][j]=cur;
            }
            cur++;
        }
    }
    for(int i=1;i<n;i++){
        int col=i*2;
        col--;
        int ind=1;
        for(auto u:graph[i+1]){
            if(u==0) continue;
            ans[col][ind]=u;
            ind+=2;
        }
    }
    return ans;
}

• 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