oj.uz

Submission #265501

# Submission time Handle Problem Language Result Execution time Memory
265501 2020-08-14T22:31:01 Z doowey Airline Route Map (JOI18_airline) C++14
0 / 100
 873 ms 30704 KB 
#include <bits/stdc++.h>
#include "Alicelib.h"
#include <cassert>
#include <cstdio>

using namespace std;

typedef pair<int, int> pii;

#define fi first
#define se second
#define mp make_pair

void Alice( int N, int M, int A[], int B[] ){
    vector<pii> edg;
    for(int i = 0; i < M ; i ++ ){
        edg.push_back(mp(A[i], B[i]));
    }
    for(int bit = 1; bit < 11; bit ++ ){
        edg.push_back(mp(N + bit - 1, N + bit));
    }
    for(int bit = 0; bit < 11; bit ++ ){
        for(int i = 0 ; i < N; i ++ ){
            if((i & (1 << bit))){
                edg.push_back(mp(N + bit, i));
            }
        }
    }
    for(int i = 0; i < N ; i ++ ){
        edg.push_back(mp(N + 11, i));
    }
    for(int i = 0 ; i < N + 11; i ++ ){
        edg.push_back(mp(i, N + 12));
    }
    InitG(N + 13, (int)edg.size());
    for(int i = 0 ; i < edg.size(); i ++ ){
        MakeG(i, edg[i].fi, edg[i].se);
    }

}

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

using namespace std;

typedef pair<int, int> pii;

#define fi first
#define se second
#define mp make_pair

const int N = 1050;
vector<int> T[N];
bool hh[N];
bool gg[N];
bool vis[N];
int deg[N];
int idx[N];
bool out[N];

void Bob( int V, int U, int C[], int D[] ){
    int n = V - 13;
    int m = U;
    for(int i = 0 ; i < m; i ++ ){
        T[C[i]].push_back(D[i]);
        T[D[i]].push_back(C[i]);
    }
    int vso = -1;
    for(int i = 0 ; i < V; i ++ ){
        if(T[i].size() == n + 11){
            vso = i;
            hh[i]=true;
            for(auto x : T[i]){
                hh[x]=true;
            }
            break;
        }
    }
    int al = -1;
    for(int i = 0 ; i < V; i ++ ){
        if(!hh[i]){
            al = i;
        }
    }
    gg[vso]=true;
    for(auto x : T[al]){
        gg[x]=true;
    }
    vector<int> bits;
    for(int i = 0; i < V; i ++ ){
        if(!gg[i]){
            bits.push_back(i);
        }
    }
    for(auto x : bits){
        for(auto y : T[x]){
            if(!gg[y]){
                deg[x] ++ ;
            }
            else{
                out[x]=true;
            }
        }
    }
    vector<int> ord;
    int start = -1;
    for(auto x : bits){
        if(deg[x] == 1 && out[x]){
            start = x;
        }
    }
    for(auto x : bits){
        if(start == -1 && deg[x] == 1){
            start = x;
            break;
        }
    }
    bool went;
    for(int i = 0 ; i < bits.size(); i ++ ){
        vis[start] = true;
        ord.push_back(start);
        if(i + 1 == bits.size()) break;
        for(auto x : T[start]){
            if(vis[x] || gg[x]) continue;
            start=x;
            break;
        }
    }
    gg[vso] = false;
    for(int i = 0 ; i < ord.size(); i ++ ){
        for(auto x : T[ord[i]]){
            if(gg[x]){
                idx[x] += (1 << i);
            }
        }
    }
    vector<pii> sol;
    for(int i = 0 ; i < V; i ++ ){
        if(!gg[i]) continue;
        for(auto x : T[i]){
            if(!gg[x]) continue;
            if(idx[i] < idx[x])
                sol.push_back(mp(idx[i], idx[x]));
        }
    }
    InitMap(n, sol.size());
    for(auto x : sol)
        MakeMap(x.fi, x.se);
}

Compilation message

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

Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:32:24: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   32 |         if(T[i].size() == n + 11){
      |            ~~~~~~~~~~~~^~~~~~~~~
Bob.cpp:81:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |     for(int i = 0 ; i < bits.size(); i ++ ){
      |                     ~~^~~~~~~~~~~~~
Bob.cpp:84:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |         if(i + 1 == bits.size()) break;
      |            ~~~~~~^~~~~~~~~~~~~~
Bob.cpp:92:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |     for(int i = 0 ; i < ord.size(); i ++ ){
      |                     ~~^~~~~~~~~~~~
Bob.cpp:80:10: warning: unused variable 'went' [-Wunused-variable]
   80 |     bool went;
      |          ^~~~

Subtask #1
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 6912 KB Output is correct
2 Correct 7 ms 6912 KB Output is correct
3 Incorrect 7 ms 6912 KB Wrong Answer [120]
4 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 6912 KB Output is correct
2 Correct 7 ms 6912 KB Output is correct
3 Incorrect 7 ms 6912 KB Wrong Answer [120]
4 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Partially correct 873 ms 30704 KB Output is partially correct : V - N = 13
2 Partially correct 526 ms 25884 KB Output is partially correct : V - N = 13
3 Partially correct 379 ms 14168 KB Output is partially correct : V - N = 13
4 Incorrect 13 ms 7424 KB Wrong Answer [120]
5 Halted 0 ms 0 KB -