제출 #793989

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
793989		LucaIlie	항공 노선도 (JOI18_airline)	C++17	100 / 100	475 ms	20604 KiB

Alice

#include "Alicelib.h"
#include <bits/stdc++.h>

using namespace std;

bool isMapEdge[2000][2000];
const int nrbits = 10;

void addEdge( int u, int v ) {
    isMapEdge[u][v] = isMapEdge[v][u] = true;
}

void Alice( int n, int m, int a[], int b[] ){
    int V = n + nrbits + 2;

    for ( int i = 0; i < m; i++ )
        addEdge( a[i], b[i] );

    int iden = n + nrbits, special = n + nrbits + 1;
    for ( int u = 0; u < n + nrbits; u++ )
        addEdge( iden, u );
    for ( int u = n; u < n + nrbits; u++ )
        addEdge( special, u );
    for ( int u = n; u < n + nrbits - 1; u++ )
        addEdge( u, u + 1 );
    addEdge( n + 1, n + 3 );

    for ( int u = 0; u < n; u++ ) {
        for ( int b = 0; b < nrbits; b++ ) {
            if ( (u >> b) & 1 )
                addEdge( u, n + b );
        }
    }

    int E = 0;
    for ( int u = 0; u < V; u++ ) {
        for ( int v = u + 1; v < V; v++ ) {
            if ( isMapEdge[u][v] )
                E++;
        }
    }
    InitG( V, E );
    int e = 0;
    for ( int u = 0; u < V; u++ ) {
        for ( int v = u + 1; v < V; v++ ) {
            if ( isMapEdge[u][v] )
                MakeG( e++, u, v );
        }
    }
}

Bob

#include "Boblib.h"
#include <bits/stdc++.h>

using namespace std;

const int nrbits = 10;
bool isEdge[2000][2000], isNode[2000];
int bit[20], val[2000], vec[2000], bitvec[2000];
vector<int> bits;

void Bob( int V, int E, int a[], int b[] ){
    int n = V - nrbits - 2;

    for ( int i = 0; i < E; i++ )
        isEdge[a[i]][b[i]] = isEdge[b[i]][a[i]] = true;

    int iden = -1, special = -1;
    for ( int u = 0; u < V; u++ ) {
        for ( int v = 0; v < V; v++ )
            vec[u] += isEdge[u][v];
        if ( vec[u] == V - 2 )
            iden = u;
    }

    for ( int u = 0; u < V; u++ ) {
        if ( u == iden || isEdge[u][iden] )
            continue;
        special = u;
    }
    for ( int u = 0; u < V; u++ )
        isNode[u] = true;
    isNode[special] = isNode[iden] = false;
    for ( int u = 0; u < V; u++ ) {
        if ( isEdge[special][u] ) {
            bits.push_back( u );
            isNode[u] = false;
        }
    }
    for ( int u: bits ) {
        for ( int v: bits ) {
            if ( isEdge[u][v] )
                bitvec[u]++;
        }
    }
    for ( int u: bits ) {
        if ( bitvec[u] != 3 )
            continue;
        for ( int v: bits ) {
            if ( isEdge[u][v] && bitvec[v] == 1 )
                bit[0] = v;
        }
    }
    for ( int u: bits ) {
        for ( int v: bits ) {
            if ( bitvec[u] == 3 && bitvec[v] == 3 )
                isEdge[u][v] = isEdge[v][u] = false;
        }
    }
    for ( int b = 0; b < nrbits - 1; b++ ) {
        for ( int u: bits ) {
            if ( isEdge[bit[b]][u] && (b == 0 || u != bit[b - 1]) )
                bit[b + 1] = u;
        }
    }
    for ( int u = 0; u < V; u++ ) {
        if ( !isNode[u] )
            continue;
        val[u] = 0;
        for ( int b = 0; b < nrbits; b++ )
            val[u] += (isEdge[u][bit[b]] << b);
    }

    int m = 0;
    for ( int u = 0; u < V; u++ ) {
        for ( int v = u + 1; v < V; v++ ) {
            if ( isNode[u] && isNode[v] && isEdge[u][v] )
                m++;
        }
    }
    InitMap( n, m );
    for ( int u = 0; u < V; u++ ) {
        for ( int v = u + 1; v < V; v++ ) {
            if ( isNode[u] && isNode[v] && isEdge[u][v] )
                MakeMap( val[u], val[v] );
        }
    }
}

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