Submission #1179249


Source Code Expand

Copy
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <algorithm>
#include <numeric>
#include <random>
#include <vector>
#include <array>
#include <bitset>
#include <queue>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>

using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
constexpr ll TEN(int n) { return (n==0) ? 1 : 10*TEN(n-1); }
int bsr(uint x) { return 31 - __builtin_clz(x); }
int bsr(ull x) { return 63 - __builtin_clzll(x); }
int bsf(uint x) { return __builtin_ctz(x); }
int bsf(ull x) { return __builtin_ctzll(x); }

using P = pair<int, int>;
int n, m;
VV<int> g;
V<int> deg;
V<set<int>> g_set;

set<P> edges;
V<bool> is_big;
VV<int> dist;

bool have(int a, int b) {
    return binary_search(begin(g[a]), end(g[a]), b);
}

void naive(int p) {
    dist[p] = V<int>(n, TEN(9));
    dist[p][p] = 0;
    queue<int> q;
    set<int> no;
    for (int i = 0; i < n; i++) {
        no.insert(i);
    }
    q.push(p);
    no.erase(p);
    while (!q.empty()) {
        int u = q.front(); q.pop();
        auto it = no.begin();
        while (it != no.end()) {
            int d = *it; it++;
            if (have(u, d)) continue;

            assert(dist[p][d] == TEN(9));
            no.erase(d);
            q.push(d);
            dist[p][d] = dist[p][u]+1;
        }
    }
}
int main() {
    int q;
    scanf("%d %d %d", &n, &m, &q);
    g = VV<int>(n);
    deg = V<int>(n);
    for (int i = 0; i < m; i++) {
        int a, b;
        scanf("%d %d", &a, &b); a--; b--;
        edges.insert(P(a, b));
        edges.insert(P(b, a));
        g[a].push_back(b);
        g[b].push_back(a);
        deg[a]++; deg[b]++;
    }
    is_big = V<bool>(n);
    dist = VV<int>(n);
    for (int i = 0; i < n; i++) {
        sort(begin(g[i]), end(g[i]));        
    }

    //ok
    for (int i = 0; i < n; i++) {
        if (deg[i] >= (n-2)/2) {
            is_big[i] = true;
            naive(i);
        }
    }
    for (int i = 0; i < q; i++) {
        int a, b;
        scanf("%d %d", &a, &b); a--; b--;
        if (deg[a] > deg[b]) swap(a, b);
        if (is_big[b]) {
            assert(dist[b].size());
            if (dist[b][a] >= TEN(8)) {
                printf("-1\n");
            } else {
                printf("%d\n", dist[b][a]);
            }
        } else {
            assert(!is_big[a]);
            if (edges.count(P(a, b))) {
                printf("2\n");
            } else {
                printf("1\n");
            }
        }
    }
    return 0;
}

Submission Info

Submission Time
Task E - 瞬間移動装置
User yosupo
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2810 Byte
Status
Exec Time 2104 ms
Memory 17664 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:71:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d", &n, &m, &q);
                                  ^
./Main.cpp:76:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &a, &b); a--; b--;
                               ^
./Main.cpp:98:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &a, &b); a--; b--;
                               ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1400
Status
× 2
× 29
× 1
Set Name Test Cases
Sample sample1.txt, sample2.txt
All in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in2.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt
Case Name Status Exec Time Memory
in1.txt 16 ms 768 KB
in10.txt 198 ms 17664 KB
in11.txt 213 ms 11604 KB
in12.txt 352 ms 11392 KB
in13.txt 292 ms 11392 KB
in14.txt 353 ms 11648 KB
in15.txt 267 ms 11948 KB
in16.txt 372 ms 11392 KB
in17.txt 451 ms 11392 KB
in18.txt 472 ms 11776 KB
in19.txt 2104 ms 11264 KB
in2.txt 17 ms 768 KB
in20.txt 256 ms 12544 KB
in21.txt 274 ms 13912 KB
in22.txt 342 ms 11392 KB
in23.txt 433 ms 11392 KB
in24.txt 456 ms 11648 KB
in25.txt 211 ms 12092 KB
in26.txt 205 ms 11712 KB
in27.txt 230 ms 11392 KB
in28.txt 209 ms 11648 KB
in3.txt 1558 ms 11648 KB
in4.txt 1171 ms 11648 KB
in5.txt 430 ms 11648 KB
in6.txt 416 ms 11648 KB
in7.txt 154 ms 11008 KB
in8.txt 177 ms 11904 KB
in9.txt 187 ms 14464 KB
sample1.txt 1 ms 256 KB
sample2.txt 1 ms 256 KB