oj.uz

Submission #242817

# Submission time Handle Problem Language Result Execution time Memory
242817 2020-06-29T10:49:51 Z osaaateiasavtnl Airline Route Map (JOI18_airline) C++17
37 / 100
 1103 ms 30920 KB 
#include<bits/stdc++.h>
#include "Alicelib.h"
using namespace std;
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
void Alice( int N, int M, int A[], int B[] ){   
    vector <ii> ans;
    for (int i = 0; i < M; ++i)
        ans.app(mp(A[i], B[i]));
 
    // N ... N + 9 - bits
    for (int i = N; i < N + 9; ++i)
        ans.app(mp(i, i + 1));
        
    //N + 10 - connected with all except N + 11, N + 11 - only to bits
    for (int i = 0; i < N + 10; ++i) 
        if (i != N)
            ans.app(mp(i, N + 10));
    for (int i = N; i < N + 10; ++i)
        ans.app(mp(i, N + 11));
 
    for (int u = 0; u < N; ++u)
        for (int bit = 0; bit < 10; ++bit)
            if ((u >> bit) & 1)
                ans.app(mp(u, N+bit));
  
    vector <int> pw(N+12);
    for (auto e : ans) {
        ++pw[e.f];
        ++pw[e.s];
    }   

    InitG(N + 12, ans.size());
    int ptr = 0;
    for (auto e : ans) {
        MakeG(ptr++, e.f, e.s);
    }
}
 
#include<bits/stdc++.h>
#include "Boblib.h"
using namespace std;
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
 
const int N = 2007;
bool g[N][N];
 
void Bob( int V, int E, int C[], int D[] ){
    int n = V - 12;

    /*
    if (n == 1) {
        InitMap(n, 0);
        return;
    }   
 
    if (n == 2) {
        if (E == 31) {
            InitMap(n, 0);
            return;
        }   
        else {
            InitMap(n, 1);
            MakeMap(0, 1);
            return;
        }   
    }
    */ 

    vector <int> pw(V);
    for (int i = 0; i < E; ++i) {
        ++pw[C[i]];
        ++pw[D[i]];
        g[C[i]][D[i]] = g[D[i]][C[i]] = 1;
    }
    
    vector <int> ord;
    for (int i = 0; i < V; ++i)
        ord.app(i);
    auto comp = [&](int u, int v) {
        return pw[u] < pw[v];
    };
    sort(all(ord), comp);
 
    auto checkmax = [&](int mx) {
        int sec = -1;
        for (int i = 0; i < V; ++i) {

            int pw = 0;
            for (int j = 0; j < V; ++j)
                pw += g[i][j];

            if (pw != 10)
                continue;

            if (i != mx && !g[i][mx]) {
                sec = i;
                break;
            }   
        }   
        return sec != -1;
    };  

    int ptr = V - 1;
    while (!checkmax(ord[ptr]))
        --ptr;
    int mx = ord[ptr];
 
    //cout << "mx " << mx << ' ' << pw[mx] << endl;
 
    int sec = -1;
    for (int i = 0; i < V; ++i) {

        int pw = 0;
        for (int j = 0; j < V; ++j)
            pw += g[i][j];

        if (pw != 10)
            continue;

        if (i != mx && !g[i][mx]) {
            sec = i;
            break;
        }   
    }   
 
    //cout << "sec " << sec << ' ' << pw[sec] << endl;
 
    vector <int> bit;
    for (int i = 0; i < V; ++i) {
        if (g[i][sec]) {
            bit.app(i);
        }   
    }   
    
    //cout << "bit " << bit.size() << endl;
 
    for (int i = 0; i < bit.size(); ++i) {
        if (!g[bit[i]][mx]) {
            swap(bit[0], bit[i]);
            //cout << "swap" << endl;
            break;
        }
    }   
 
    for (int i = 1; i < bit.size(); ++i) {
        int prv = bit[i-1];
        for (int j = i; j < bit.size(); ++j) {
            if (g[prv][bit[j]]) {
                swap(bit[i], bit[j]);
                break;
            }   
        }   
    }   
 
    vector <int> real;
    for (int i = 0; i < V; ++i) {
        if (!g[i][sec] && i != sec && i != mx)
            real.app(i);
    }   
 
    //cout << "real " << real.size() << endl;
 
    vector <int> num;
    for (auto e : real) {
        int x = 0;
        for (int i = 0; i < 10; ++i)
            if (g[e][bit[i]])
                x += 1 << i;
        num.app(x);
    }   
 
    /*
    InitMap( 3, 2 );
    MakeMap( 1, 2 );
    MakeMap( 1, 3 );
    */
 
    vector <ii> ans;
    for (int i = 0; i < real.size(); ++i)   
        for (int j = i+1; j < real.size(); ++j)
            if (g[real[i]][real[j]]) {
 
                //cout << "add " << num[i] << ' ' << num[j] << endl;
 
                ans.app(mp(num[i], num[j]));
            }
    InitMap(n, ans.size());
    for (auto e : ans)
        MakeMap(e.f, e.s);
}

