oj.uz

Submission #891409

# Submission time Handle Problem Language Result Execution time Memory
891409 2023-12-22T22:00:31 Z boris_mihov Airline Route Map (JOI18_airline) C++17
37 / 100
 384 ms 58980 KB 
#include "Alicelib.h"
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>

typedef long long llong;
const int MAXN = 2000 + 10;
const int INF  = 1e9;

std::vector <std::pair <int,int>> newG;

void Alice (int N, int M, int A[], int B[] )
{
    for (int i = 0 ; i < M ; ++i)
    {
        newG.push_back({A[i], B[i]});
    }

    if (N <= 2)
    {
        InitG(N, newG.size());
        for (int i = 0 ; i < newG.size() ; ++i)
        {
            MakeG(i, newG[i].first, newG[i].second);
        }

        return;
    }
    
    int log = 10;
    for (int i = 0 ; i < N ; ++i)
    {
        for (int bit = 0 ; bit < log ; ++bit)
        {
            if ((i + 1) & (1 << bit))
            {
                newG.push_back({i, N + bit});
            }
        }
    }

    for (int bit = 0 ; bit < log ; ++bit)
    {
        newG.push_back({N + log, N + bit});
    }

    for (int bit = 0 ; bit + 1 < log ; ++bit)
    {
        newG.push_back({N + bit, N + bit + 1});
    }

    for (int i = 0 ; i < N + log ; ++i)
    {
        newG.push_back({N + log + 1, i});
    }

    InitG(N + log + 2, newG.size());
    for (int i = 0 ; i < newG.size() ; ++i)
    {
        MakeG(i, newG[i].first, newG[i].second);
    }

    return;
}


#include "Boblib.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <cstring>
#include <vector>

typedef long long llong;
const int MAXN = 2013 + 10;
const int INF  = 1e9;

int number[MAXN];
bool inReal[MAXN];
bool connected[MAXN][MAXN];
std::vector <std::pair <int,int>> edges;
std::vector <int> g[MAXN];
std::vector <int> logs;
int realLog[MAXN];
bool isLog[MAXN];
int deg[MAXN];

void dfs(int node, int par)
{
    logs.push_back(node);
    for (const int &u : g[node])
    {
        if (u == par)
        {
            continue;
        }

        if (isLog[u])
        {
            dfs(u, node);
        }
    }
}

void Bob( int V, int U, int C[], int D[] )
{
    // std::cout << "call: " << V << ' ' << U << '\n';
    if (V <= 2)
    {
        if (U == 0)
        {
            InitMap(V, 0);
        } else
        {
            InitMap(V, 1);
            MakeMap(0, 1);
        }
        
        return;
    }
    
    memset(connected, 0, sizeof(connected));
    for (int i = 0 ; i < U ; ++i)
    {
        // if (C[i] == 0 || D[i] == 0) std::cout << "edge: " << C[i] << ' ' << D[i] << '\n';
        assert(C[i] < MAXN);
        assert(D[i] < MAXN);
        g[C[i]].push_back(D[i]);
        g[D[i]].push_back(C[i]);
        deg[C[i]]++; deg[D[i]]++;
        connected[C[i]][D[i]] = true;
        connected[D[i]][C[i]] = true;
    }

    for (int i = 0 ; i < V ; ++i)
    {
        inReal[i] = true;
    }

    int log = 10;
    int n = V - log - 2;
    int root = -1;

    for (int i = 0 ; i < V ; ++i)
    {
        if (deg[i] == V - 2)
        {
            root = i;
        }
    }

    assert(root != -1);
    int source = -1;
    int pointing = -1;

    for (int i = 0 ; i < V ; ++i)
    {
        // if (!connected[root][i]) std::cout << "size: " << i << ' ' << root << ' ' << deg[i] << ' ' << connected[i][root] << '\n';
        if (i != root && !connected[i][root] && deg[i] == log)
        {
            while (source != -1);
            source = i;
        }
    }
    

    assert(source != -1);
    std::vector <int> candidates;
    for (const int &u : g[source])
    {
        // std::cout << "neighboor: " << u << ' ' << deg[u] << '\n';
        isLog[u] = true;
    }

    for (const int &u : g[source])
    {
        int cntLog = 0;
        for (const int &v : g[u])
        {
            if (isLog[v])
            {
                cntLog++;
            }
        }

        if (cntLog == 1)
        {
            candidates.push_back(u);
        }
    }

    assert(candidates.size() == 2);
    if (deg[candidates[0]] > deg[candidates[1]]) 
    {
        std::swap(candidates[0], candidates[1]);
    }

    isLog[candidates[0]] = false;
    pointing = candidates[0];

    // std::cout << "poiting is: " << pointing << ' ' << source << '\n' << std::flush;
    assert(pointing != -1);
    if (isLog[g[pointing][0]]) dfs(g[pointing][0], -1);
    else if (isLog[g[pointing][1]]) dfs(g[pointing][1], -1);
    else dfs(g[pointing][2], -1);
    
    // std::cout << "logs are: " << log << ' ' << logs.size() << "\n";
    std::reverse(logs.begin(), logs.end());
    if (logs.size() < log) logs.push_back(pointing);
    for (int i = 0 ; i < log ; ++i)
    {
        // std::cout << logs[i] << ' ';
        inReal[logs[i]] = false;
        realLog[logs[i]] = i;
    }

    // std::cout << '\n';
    assert(logs.size() == log);
    inReal[root] = false;
    inReal[source] = false;
    inReal[pointing] = false;

    for (int i = 0 ; i < V ; ++i)
    {
        if (!inReal[i])
        {
            continue;
        }

        for (int j = 0 ; j < log ; ++j)
        {
            if (connected[i][logs[j]])
            {
                // if (i == 0) std::cout << "connected: " << i << ' ' << logs[j] << ' ' << connected[i][logs[j]] << '\n';
                number[i] |= (1 << j);
            }
        }

        // if (number[i] == 0) std::cout << "interesting: " << number[i] << ' ' << i << '\n';
        assert(number[i] > 0);
        number[i]--;

    }

    for (int i = 0 ; i < V ; ++i)
    {
        for (int j = i + 1 ; j < V ; ++j)
        {
            if (!inReal[i] || !inReal[j] || !connected[i][j])
            {
                continue;
            }

            edges.push_back({number[i], number[j]});
        }
    }

    InitMap(n, edges.size());
    for (int i = 0 ; i < edges.size() ; ++i)
    {
        MakeMap(edges[i].first, edges[i].second);
    }

    return;
}

Compilation message

Alice.cpp: In function 'void Alice(int, int, int*, int*)':
Alice.cpp:23:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |         for (int i = 0 ; i < newG.size() ; ++i)
      |                          ~~^~~~~~~~~~~~~
Alice.cpp:59:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |     for (int i = 0 ; i < newG.size() ; ++i)
      |                      ~~^~~~~~~~~~~~~

Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:144:21: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  144 |     if (logs.size() < log) logs.push_back(pointing);
      |         ~~~~~~~~~~~~^~~~~
In file included from /usr/include/c++/10/cassert:44,
                 from Bob.cpp:5:
Bob.cpp:153:24: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  153 |     assert(logs.size() == log);
      |            ~~~~~~~~~~~~^~~~~~
Bob.cpp:194:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  194 |     for (int i = 0 ; i < edges.size() ; ++i)
      |                      ~~^~~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Runtime error 384 ms 58980 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -