oj.uz

Submission #792858

# Submission time Handle Problem Language Result Execution time Memory
792858 2023-07-25T10:00:03 Z LucaIlie Airline Route Map (JOI18_airline) C++17
37 / 100
 430 ms 20564 KB 
#include "Alicelib.h"
#include <bits/stdc++.h>
 
using namespace std;
 
bool isMapEdge[2000][2000];
 
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 + 12;
 
    for ( int i = 0; i < m; i++ )
        addEdge( a[i], b[i] );
 
    int iden = n + 10, special = n + 11;
    for ( int u = 0; u < n + 9; u++ )
        addEdge( iden, u );
 
    for ( int u = n; u < n + 10; u++ )
        addEdge( special, u );
    for ( int u = n; u < n + 9; u++ )
        addEdge( u, u + 1 );
 
    for ( int u = 0; u < n; u++ ) {
        for ( int b = 0; b < 10; 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;
 
bool isEdge[2000][2000], isNode[2000];
int bit[10], val[2000], vec[2000];
vector<int> bits;
 
void Bob( int V, int E, int a[], int b[] ){
    int n = V - 12;
 
    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;
        E -= vec[u];
    }
    for ( int u = 0; u < V; u++ ) {
        if ( u == iden || isEdge[u][iden] )
            continue;
        if ( vec[u] == 10 )
            special = u;
        else
            bit[9] = 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 = 9; 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 < 10; 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.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4656 KB Output is correct
2 Correct 2 ms 4784 KB Output is correct
3 Correct 2 ms 4768 KB Output is correct
4 Correct 4 ms 4736 KB Output is correct
5 Correct 3 ms 4744 KB Output is correct
6 Correct 2 ms 4744 KB Output is correct
7 Correct 2 ms 4740 KB Output is correct
8 Correct 2 ms 4744 KB Output is correct
9 Correct 2 ms 4744 KB Output is correct
10 Correct 2 ms 4740 KB Output is correct
11 Correct 2 ms 4668 KB Output is correct
12 Correct 3 ms 4740 KB Output is correct
13 Correct 2 ms 4744 KB Output is correct
14 Correct 3 ms 4740 KB Output is correct
15 Correct 2 ms 4744 KB Output is correct
16 Correct 2 ms 4744 KB Output is correct
17 Correct 2 ms 4744 KB Output is correct
18 Correct 2 ms 4736 KB Output is correct
19 Correct 2 ms 4744 KB Output is correct
20 Correct 3 ms 4748 KB Output is correct
21 Correct 2 ms 4748 KB Output is correct
22 Correct 2 ms 4668 KB Output is correct
23 Correct 3 ms 4744 KB Output is correct
24 Correct 3 ms 4740 KB Output is correct
25 Correct 2 ms 4744 KB Output is correct
26 Correct 2 ms 4744 KB Output is correct
27 Correct 3 ms 4756 KB Output is correct
28 Correct 2 ms 4752 KB Output is correct
29 Correct 1 ms 4744 KB Output is correct
30 Correct 2 ms 4740 KB Output is correct
31 Correct 3 ms 4660 KB Output is correct
32 Correct 3 ms 4724 KB Output is correct
33 Correct 3 ms 4740 KB Output is correct
34 Correct 2 ms 4740 KB Output is correct
35 Correct 1 ms 4668 KB Output is correct
36 Correct 2 ms 4744 KB Output is correct
37 Correct 3 ms 4744 KB Output is correct
38 Correct 2 ms 4752 KB Output is correct
39 Correct 3 ms 4744 KB Output is correct
40 Correct 3 ms 4748 KB Output is correct
41 Correct 2 ms 4740 KB Output is correct
42 Correct 2 ms 4744 KB Output is correct
43 Correct 2 ms 4728 KB Output is correct
44 Correct 3 ms 4680 KB Output is correct
45 Correct 2 ms 4740 KB Output is correct
46 Correct 3 ms 4740 KB Output is correct
47 Correct 1 ms 4744 KB Output is correct
48 Correct 3 ms 4744 KB Output is correct
49 Correct 3 ms 4816 KB Output is correct
50 Correct 2 ms 4644 KB Output is correct
51 Correct 2 ms 4740 KB Output is correct
52 Correct 3 ms 4744 KB Output is correct
53 Correct 1 ms 4740 KB Output is correct
54 Correct 3 ms 4664 KB Output is correct
55 Correct 2 ms 4668 KB Output is correct
56 Correct 2 ms 4744 KB Output is correct
57 Correct 2 ms 4744 KB Output is correct
58 Correct 3 ms 4720 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4656 KB Output is correct
2 Correct 2 ms 4784 KB Output is correct
3 Correct 2 ms 4768 KB Output is correct
4 Correct 4 ms 4736 KB Output is correct
5 Correct 3 ms 4744 KB Output is correct
6 Correct 2 ms 4744 KB Output is correct
7 Correct 2 ms 4740 KB Output is correct
8 Correct 2 ms 4744 KB Output is correct
9 Correct 2 ms 4744 KB Output is correct
10 Correct 2 ms 4740 KB Output is correct
11 Correct 2 ms 4668 KB Output is correct
12 Correct 3 ms 4740 KB Output is correct
13 Correct 2 ms 4744 KB Output is correct
14 Correct 3 ms 4740 KB Output is correct
15 Correct 2 ms 4744 KB Output is correct
16 Correct 2 ms 4744 KB Output is correct
17 Correct 2 ms 4744 KB Output is correct
18 Correct 2 ms 4736 KB Output is correct
19 Correct 2 ms 4744 KB Output is correct
20 Correct 3 ms 4748 KB Output is correct
21 Correct 2 ms 4748 KB Output is correct
22 Correct 2 ms 4668 KB Output is correct
23 Correct 3 ms 4744 KB Output is correct
24 Correct 3 ms 4740 KB Output is correct
25 Correct 2 ms 4744 KB Output is correct
26 Correct 2 ms 4744 KB Output is correct
27 Correct 3 ms 4756 KB Output is correct
28 Correct 2 ms 4752 KB Output is correct
29 Correct 1 ms 4744 KB Output is correct
30 Correct 2 ms 4740 KB Output is correct
31 Correct 3 ms 4660 KB Output is correct
32 Correct 3 ms 4724 KB Output is correct
33 Correct 3 ms 4740 KB Output is correct
34 Correct 2 ms 4740 KB Output is correct
35 Correct 1 ms 4668 KB Output is correct
36 Correct 2 ms 4744 KB Output is correct
37 Correct 3 ms 4744 KB Output is correct
38 Correct 2 ms 4752 KB Output is correct
39 Correct 3 ms 4744 KB Output is correct
40 Correct 3 ms 4748 KB Output is correct
41 Correct 2 ms 4740 KB Output is correct
42 Correct 2 ms 4744 KB Output is correct
43 Correct 2 ms 4728 KB Output is correct
44 Correct 3 ms 4680 KB Output is correct
45 Correct 2 ms 4740 KB Output is correct
46 Correct 3 ms 4740 KB Output is correct
47 Correct 1 ms 4744 KB Output is correct
48 Correct 3 ms 4744 KB Output is correct
49 Correct 3 ms 4816 KB Output is correct
50 Correct 2 ms 4644 KB Output is correct
51 Correct 2 ms 4740 KB Output is correct
52 Correct 3 ms 4744 KB Output is correct
53 Correct 1 ms 4740 KB Output is correct
54 Correct 3 ms 4664 KB Output is correct
55 Correct 2 ms 4668 KB Output is correct
56 Correct 2 ms 4744 KB Output is correct
57 Correct 2 ms 4744 KB Output is correct
58 Correct 3 ms 4720 KB Output is correct
59 Correct 3 ms 4880 KB Output is correct
60 Correct 3 ms 4872 KB Output is correct
61 Correct 3 ms 4768 KB Output is correct
62 Correct 3 ms 4892 KB Output is correct
63 Correct 2 ms 4896 KB Output is correct
64 Correct 2 ms 4772 KB Output is correct
65 Correct 2 ms 4872 KB Output is correct
66 Correct 3 ms 4872 KB Output is correct
67 Correct 2 ms 4876 KB Output is correct
68 Correct 2 ms 4880 KB Output is correct
69 Correct 2 ms 4856 KB Output is correct
70 Correct 2 ms 4872 KB Output is correct
71 Correct 3 ms 4872 KB Output is correct
72 Correct 3 ms 4880 KB Output is correct
73 Correct 2 ms 4872 KB Output is correct
74 Correct 2 ms 4852 KB Output is correct
75 Correct 2 ms 4872 KB Output is correct
76 Correct 2 ms 4868 KB Output is correct
77 Correct 3 ms 4872 KB Output is correct
78 Correct 3 ms 4808 KB Output is correct
79 Correct 2 ms 4848 KB Output is correct
80 Correct 2 ms 4872 KB Output is correct
81 Correct 2 ms 4880 KB Output is correct
82 Correct 3 ms 4872 KB Output is correct
83 Correct 2 ms 4872 KB Output is correct
84 Correct 2 ms 4880 KB Output is correct
85 Correct 2 ms 4872 KB Output is correct
86 Correct 3 ms 4872 KB Output is correct
87 Correct 2 ms 4872 KB Output is correct
88 Correct 2 ms 4880 KB Output is correct
89 Correct 3 ms 4868 KB Output is correct
90 Correct 2 ms 4868 KB Output is correct
91 Correct 2 ms 4868 KB Output is correct
92 Correct 2 ms 4864 KB Output is correct
93 Correct 3 ms 4768 KB Output is correct
94 Correct 3 ms 4924 KB Output is correct
95 Correct 3 ms 4772 KB Output is correct
96 Correct 3 ms 4880 KB Output is correct
97 Correct 3 ms 4872 KB Output is correct
98 Correct 3 ms 4904 KB Output is correct
99 Correct 3 ms 4792 KB Output is correct
100 Correct 2 ms 4872 KB Output is correct
101 Correct 3 ms 4860 KB Output is correct
102 Correct 3 ms 4872 KB Output is correct
103 Correct 3 ms 4872 KB Output is correct
104 Correct 3 ms 4876 KB Output is correct
105 Correct 2 ms 4872 KB Output is correct
106 Correct 3 ms 4772 KB Output is correct
107 Correct 2 ms 4880 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 4848 KB Output is correct
111 Correct 3 ms 4872 KB Output is correct
112 Correct 3 ms 4872 KB Output is correct
113 Correct 2 ms 4848 KB Output is correct
114 Correct 2 ms 4768 KB Output is correct
115 Correct 3 ms 4880 KB Output is correct
116 Correct 2 ms 4772 KB Output is correct
117 Correct 2 ms 4872 KB Output is correct
118 Correct 2 ms 4872 KB Output is correct

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Incorrect 430 ms 20564 KB Wrong Answer [12]
2 Halted 0 ms 0 KB -