답안 #792963

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
792963	2023-07-25T11:40:21 Z	LucaIlie	항공 노선도 (JOI18_airline)	C++17	37 / 100	262 ms	7196 KB

Alice
Bob

#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;

    if ( 600 <= n && n <= 1000 )
        exit( 1 );

    for ( int i = 0; i < m; i++ ) {
        if ( 4 <= n && n <= 540 )
            addEdge( n - 1 - a[i], n - 1 - b[i] );
        else
            addEdge( a[i], b[i] );
    }

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

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

    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 );
        }
    }
}

#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];
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 - 3 )
            iden = u;
    }

    for ( int u = 0; u < V; u++ ) {
        if ( u == iden || isEdge[u][iden] )
            continue;
        if ( vec[u] == nrbits - 1 )
            special = u;
        else
            bit[nrbits - 1] = 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 b = nrbits - 1; b >= 1; b-- ) {
        for ( int c: bits ) {
            if ( isEdge[bit[b]][c] && c != bit[b + 1] )
                bit[b - 1] = c;
        }
    }
    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] ) {
                if ( 4 <= n && n <= 540 )
                    MakeMap( n - 1 - val[u], n - 1 - val[v] );
                else
                    MakeMap( val[u], val[v] );
            }
        }
    }
}

Subtask #1
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	4744 KB	Output is correct
2	Correct	2 ms	4744 KB	Output is correct
3	Correct	3 ms	4744 KB	Output is correct
4	Correct	3 ms	4740 KB	Output is correct
5	Correct	2 ms	4740 KB	Output is correct
6	Correct	2 ms	4740 KB	Output is correct
7	Correct	2 ms	4780 KB	Output is correct
8	Correct	2 ms	4764 KB	Output is correct
9	Correct	2 ms	4756 KB	Output is correct
10	Correct	2 ms	4740 KB	Output is correct
11	Correct	2 ms	4744 KB	Output is correct
12	Correct	3 ms	4744 KB	Output is correct
13	Correct	2 ms	4748 KB	Output is correct
14	Correct	2 ms	4724 KB	Output is correct
15	Correct	2 ms	4748 KB	Output is correct
16	Correct	2 ms	4748 KB	Output is correct
17	Correct	2 ms	4744 KB	Output is correct
18	Correct	2 ms	4744 KB	Output is correct
19	Correct	3 ms	4744 KB	Output is correct
20	Correct	2 ms	4752 KB	Output is correct
21	Correct	3 ms	4744 KB	Output is correct
22	Correct	2 ms	4744 KB	Output is correct
23	Correct	2 ms	4668 KB	Output is correct
24	Correct	2 ms	4752 KB	Output is correct
25	Correct	3 ms	4756 KB	Output is correct
26	Correct	3 ms	4744 KB	Output is correct
27	Correct	2 ms	4668 KB	Output is correct
28	Correct	3 ms	4744 KB	Output is correct
29	Correct	3 ms	4748 KB	Output is correct
30	Correct	2 ms	4740 KB	Output is correct
31	Correct	2 ms	4720 KB	Output is correct
32	Correct	2 ms	4740 KB	Output is correct
33	Correct	2 ms	4740 KB	Output is correct
34	Correct	2 ms	4716 KB	Output is correct
35	Correct	2 ms	4740 KB	Output is correct
36	Correct	3 ms	4740 KB	Output is correct
37	Correct	2 ms	4744 KB	Output is correct
38	Correct	2 ms	4744 KB	Output is correct
39	Correct	13 ms	4644 KB	Output is correct
40	Correct	3 ms	4656 KB	Output is correct
41	Correct	3 ms	4748 KB	Output is correct
42	Correct	7 ms	4648 KB	Output is correct
43	Correct	2 ms	4808 KB	Output is correct
44	Correct	2 ms	4740 KB	Output is correct
45	Correct	3 ms	4640 KB	Output is correct
46	Correct	3 ms	4744 KB	Output is correct
47	Correct	7 ms	4904 KB	Output is correct
48	Correct	3 ms	4744 KB	Output is correct
49	Correct	3 ms	4668 KB	Output is correct
50	Correct	2 ms	4740 KB	Output is correct
51	Correct	1 ms	4692 KB	Output is correct
52	Correct	1 ms	4744 KB	Output is correct
53	Correct	2 ms	4752 KB	Output is correct
54	Correct	2 ms	4744 KB	Output is correct
55	Correct	2 ms	4704 KB	Output is correct
56	Correct	2 ms	4744 KB	Output is correct
57	Correct	2 ms	4644 KB	Output is correct
58	Correct	16 ms	4676 KB	Output is correct

