oj.uz

Submission #891399

# Submission time Handle Problem Language Result Execution time Memory
891399 2023-12-22T21:10:46 Z boris_mihov Airline Route Map (JOI18_airline) C++17
0 / 100
 398 ms 52936 KB 
#include "Alicelib.h"
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>

typedef long long llong;
const int MAXN = 1000 + 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 << 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});
    }

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

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

    return;
}


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

typedef long long llong;
const int MAXN = 1012 + 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[] )
{
    if (V <= 2)
    {
        if (U == 0)
        {
            InitMap(V, 0);
        } else
        {
            InitMap(V, 1);
            MakeMap(0, 1);
        }
        
        return;
    }
    
    for (int i = 0 ; i < U ; ++i)
    {
        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 < U ; ++i)
    {
        inReal[i] = true;
    }

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

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

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

    for (int i = 0 ; i < V ; ++i)
    {
        if (i != root && !connected[i][root] && deg[i] == 1)
        {
            pointing = i;
        }

        if (i != root && !connected[i][root] && deg[i] == log)
        {
            source = i;
        }
    }

    assert(source != -1);
    assert(pointing != -1);
    for (const int &u : g[source])
    {
        isLog[u] = true;
    }

    dfs(g[pointing][0], 0);
    // assert(logs.size() == log);
    for (int i = 0 ; i < log ; ++i)
    {
        inReal[logs[i]] = false;
        realLog[logs[i]] = i;
    }
    
    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]])
            {
                number[i] |= (1 << j);
            }
        }
    }

    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:60: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]
   60 |     for (int i = 0 ; i < newG.size() ; ++i)
      |                      ~~^~~~~~~~~~~~~

Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:146: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]
  146 |     for (int i = 0 ; i < edges.size() ; ++i)
      |                      ~~^~~~~~~~~~~~~~

Subtask #1
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 17668 KB Output is correct
2 Correct 3 ms 17664 KB Output is correct
3 Correct 2 ms 17500 KB Output is correct
4 Correct 2 ms 15620 KB Output is correct
5 Correct 3 ms 17668 KB Output is correct
6 Correct 2 ms 17668 KB Output is correct
7 Correct 2 ms 17664 KB Output is correct
8 Correct 2 ms 17668 KB Output is correct
9 Correct 2 ms 17668 KB Output is correct
10 Correct 2 ms 15628 KB Output is correct
11 Correct 3 ms 17668 KB Output is correct
12 Correct 2 ms 17916 KB Output is correct
13 Correct 2 ms 17668 KB Output is correct
14 Correct 3 ms 17668 KB Output is correct
15 Correct 2 ms 17664 KB Output is correct
16 Correct 3 ms 17916 KB Output is correct
17 Correct 2 ms 17668 KB Output is correct
18 Correct 2 ms 17668 KB Output is correct
19 Correct 3 ms 17664 KB Output is correct
20 Correct 3 ms 17660 KB Output is correct
21 Correct 2 ms 17668 KB Output is correct
22 Correct 3 ms 17668 KB Output is correct
23 Correct 2 ms 17668 KB Output is correct
24 Correct 2 ms 15620 KB Output is correct
25 Correct 2 ms 17664 KB Output is correct
26 Correct 3 ms 17668 KB Output is correct
27 Correct 3 ms 17668 KB Output is correct
28 Correct 2 ms 17668 KB Output is correct
29 Correct 3 ms 17668 KB Output is correct
30 Correct 2 ms 15620 KB Output is correct
31 Correct 2 ms 15624 KB Output is correct
32 Correct 2 ms 15620 KB Output is correct
33 Correct 2 ms 15620 KB Output is correct
34 Correct 2 ms 15620 KB Output is correct
35 Correct 2 ms 15624 KB Output is correct
36 Correct 2 ms 17668 KB Output is correct
37 Correct 2 ms 17668 KB Output is correct
38 Correct 2 ms 17668 KB Output is correct
39 Correct 3 ms 17916 KB Output is correct
40 Correct 3 ms 17668 KB Output is correct
41 Correct 2 ms 17668 KB Output is correct
42 Correct 2 ms 17668 KB Output is correct
43 Incorrect 2 ms 17668 KB Wrong Answer [11]
44 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 17668 KB Output is correct
2 Correct 3 ms 17664 KB Output is correct
3 Correct 2 ms 17500 KB Output is correct
4 Correct 2 ms 15620 KB Output is correct
5 Correct 3 ms 17668 KB Output is correct
6 Correct 2 ms 17668 KB Output is correct
7 Correct 2 ms 17664 KB Output is correct
8 Correct 2 ms 17668 KB Output is correct
9 Correct 2 ms 17668 KB Output is correct
10 Correct 2 ms 15628 KB Output is correct
11 Correct 3 ms 17668 KB Output is correct
12 Correct 2 ms 17916 KB Output is correct
13 Correct 2 ms 17668 KB Output is correct
14 Correct 3 ms 17668 KB Output is correct
15 Correct 2 ms 17664 KB Output is correct
16 Correct 3 ms 17916 KB Output is correct
17 Correct 2 ms 17668 KB Output is correct
18 Correct 2 ms 17668 KB Output is correct
19 Correct 3 ms 17664 KB Output is correct
20 Correct 3 ms 17660 KB Output is correct
21 Correct 2 ms 17668 KB Output is correct
22 Correct 3 ms 17668 KB Output is correct
23 Correct 2 ms 17668 KB Output is correct
24 Correct 2 ms 15620 KB Output is correct
25 Correct 2 ms 17664 KB Output is correct
26 Correct 3 ms 17668 KB Output is correct
27 Correct 3 ms 17668 KB Output is correct
28 Correct 2 ms 17668 KB Output is correct
29 Correct 3 ms 17668 KB Output is correct
30 Correct 2 ms 15620 KB Output is correct
31 Correct 2 ms 15624 KB Output is correct
32 Correct 2 ms 15620 KB Output is correct
33 Correct 2 ms 15620 KB Output is correct
34 Correct 2 ms 15620 KB Output is correct
35 Correct 2 ms 15624 KB Output is correct
36 Correct 2 ms 17668 KB Output is correct
37 Correct 2 ms 17668 KB Output is correct
38 Correct 2 ms 17668 KB Output is correct
39 Correct 3 ms 17916 KB Output is correct
40 Correct 3 ms 17668 KB Output is correct
41 Correct 2 ms 17668 KB Output is correct
42 Correct 2 ms 17668 KB Output is correct
43 Incorrect 2 ms 17668 KB Wrong Answer [11]
44 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Runtime error 398 ms 52936 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -