oj.uz

답안 #260413

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
260413 2020-08-10T08:37:53 Z 반딧불(#5056) 항공 노선도 (JOI18_airline) C++14
22 / 100
 810 ms 39664 KB 
#include <bits/stdc++.h>
#include "Alicelib.h"

using namespace std;

typedef long long ll;

namespace AA{
    vector<int> link[2020];
    vector<pair<int, int> > edge;
    int cnt = 1;
}
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){
//        printf("%d %d\n", x.first, x.second);
        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[2020];
    vector<int> glink[2020];
    vector<int> link[2002];

    int vertexX = -1, vertexY = -1;
    int vertexD[20];
    vector<int> specialVertices;
    bool isSpecial[2020];
    int specialDegree[2020];

    vector<int> specialLink[2020];

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

void Bob(int V, int U, int C[], int D[]){
    n = V-12;
    if(n==1){
        InitMap(1, 0);
        return;
    }

    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;
            }
            assert(specialVertices.size() == 10);
            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++){
                vertexD[i] = -1;
                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 && x != vertexY){
                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
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 6912 KB Output is correct
2 Correct 5 ms 7168 KB Output is correct
3 Correct 6 ms 7168 KB Output is correct
4 Correct 5 ms 6912 KB Output is correct
5 Correct 6 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 7 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 5 ms 6912 KB Output is correct
14 Correct 5 ms 6912 KB Output is correct
15 Correct 6 ms 6912 KB Output is correct
16 Correct 6 ms 6912 KB Output is correct
17 Correct 5 ms 6912 KB Output is correct
18 Correct 7 ms 6912 KB Output is correct
19 Correct 6 ms 6912 KB Output is correct
20 Correct 6 ms 6912 KB Output is correct
21 Correct 5 ms 6912 KB Output is correct
22 Correct 5 ms 6912 KB Output is correct
23 Correct 6 ms 6912 KB Output is correct
24 Correct 7 ms 6912 KB Output is correct
25 Correct 6 ms 6912 KB Output is correct
26 Correct 6 ms 7168 KB Output is correct
27 Correct 5 ms 6912 KB Output is correct
28 Correct 5 ms 6912 KB Output is correct
29 Correct 5 ms 6912 KB Output is correct
30 Correct 5 ms 6912 KB Output is correct
31 Correct 5 ms 6912 KB Output is correct
32 Correct 6 ms 6912 KB Output is correct
33 Correct 5 ms 6912 KB Output is correct
34 Correct 5 ms 6912 KB Output is correct
35 Correct 5 ms 6912 KB Output is correct
36 Correct 5 ms 6912 KB Output is correct
37 Correct 5 ms 6912 KB Output is correct
38 Correct 5 ms 6912 KB Output is correct
39 Correct 5 ms 6912 KB Output is correct
40 Correct 5 ms 6912 KB Output is correct
41 Correct 5 ms 6912 KB Output is correct
42 Correct 5 ms 6912 KB Output is correct
43 Correct 5 ms 6912 KB Output is correct
44 Correct 5 ms 6912 KB Output is correct
45 Correct 5 ms 6912 KB Output is correct
46 Correct 5 ms 6912 KB Output is correct
47 Correct 5 ms 6912 KB Output is correct
48 Correct 6 ms 6912 KB Output is correct
49 Correct 5 ms 6912 KB Output is correct
50 Correct 5 ms 6912 KB Output is correct
51 Correct 5 ms 6912 KB Output is correct
52 Correct 5 ms 6912 KB Output is correct
53 Correct 5 ms 6912 KB Output is correct
54 Correct 5 ms 6912 KB Output is correct
55 Correct 6 ms 6912 KB Output is correct
56 Correct 5 ms 6912 KB Output is correct
57 Correct 7 ms 6912 KB Output is correct
58 Correct 5 ms 6912 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 6912 KB Output is correct
2 Correct 5 ms 7168 KB Output is correct
3 Correct 6 ms 7168 KB Output is correct
4 Correct 5 ms 6912 KB Output is correct
5 Correct 6 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 7 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 5 ms 6912 KB Output is correct
14 Correct 5 ms 6912 KB Output is correct
15 Correct 6 ms 6912 KB Output is correct
16 Correct 6 ms 6912 KB Output is correct
17 Correct 5 ms 6912 KB Output is correct
18 Correct 7 ms 6912 KB Output is correct
19 Correct 6 ms 6912 KB Output is correct
20 Correct 6 ms 6912 KB Output is correct
21 Correct 5 ms 6912 KB Output is correct
22 Correct 5 ms 6912 KB Output is correct
23 Correct 6 ms 6912 KB Output is correct
24 Correct 7 ms 6912 KB Output is correct
25 Correct 6 ms 6912 KB Output is correct
26 Correct 6 ms 7168 KB Output is correct
27 Correct 5 ms 6912 KB Output is correct
28 Correct 5 ms 6912 KB Output is correct
29 Correct 5 ms 6912 KB Output is correct
30 Correct 5 ms 6912 KB Output is correct
31 Correct 5 ms 6912 KB Output is correct
32 Correct 6 ms 6912 KB Output is correct
33 Correct 5 ms 6912 KB Output is correct
34 Correct 5 ms 6912 KB Output is correct
35 Correct 5 ms 6912 KB Output is correct
36 Correct 5 ms 6912 KB Output is correct
37 Correct 5 ms 6912 KB Output is correct
38 Correct 5 ms 6912 KB Output is correct
39 Correct 5 ms 6912 KB Output is correct
40 Correct 5 ms 6912 KB Output is correct
41 Correct 5 ms 6912 KB Output is correct
42 Correct 5 ms 6912 KB Output is correct
43 Correct 5 ms 6912 KB Output is correct
44 Correct 5 ms 6912 KB Output is correct
45 Correct 5 ms 6912 KB Output is correct
46 Correct 5 ms 6912 KB Output is correct
47 Correct 5 ms 6912 KB Output is correct
48 Correct 6 ms 6912 KB Output is correct
49 Correct 5 ms 6912 KB Output is correct
50 Correct 5 ms 6912 KB Output is correct
51 Correct 5 ms 6912 KB Output is correct
52 Correct 5 ms 6912 KB Output is correct
53 Correct 5 ms 6912 KB Output is correct
54 Correct 5 ms 6912 KB Output is correct
55 Correct 6 ms 6912 KB Output is correct
56 Correct 5 ms 6912 KB Output is correct
57 Correct 7 ms 6912 KB Output is correct
58 Correct 5 ms 6912 KB Output is correct
59 Correct 6 ms 6912 KB Output is correct
60 Correct 6 ms 6912 KB Output is correct
61 Correct 5 ms 6912 KB Output is correct
62 Correct 6 ms 6912 KB Output is correct
63 Correct 6 ms 6912 KB Output is correct
64 Correct 7 ms 6912 KB Output is correct
65 Correct 7 ms 6912 KB Output is correct
66 Correct 7 ms 6912 KB Output is correct
67 Correct 5 ms 6912 KB Output is correct
68 Correct 5 ms 6912 KB Output is correct
69 Correct 6 ms 6912 KB Output is correct
70 Correct 6 ms 6912 KB Output is correct
71 Correct 6 ms 6912 KB Output is correct
72 Correct 7 ms 6912 KB Output is correct
73 Incorrect 5 ms 6912 KB Wrong Answer [11]
74 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 696 ms 39168 KB Output is correct : V - N = 12
2 Correct 532 ms 34772 KB Output is correct : V - N = 12
3 Correct 228 ms 19032 KB Output is correct : V - N = 12
4 Correct 14 ms 7680 KB Output is correct : V - N = 12
5 Correct 130 ms 14032 KB Output is correct : V - N = 12
6 Correct 642 ms 32600 KB Output is correct : V - N = 12
7 Correct 689 ms 39376 KB Output is correct : V - N = 12
8 Correct 692 ms 36872 KB Output is correct : V - N = 12
9 Correct 302 ms 22248 KB Output is correct : V - N = 12
10 Correct 68 ms 9200 KB Output is correct : V - N = 12
11 Correct 64 ms 10728 KB Output is correct : V - N = 12
12 Correct 593 ms 25840 KB Output is correct : V - N = 12
13 Correct 646 ms 37888 KB Output is correct : V - N = 12
14 Correct 751 ms 38784 KB Output is correct : V - N = 12
15 Correct 421 ms 31624 KB Output is correct : V - N = 12
16 Correct 164 ms 12224 KB Output is correct : V - N = 12
17 Correct 22 ms 8448 KB Output is correct : V - N = 12
18 Correct 302 ms 21200 KB Output is correct : V - N = 12
19 Correct 810 ms 35808 KB Output is correct : V - N = 12
20 Correct 674 ms 39384 KB Output is correct : V - N = 12
21 Correct 183 ms 17816 KB Output is correct : V - N = 12
22 Correct 146 ms 14496 KB Output is correct : V - N = 12
23 Correct 108 ms 10464 KB Output is correct : V - N = 12
24 Correct 8 ms 7168 KB Output is correct : V - N = 12
25 Correct 40 ms 9184 KB Output is correct : V - N = 12
26 Correct 125 ms 13752 KB Output is correct : V - N = 12
27 Correct 326 ms 15784 KB Output is correct : V - N = 12
28 Correct 185 ms 15448 KB Output is correct : V - N = 12
29 Correct 151 ms 11352 KB Output is correct : V - N = 12
30 Correct 14 ms 7936 KB Output is correct : V - N = 12
31 Correct 13 ms 7424 KB Output is correct : V - N = 12
32 Correct 14 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 11 ms 7424 KB Output is correct : V - N = 12
36 Correct 687 ms 39496 KB Output is correct : V - N = 12
37 Correct 725 ms 39520 KB Output is correct : V - N = 12
38 Correct 710 ms 39448 KB Output is correct : V - N = 12
39 Correct 694 ms 39264 KB Output is correct : V - N = 12
40 Correct 715 ms 39664 KB Output is correct : V - N = 12
41 Correct 121 ms 13656 KB Output is correct : V - N = 12
42 Correct 99 ms 12864 KB Output is correct : V - N = 12
43 Correct 114 ms 13664 KB Output is correct : V - N = 12
44 Correct 18 ms 7424 KB Output is correct : V - N = 12
45 Correct 69 ms 10992 KB Output is correct : V - N = 12
46 Correct 260 ms 19648 KB Output is correct : V - N = 12
47 Correct 127 ms 13664 KB Output is correct : V - N = 12
48 Correct 320 ms 22752 KB Output is correct : V - N = 12
49 Correct 69 ms 10448 KB Output is correct : V - N = 12
50 Correct 29 ms 8448 KB Output is correct : V - N = 12
51 Correct 546 ms 34696 KB Output is correct : V - N = 12
52 Correct 15 ms 7680 KB Output is correct : V - N = 12
53 Correct 438 ms 32340 KB Output is correct : V - N = 12
54 Correct 585 ms 36312 KB Output is correct : V - N = 12
55 Correct 43 ms 9208 KB Output is correct : V - N = 12
56 Correct 366 ms 24912 KB Output is correct : V - N = 12
57 Correct 662 ms 38432 KB Output is correct : V - N = 12
58 Correct 86 ms 12032 KB Output is correct : V - N = 12
59 Correct 261 ms 20424 KB Output is correct : V - N = 12
60 Correct 672 ms 38584 KB Output is correct : V - N = 12
61 Correct 6 ms 7168 KB Output is correct : V - N = 12
62 Correct 8 ms 6912 KB Output is correct : V - N = 12
63 Correct 6 ms 6912 KB Output is correct : V - N = 12
64 Correct 7 ms 6912 KB Output is correct : V - N = 12
65 Correct 5 ms 6912 KB Output is correct : V - N = 12
66 Incorrect 5 ms 6912 KB Wrong Answer [11]
67 Halted 0 ms 0 KB -