제출 #1186574

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1186574		MarwenElarbi	항공 노선도 (JOI18_airline)	C++20	0 / 100	42 ms	16980 KiB

Alice

#include "Alicelib.h"
#include <cassert>
#include <cstdio>
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
void Alice( int N, int M, int A[], int B[] ){
    vector<int> tab(1500);
    for (int i = 0; i < 1500; ++i) tab[i]=-1;
    int grid[40][40];
    memset(grid,0,sizeof grid);
    for (int i = 0; i < M; ++i)
    {
        grid[A[i]][B[i]]=1;
    }
    int k=1;
    vector<int> ans;
    vector<int> bans;
    for (int i = 0; i < N; ++i)
    {
        for (int j = i; j < N; ++j)
        {
            if(grid[i][j]) 
                {
                    for (int t = 0; t < k; ++t)
                    {
                        ans.pb(k);
                    }
                }
            k++;
        }
    }
    InitG( 1500, ans.size());
    int cnt=1499;
    for (int i = 0; i < ans.size(); ++i)
    {
        MakeG(i,ans[i],cnt--);
    }
}

Bob

#include "Boblib.h"
#include <cassert>
#include <cstdio>
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
void Bob( int V, int U, int C[], int D[] ){
    map<int,int> mp;
    for (int i = 0; i < U; ++i)
    {
        mp[C[i]]++;
        mp[D[i]]++;
    }
    int k=1;
    vector<pair<int,int>> tab(2e6);
    for (int i = 0; i < V; ++i)
    {
        for (int j = i; j < V; ++j)
        {
            tab[k]={i,j};
            k++;
        }
    }
    int n=0;
    vector<pair<int,int>> edges;
    for(auto u:mp){
        if(u.se==1) continue;
        n=max(tab[u.se].fi,n);
        n=max(tab[u.se].se,n);
        if(tab[u.se].fi!=tab[u.se].se) edges.pb({tab[u.se].fi,tab[u.se].se});
    }
    InitMap(n+1,edges.size());
    for (int i = 0; i < edges.size(); ++i)
    {
        MakeMap(edges[i].fi,edges[i].se);
    }
}

• Subtask 1: 0 / 22
• Subtask 2: 0 / 15
• Subtask 3: 0 / 63