Subtask #2
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	4744 KB	Output is correct
2	Correct	2 ms	4744 KB	Output is correct
3	Correct	3 ms	4744 KB	Output is correct
4	Correct	3 ms	4740 KB	Output is correct
5	Correct	2 ms	4740 KB	Output is correct
6	Correct	2 ms	4740 KB	Output is correct
7	Correct	2 ms	4780 KB	Output is correct
8	Correct	2 ms	4764 KB	Output is correct
9	Correct	2 ms	4756 KB	Output is correct
10	Correct	2 ms	4740 KB	Output is correct
11	Correct	2 ms	4744 KB	Output is correct
12	Correct	3 ms	4744 KB	Output is correct
13	Correct	2 ms	4748 KB	Output is correct
14	Correct	2 ms	4724 KB	Output is correct
15	Correct	2 ms	4748 KB	Output is correct
16	Correct	2 ms	4748 KB	Output is correct
17	Correct	2 ms	4744 KB	Output is correct
18	Correct	2 ms	4744 KB	Output is correct
19	Correct	3 ms	4744 KB	Output is correct
20	Correct	2 ms	4752 KB	Output is correct
21	Correct	3 ms	4744 KB	Output is correct
22	Correct	2 ms	4744 KB	Output is correct
23	Correct	2 ms	4668 KB	Output is correct
24	Correct	2 ms	4752 KB	Output is correct
25	Correct	3 ms	4756 KB	Output is correct
26	Correct	3 ms	4744 KB	Output is correct
27	Correct	2 ms	4668 KB	Output is correct
28	Correct	3 ms	4744 KB	Output is correct
29	Correct	3 ms	4748 KB	Output is correct
30	Correct	2 ms	4740 KB	Output is correct
31	Correct	2 ms	4720 KB	Output is correct
32	Correct	2 ms	4740 KB	Output is correct
33	Correct	2 ms	4740 KB	Output is correct
34	Correct	2 ms	4716 KB	Output is correct
35	Correct	2 ms	4740 KB	Output is correct
36	Correct	3 ms	4740 KB	Output is correct
37	Correct	2 ms	4744 KB	Output is correct
38	Correct	2 ms	4744 KB	Output is correct
39	Correct	13 ms	4644 KB	Output is correct
40	Correct	3 ms	4656 KB	Output is correct
41	Correct	3 ms	4748 KB	Output is correct
42	Correct	7 ms	4648 KB	Output is correct
43	Correct	2 ms	4808 KB	Output is correct
44	Correct	2 ms	4740 KB	Output is correct
45	Correct	3 ms	4640 KB	Output is correct
46	Correct	3 ms	4744 KB	Output is correct
47	Correct	7 ms	4904 KB	Output is correct
48	Correct	3 ms	4744 KB	Output is correct
49	Correct	3 ms	4668 KB	Output is correct
50	Correct	2 ms	4740 KB	Output is correct
51	Correct	1 ms	4692 KB	Output is correct
52	Correct	1 ms	4744 KB	Output is correct
53	Correct	2 ms	4752 KB	Output is correct
54	Correct	2 ms	4744 KB	Output is correct
55	Correct	2 ms	4704 KB	Output is correct
56	Correct	2 ms	4744 KB	Output is correct
57	Correct	2 ms	4644 KB	Output is correct
58	Correct	16 ms	4676 KB	Output is correct
59	Correct	3 ms	4880 KB	Output is correct
60	Correct	3 ms	4868 KB	Output is correct
61	Correct	3 ms	4852 KB	Output is correct
62	Correct	11 ms	4876 KB	Output is correct
63	Correct	4 ms	4768 KB	Output is correct
64	Correct	3 ms	4880 KB	Output is correct
65	Correct	3 ms	4768 KB	Output is correct
66	Correct	4 ms	4872 KB	Output is correct
67	Correct	3 ms	4852 KB	Output is correct
68	Correct	2 ms	4872 KB	Output is correct
69	Correct	7 ms	4852 KB	Output is correct
70	Correct	3 ms	4768 KB	Output is correct
71	Correct	3 ms	4804 KB	Output is correct
72	Correct	16 ms	4872 KB	Output is correct
73	Correct	3 ms	4872 KB	Output is correct
74	Correct	8 ms	4908 KB	Output is correct
75	Correct	4 ms	4796 KB	Output is correct
76	Correct	4 ms	4872 KB	Output is correct
77	Correct	13 ms	4852 KB	Output is correct
78	Correct	3 ms	4772 KB	Output is correct
79	Correct	4 ms	4872 KB	Output is correct
80	Correct	3 ms	4848 KB	Output is correct
81	Correct	3 ms	4872 KB	Output is correct
82	Correct	2 ms	4848 KB	Output is correct
83	Correct	3 ms	4772 KB	Output is correct
84	Correct	22 ms	4772 KB	Output is correct
85	Correct	3 ms	4768 KB	Output is correct
86	Correct	2 ms	4880 KB	Output is correct
87	Correct	13 ms	4772 KB	Output is correct
88	Correct	3 ms	4872 KB	Output is correct
89	Correct	2 ms	4868 KB	Output is correct
90	Correct	3 ms	4876 KB	Output is correct
91	Correct	5 ms	4772 KB	Output is correct
92	Correct	18 ms	4888 KB	Output is correct
93	Correct	3 ms	4868 KB	Output is correct
94	Correct	3 ms	4772 KB	Output is correct
95	Correct	3 ms	4772 KB	Output is correct
96	Correct	3 ms	4768 KB	Output is correct
97	Correct	6 ms	4872 KB	Output is correct
98	Correct	5 ms	4872 KB	Output is correct
99	Correct	1 ms	4872 KB	Output is correct
100	Correct	3 ms	4880 KB	Output is correct
101	Correct	2 ms	4768 KB	Output is correct
102	Correct	6 ms	4784 KB	Output is correct
103	Correct	2 ms	4868 KB	Output is correct
104	Correct	3 ms	4796 KB	Output is correct
105	Correct	5 ms	4872 KB	Output is correct
106	Correct	3 ms	4772 KB	Output is correct
107	Correct	3 ms	4768 KB	Output is correct
108	Correct	2 ms	4848 KB	Output is correct
109	Correct	3 ms	4872 KB	Output is correct
110	Correct	2 ms	4792 KB	Output is correct
111	Correct	5 ms	4796 KB	Output is correct
112	Correct	2 ms	4868 KB	Output is correct
113	Correct	2 ms	4872 KB	Output is correct
114	Correct	2 ms	4872 KB	Output is correct
115	Correct	11 ms	4840 KB	Output is correct
116	Correct	3 ms	4760 KB	Output is correct
117	Correct	3 ms	4892 KB	Output is correct
118	Correct	3 ms	4768 KB	Output is correct

Subtask #3
0 / 63.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	262 ms	7196 KB	Execution failed because the return code was nonzero
2	Halted	0 ms	0 KB	-

답안 #792963

Compilation message

Subtask #1 22.0 / 22.0

Subtask #2 15.0 / 15.0

Subtask #3 0 / 63.0

Subtask #1
22.0 / 22.0

Subtask #2
15.0 / 15.0

Subtask #3
0 / 63.0