oj.uz

Submission #260384

# Submission time Handle Problem Language Result Execution time Memory
260384 2020-08-10T08:02:55 Z 반딧불(#5056) Airline Route Map (JOI18_airline) C++14
0 / 100
 1148 ms 39768 KB 
#include <bits/stdc++.h>
#include "Alicelib.h"

using namespace std;

typedef long long ll;

namespace AA{
    vector<int> link[1020];
    vector<pair<int, int> > edge;
}
using namespace AA;

void Alice(int N, int M, int A[], int B[]){
    for(int i=0; i<M; i++){ /// original graph
        link[A[i]].push_back(B[i]);
        link[B[i]].push_back(A[i]);
    }
    for(int i=0; i<N+10; i++){ /// vertex X
        link[N+11].push_back(i);
        link[i].push_back(N+11);
    }
    for(int d=0; d<10; d++){ /// vertex d0, d1, ..., d9
        for(int i=0; i<N; i++){
            if(i & (1<<d)) link[i].push_back(N+d), link[N+d].push_back(i);
        }
    }

    for(int i=0; i<10; i++){
        link[N+i].push_back(N+10);
        link[N+10].push_back(N+i);
    }

    for(int i=0; i<9; i++){
        link[N+i].push_back(N+i+1);
        link[N+i+1].push_back(N+i);
    }

    for(int i=0; i<N+12; i++){
        for(auto &j: link[i]){
            if(i < j) edge.push_back(make_pair(i, j));
        }
    }

    InitG(N+12, (int)edge.size());
    int cnt = 0;
    for(auto &x: edge){
        MakeG(cnt++, x.first, x.second);
    }
}

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

using namespace std;

typedef long long ll;

namespace BB{
    int n, m;
    int idx[1020];
    vector<int> glink[1020];
    vector<int> link[1002];

    int vertexX, vertexY;
    int vertexD[10];
    vector<int> specialVertices;
    bool isSpecial[1020];
    int specialDegree[1020];

    vector<int> specialLink[1020];

    vector<pair<int, int> > edge;
}
using namespace BB;

void Bob(int V, int U, int C[], int D[]){
    n = V-12;
    for(int i=0; i<U; i++){
        glink[C[i]].push_back(D[i]);
        glink[D[i]].push_back(C[i]);
    }

    for(int i=0; i<V; i++){
        if((int)glink[i].size() == n+10){
            vertexX = i;

            for(int j=0; j<V; j++) isSpecial[j] = 1;
            isSpecial[i] = 0;
            for(auto &x: glink[i]) isSpecial[x] = 0;

            for(int j=0; j<V; j++){
                if(isSpecial[j]) specialVertices.push_back(j);
            }
            vertexY = specialVertices[0];
            isSpecial[vertexY] = 0;

            specialVertices.clear();
            for(auto &x: glink[vertexY]){
                specialVertices.push_back(x);
                isSpecial[x] = 1;
            }
            break;
        }
    }

    int onedeg = 0;
    for(auto &x: specialVertices){
        for(auto &y: glink[x]){
            if(isSpecial[y]){
                specialDegree[x]++;
                specialLink[x].push_back(y);
                specialLink[y].push_back(x);
            }
        }
        if(specialDegree[x] == 1) onedeg = max(onedeg, (int)glink[x].size());
    }
    for(auto &x: specialVertices){
        if(specialDegree[x] == 1 && onedeg == (int)glink[x].size()){
            vertexD[0] = x;
            specialDegree[x] = 0;

            int tmp = x, prv = 0;
            for(int i=1; i<10; i++){
                for(auto &y: specialLink[tmp]){
                    if(prv == y) continue;
                    prv = tmp;
                    vertexD[i] = tmp = y;
                    specialDegree[y] = i;
                    break;
                }
            }
            break;
        }
    }

    for(int i=0; i<V; i++){
        if(isSpecial[i] || i == vertexX || i == vertexY) continue;

        for(auto &x: glink[i]){
            if(isSpecial[x]) idx[i] += 1 << specialDegree[x];
        }
    }

    for(int i=0; i<V; i++){
        if(isSpecial[i] || i == vertexX || i == vertexY) continue;

        for(auto &x: glink[i]){
            if(!isSpecial[x] && x != vertexX){
                link[idx[i]].push_back(idx[x]);
            }
        }
    }

    for(int i=0; i<n; i++){
        for(auto &x: link[i]){
            if(i < x){
                edge.push_back(make_pair(i, x));
            }
        }
    }

    InitMap(n, (int)edge.size());
    for(auto &x: edge){
        MakeMap(x.first, x.second);
    }
}

Subtask #1
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 6912 KB Output is correct
2 Correct 5 ms 6912 KB Output is correct
3 Correct 5 ms 6912 KB Output is correct
4 Correct 5 ms 6912 KB Output is correct
5 Correct 5 ms 6912 KB Output is correct
6 Correct 5 ms 6912 KB Output is correct
7 Correct 5 ms 6912 KB Output is correct
8 Correct 6 ms 6912 KB Output is correct
9 Correct 5 ms 6912 KB Output is correct
10 Correct 5 ms 6912 KB Output is correct
11 Correct 5 ms 6912 KB Output is correct
12 Correct 5 ms 6912 KB Output is correct
13 Correct 6 ms 6912 KB Output is correct
14 Correct 5 ms 6912 KB Output is correct
15 Correct 5 ms 6912 KB Output is correct
16 Correct 6 ms 7168 KB Output is correct
17 Correct 5 ms 6912 KB Output is correct
18 Correct 5 ms 6912 KB Output is correct
19 Correct 5 ms 6912 KB Output is correct
20 Correct 5 ms 6912 KB Output is correct
21 Correct 5 ms 6912 KB Output is correct
22 Incorrect 6 ms 6912 KB Wrong Answer [11]
23 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 6912 KB Output is correct
2 Correct 5 ms 6912 KB Output is correct
3 Correct 5 ms 6912 KB Output is correct
4 Correct 5 ms 6912 KB Output is correct
5 Correct 5 ms 6912 KB Output is correct
6 Correct 5 ms 6912 KB Output is correct
7 Correct 5 ms 6912 KB Output is correct
8 Correct 6 ms 6912 KB Output is correct
9 Correct 5 ms 6912 KB Output is correct
10 Correct 5 ms 6912 KB Output is correct
11 Correct 5 ms 6912 KB Output is correct
12 Correct 5 ms 6912 KB Output is correct
13 Correct 6 ms 6912 KB Output is correct
14 Correct 5 ms 6912 KB Output is correct
15 Correct 5 ms 6912 KB Output is correct
16 Correct 6 ms 7168 KB Output is correct
17 Correct 5 ms 6912 KB Output is correct
18 Correct 5 ms 6912 KB Output is correct
19 Correct 5 ms 6912 KB Output is correct
20 Correct 5 ms 6912 KB Output is correct
21 Correct 5 ms 6912 KB Output is correct
22 Incorrect 6 ms 6912 KB Wrong Answer [11]
23 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 709 ms 39128 KB Output is correct : V - N = 12
2 Correct 559 ms 34408 KB Output is correct : V - N = 12
3 Correct 346 ms 18992 KB Output is correct : V - N = 12
4 Correct 14 ms 7680 KB Output is correct : V - N = 12
5 Correct 149 ms 13984 KB Output is correct : V - N = 12
6 Correct 586 ms 32404 KB Output is correct : V - N = 12
7 Correct 675 ms 39088 KB Output is correct : V - N = 12
8 Correct 604 ms 37000 KB Output is correct : V - N = 12
9 Correct 498 ms 22312 KB Output is correct : V - N = 12
10 Correct 37 ms 9216 KB Output is correct : V - N = 12
11 Correct 72 ms 10664 KB Output is correct : V - N = 12
12 Correct 408 ms 25760 KB Output is correct : V - N = 12
13 Correct 875 ms 38248 KB Output is correct : V - N = 12
14 Correct 1148 ms 39112 KB Output is correct : V - N = 12
15 Correct 408 ms 31192 KB Output is correct : V - N = 12
16 Correct 170 ms 12112 KB Output is correct : V - N = 12
17 Correct 31 ms 8440 KB Output is correct : V - N = 12
18 Correct 246 ms 20584 KB Output is correct : V - N = 12
19 Correct 670 ms 35752 KB Output is correct : V - N = 12
20 Correct 1073 ms 39768 KB Output is correct : V - N = 12
21 Correct 216 ms 18184 KB Output is correct : V - N = 12
22 Correct 150 ms 14696 KB Output is correct : V - N = 12
23 Correct 71 ms 10464 KB Output is correct : V - N = 12
24 Correct 11 ms 7168 KB Output is correct : V - N = 12
25 Correct 43 ms 9168 KB Output is correct : V - N = 12
26 Correct 123 ms 13776 KB Output is correct : V - N = 12
27 Correct 181 ms 15736 KB Output is correct : V - N = 12
28 Correct 168 ms 15136 KB Output is correct : V - N = 12
29 Correct 151 ms 11320 KB Output is correct : V - N = 12
30 Correct 13 ms 7928 KB Output is correct : V - N = 12
31 Correct 12 ms 7424 KB Output is correct : V - N = 12
32 Correct 12 ms 7424 KB Output is correct : V - N = 12
33 Correct 13 ms 7424 KB Output is correct : V - N = 12
34 Correct 12 ms 7424 KB Output is correct : V - N = 12
35 Correct 12 ms 7424 KB Output is correct : V - N = 12
36 Correct 681 ms 39120 KB Output is correct : V - N = 12
37 Correct 784 ms 39264 KB Output is correct : V - N = 12
38 Correct 681 ms 39256 KB Output is correct : V - N = 12
39 Correct 713 ms 39128 KB Output is correct : V - N = 12
40 Correct 742 ms 39128 KB Output is correct : V - N = 12
41 Correct 205 ms 13608 KB Output is correct : V - N = 12
42 Correct 157 ms 12656 KB Output is correct : V - N = 12
43 Correct 147 ms 13448 KB Output is correct : V - N = 12
44 Correct 16 ms 7424 KB Output is correct : V - N = 12
45 Correct 74 ms 10800 KB Output is correct : V - N = 12
46 Correct 252 ms 19616 KB Output is correct : V - N = 12
47 Correct 163 ms 13832 KB Output is correct : V - N = 12
48 Correct 317 ms 22272 KB Output is correct : V - N = 12
49 Correct 74 ms 10416 KB Output is correct : V - N = 12
50 Correct 23 ms 8544 KB Output is correct : V - N = 12
51 Correct 540 ms 34436 KB Output is correct : V - N = 12
52 Correct 14 ms 7680 KB Output is correct : V - N = 12
53 Correct 500 ms 32516 KB Output is correct : V - N = 12
54 Correct 600 ms 36360 KB Output is correct : V - N = 12
55 Correct 44 ms 9200 KB Output is correct : V - N = 12
56 Correct 360 ms 24928 KB Output is correct : V - N = 12
57 Correct 652 ms 38072 KB Output is correct : V - N = 12
58 Correct 98 ms 12008 KB Output is correct : V - N = 12
59 Correct 265 ms 20416 KB Output is correct : V - N = 12
60 Correct 694 ms 38600 KB Output is correct : V - N = 12
61 Correct 6 ms 6912 KB Output is correct : V - N = 12
62 Correct 5 ms 6912 KB Output is correct : V - N = 12
63 Correct 5 ms 6912 KB Output is correct : V - N = 12
64 Correct 5 ms 6912 KB Output is correct : V - N = 12
65 Correct 5 ms 6912 KB Output is correct : V - N = 12
66 Correct 6 ms 6912 KB Output is correct : V - N = 12
67 Correct 6 ms 6912 KB Output is correct : V - N = 12
68 Correct 7 ms 6912 KB Output is correct : V - N = 12
69 Correct 6 ms 6912 KB Output is correct : V - N = 12
70 Correct 5 ms 6912 KB Output is correct : V - N = 12
71 Correct 6 ms 6912 KB Output is correct : V - N = 12
72 Correct 5 ms 6912 KB Output is correct : V - N = 12
73 Correct 6 ms 6912 KB Output is correct : V - N = 12
74 Correct 6 ms 6976 KB Output is correct : V - N = 12
75 Correct 6 ms 6912 KB Output is correct : V - N = 12
76 Correct 6 ms 6912 KB Output is correct : V - N = 12
77 Correct 5 ms 6912 KB Output is correct : V - N = 12
78 Correct 5 ms 6912 KB Output is correct : V - N = 12
79 Correct 6 ms 6912 KB Output is correct : V - N = 12
80 Correct 7 ms 6912 KB Output is correct : V - N = 12
81 Correct 6 ms 6912 KB Output is correct : V - N = 12
82 Correct 6 ms 7168 KB Output is correct : V - N = 12
83 Correct 5 ms 6912 KB Output is correct : V - N = 12
84 Correct 5 ms 6912 KB Output is correct : V - N = 12
85 Correct 6 ms 6912 KB Output is correct : V - N = 12
86 Correct 6 ms 6912 KB Output is correct : V - N = 12
87 Correct 7 ms 6912 KB Output is correct : V - N = 12
88 Correct 6 ms 6912 KB Output is correct : V - N = 12
89 Correct 6 ms 6912 KB Output is correct : V - N = 12
90 Incorrect 5 ms 6912 KB Wrong Answer [11]
91 Halted 0 ms 0 KB -