Compilation message

Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:107:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < bit.size(); ++i) {
                     ~~^~~~~~~~~~~~
Bob.cpp:115:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 1; i < bit.size(); ++i) {
                     ~~^~~~~~~~~~~~
Bob.cpp:117:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j = i; j < bit.size(); ++j) {
                         ~~^~~~~~~~~~~~
Bob.cpp:149:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < real.size(); ++i)   
                     ~~^~~~~~~~~~~~~
Bob.cpp:150:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j = i+1; j < real.size(); ++j)
                           ~~^~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 6912 KB Output is correct
2 Correct 14 ms 6912 KB Output is correct
3 Correct 13 ms 6760 KB Output is correct
4 Correct 13 ms 6656 KB Output is correct
5 Correct 13 ms 6912 KB Output is correct
6 Correct 13 ms 6912 KB Output is correct
7 Correct 15 ms 6912 KB Output is correct
8 Correct 15 ms 6912 KB Output is correct
9 Correct 14 ms 6912 KB Output is correct
10 Correct 13 ms 6912 KB Output is correct
11 Correct 13 ms 6912 KB Output is correct
12 Correct 13 ms 6912 KB Output is correct
13 Correct 13 ms 6912 KB Output is correct
14 Correct 13 ms 6912 KB Output is correct
15 Correct 13 ms 6912 KB Output is correct
16 Correct 13 ms 6912 KB Output is correct
17 Correct 13 ms 6912 KB Output is correct
18 Correct 13 ms 6912 KB Output is correct
19 Correct 13 ms 6912 KB Output is correct
20 Correct 14 ms 6912 KB Output is correct
21 Correct 14 ms 6912 KB Output is correct
22 Correct 14 ms 6912 KB Output is correct
23 Correct 16 ms 6912 KB Output is correct
24 Correct 14 ms 6912 KB Output is correct
25 Correct 13 ms 6912 KB Output is correct
26 Correct 13 ms 6912 KB Output is correct
27 Correct 13 ms 6912 KB Output is correct
28 Correct 13 ms 6912 KB Output is correct
29 Correct 13 ms 6912 KB Output is correct
30 Correct 14 ms 6656 KB Output is correct
31 Correct 13 ms 6912 KB Output is correct
32 Correct 14 ms 6912 KB Output is correct
33 Correct 13 ms 6912 KB Output is correct
34 Correct 13 ms 6912 KB Output is correct
35 Correct 13 ms 6912 KB Output is correct
36 Correct 13 ms 6912 KB Output is correct
37 Correct 14 ms 6912 KB Output is correct
38 Correct 13 ms 6912 KB Output is correct
39 Correct 13 ms 6912 KB Output is correct
40 Correct 13 ms 6912 KB Output is correct
41 Correct 13 ms 6912 KB Output is correct
42 Correct 13 ms 6912 KB Output is correct
43 Correct 13 ms 6912 KB Output is correct
44 Correct 13 ms 6912 KB Output is correct
45 Correct 13 ms 6912 KB Output is correct
46 Correct 13 ms 6912 KB Output is correct
47 Correct 13 ms 6912 KB Output is correct
48 Correct 13 ms 6912 KB Output is correct
49 Correct 13 ms 6912 KB Output is correct
50 Correct 13 ms 6912 KB Output is correct
51 Correct 13 ms 6656 KB Output is correct
52 Correct 13 ms 6912 KB Output is correct
53 Correct 13 ms 6656 KB Output is correct
54 Correct 13 ms 6912 KB Output is correct
55 Correct 13 ms 6912 KB Output is correct
56 Correct 14 ms 6912 KB Output is correct
57 Correct 13 ms 6912 KB Output is correct
58 Correct 13 ms 6912 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 6912 KB Output is correct
2 Correct 14 ms 6912 KB Output is correct
3 Correct 13 ms 6760 KB Output is correct
4 Correct 13 ms 6656 KB Output is correct
5 Correct 13 ms 6912 KB Output is correct
6 Correct 13 ms 6912 KB Output is correct
7 Correct 15 ms 6912 KB Output is correct
8 Correct 15 ms 6912 KB Output is correct
9 Correct 14 ms 6912 KB Output is correct
10 Correct 13 ms 6912 KB Output is correct
11 Correct 13 ms 6912 KB Output is correct
12 Correct 13 ms 6912 KB Output is correct
13 Correct 13 ms 6912 KB Output is correct
14 Correct 13 ms 6912 KB Output is correct
15 Correct 13 ms 6912 KB Output is correct
16 Correct 13 ms 6912 KB Output is correct
17 Correct 13 ms 6912 KB Output is correct
18 Correct 13 ms 6912 KB Output is correct
19 Correct 13 ms 6912 KB Output is correct
20 Correct 14 ms 6912 KB Output is correct
21 Correct 14 ms 6912 KB Output is correct
22 Correct 14 ms 6912 KB Output is correct
23 Correct 16 ms 6912 KB Output is correct
24 Correct 14 ms 6912 KB Output is correct
25 Correct 13 ms 6912 KB Output is correct
26 Correct 13 ms 6912 KB Output is correct
27 Correct 13 ms 6912 KB Output is correct
28 Correct 13 ms 6912 KB Output is correct
29 Correct 13 ms 6912 KB Output is correct
30 Correct 14 ms 6656 KB Output is correct
31 Correct 13 ms 6912 KB Output is correct
32 Correct 14 ms 6912 KB Output is correct
33 Correct 13 ms 6912 KB Output is correct
34 Correct 13 ms 6912 KB Output is correct
35 Correct 13 ms 6912 KB Output is correct
36 Correct 13 ms 6912 KB Output is correct
37 Correct 14 ms 6912 KB Output is correct
38 Correct 13 ms 6912 KB Output is correct
39 Correct 13 ms 6912 KB Output is correct
40 Correct 13 ms 6912 KB Output is correct
41 Correct 13 ms 6912 KB Output is correct
42 Correct 13 ms 6912 KB Output is correct
43 Correct 13 ms 6912 KB Output is correct
44 Correct 13 ms 6912 KB Output is correct
45 Correct 13 ms 6912 KB Output is correct
46 Correct 13 ms 6912 KB Output is correct
47 Correct 13 ms 6912 KB Output is correct
48 Correct 13 ms 6912 KB Output is correct
49 Correct 13 ms 6912 KB Output is correct
50 Correct 13 ms 6912 KB Output is correct
51 Correct 13 ms 6656 KB Output is correct
52 Correct 13 ms 6912 KB Output is correct
53 Correct 13 ms 6656 KB Output is correct
54 Correct 13 ms 6912 KB Output is correct
55 Correct 13 ms 6912 KB Output is correct
56 Correct 14 ms 6912 KB Output is correct
57 Correct 13 ms 6912 KB Output is correct
58 Correct 13 ms 6912 KB Output is correct
59 Correct 14 ms 6912 KB Output is correct
60 Correct 13 ms 6912 KB Output is correct
61 Correct 14 ms 6912 KB Output is correct
62 Correct 15 ms 6912 KB Output is correct
63 Correct 15 ms 6912 KB Output is correct
64 Correct 14 ms 6912 KB Output is correct
65 Correct 14 ms 6912 KB Output is correct
66 Correct 13 ms 6912 KB Output is correct
67 Correct 15 ms 6912 KB Output is correct
68 Correct 13 ms 6912 KB Output is correct
69 Correct 13 ms 6912 KB Output is correct
70 Correct 13 ms 6912 KB Output is correct
71 Correct 14 ms 6912 KB Output is correct
72 Correct 14 ms 6912 KB Output is correct
73 Correct 14 ms 6912 KB Output is correct
74 Correct 13 ms 6912 KB Output is correct
75 Correct 13 ms 6912 KB Output is correct
76 Correct 13 ms 6912 KB Output is correct
77 Correct 14 ms 6912 KB Output is correct
78 Correct 13 ms 6912 KB Output is correct
79 Correct 13 ms 6912 KB Output is correct
80 Correct 14 ms 6912 KB Output is correct
81 Correct 14 ms 6912 KB Output is correct
82 Correct 14 ms 6912 KB Output is correct
83 Correct 13 ms 6912 KB Output is correct
84 Correct 14 ms 6912 KB Output is correct
85 Correct 13 ms 6912 KB Output is correct
86 Correct 14 ms 6912 KB Output is correct
87 Correct 14 ms 6912 KB Output is correct
88 Correct 14 ms 6912 KB Output is correct
89 Correct 15 ms 6912 KB Output is correct
90 Correct 13 ms 6912 KB Output is correct
91 Correct 13 ms 6656 KB Output is correct
92 Correct 14 ms 6912 KB Output is correct
93 Correct 13 ms 6912 KB Output is correct
94 Correct 14 ms 6912 KB Output is correct
95 Correct 14 ms 6912 KB Output is correct
96 Correct 14 ms 6912 KB Output is correct
97 Correct 14 ms 6912 KB Output is correct
98 Correct 13 ms 6912 KB Output is correct
99 Correct 15 ms 6912 KB Output is correct
100 Correct 13 ms 6912 KB Output is correct
101 Correct 13 ms 6912 KB Output is correct
102 Correct 13 ms 6912 KB Output is correct
103 Correct 14 ms 6912 KB Output is correct
104 Correct 13 ms 6912 KB Output is correct
105 Correct 14 ms 6912 KB Output is correct
106 Correct 14 ms 6912 KB Output is correct
107 Correct 14 ms 6912 KB Output is correct
108 Correct 14 ms 7168 KB Output is correct
109 Correct 14 ms 6912 KB Output is correct
110 Correct 13 ms 6912 KB Output is correct
111 Correct 15 ms 6912 KB Output is correct
112 Correct 15 ms 6912 KB Output is correct
113 Correct 15 ms 6912 KB Output is correct
114 Correct 13 ms 6912 KB Output is correct
115 Correct 15 ms 6912 KB Output is correct
116 Correct 14 ms 6912 KB Output is correct
117 Correct 14 ms 6912 KB Output is correct
118 Correct 14 ms 6912 KB Output is correct

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 1103 ms 30632 KB Output is correct : V - N = 12
2 Correct 504 ms 25496 KB Output is correct : V - N = 12
3 Correct 209 ms 14032 KB Output is correct : V - N = 12
4 Correct 24 ms 7424 KB Output is correct : V - N = 12
5 Correct 182 ms 11344 KB Output is correct : V - N = 12
6 Correct 434 ms 22280 KB Output is correct : V - N = 12
7 Correct 628 ms 30408 KB Output is correct : V - N = 12
8 Correct 693 ms 27960 KB Output is correct : V - N = 12
9 Correct 478 ms 17360 KB Output is correct : V - N = 12
10 Correct 54 ms 8432 KB Output is correct : V - N = 12
11 Correct 104 ms 9184 KB Output is correct : V - N = 12
12 Correct 601 ms 19408 KB Output is correct : V - N = 12
13 Correct 597 ms 29008 KB Output is correct : V - N = 12
14 Correct 842 ms 29872 KB Output is correct : V - N = 12
15 Correct 424 ms 20680 KB Output is correct : V - N = 12
16 Correct 122 ms 9952 KB Output is correct : V - N = 12
17 Correct 27 ms 7856 KB Output is correct : V - N = 12
18 Correct 436 ms 15824 KB Output is correct : V - N = 12
19 Correct 721 ms 26704 KB Output is correct : V - N = 12
20 Correct 757 ms 30808 KB Output is correct : V - N = 12
21 Correct 190 ms 13272 KB Output is correct : V - N = 12
22 Correct 143 ms 11736 KB Output is correct : V - N = 12
23 Correct 102 ms 8936 KB Output is correct : V - N = 12
24 Correct 17 ms 6912 KB Output is correct : V - N = 12
25 Correct 48 ms 8168 KB Output is correct : V - N = 12
26 Correct 118 ms 10968 KB Output is correct : V - N = 12
27 Correct 251 ms 13296 KB Output is correct : V - N = 12
28 Correct 230 ms 12760 KB Output is correct : V - N = 12
29 Correct 150 ms 9696 KB Output is correct : V - N = 12
30 Correct 19 ms 7424 KB Output is correct : V - N = 12
31 Correct 19 ms 7232 KB Output is correct : V - N = 12
32 Correct 19 ms 7168 KB Output is correct : V - N = 12
33 Correct 23 ms 7168 KB Output is correct : V - N = 12
34 Correct 19 ms 7168 KB Output is correct : V - N = 12
35 Correct 19 ms 7168 KB Output is correct : V - N = 12
36 Incorrect 809 ms 30920 KB Wrong Answer [12]
37 Halted 0 ms 0 KB -