oj.uz

답안 #78650

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
78650 2018-10-06T20:16:52 Z duality 007 (CEOI14_007) C++11
30 / 100
 317 ms 18660 KB 
#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

vi adjList[200000];
int dist1[200000],dist2[200000];
queue<int> Q;
int main() {
    int i;
    int N,M;
    int s,d,a,b,u,v;
    scanf("%d %d",&N,&M);
    scanf("%d %d %d %d",&s,&d,&a,&b);
    s--,d--,a--,b--;
    for (i = 0; i < M; i++) {
        scanf("%d %d",&u,&v);
        u--,v--;
        adjList[u].pb(v);
        adjList[v].pb(u);
    }

    fill(dist1,dist1+N,-1);
    dist1[a] = 0;
    Q.push(a);
    while (!Q.empty()) {
        u = Q.front();
        Q.pop();

        for (i = 0; i < adjList[u].size(); i++) {
            v = adjList[u][i];
            if (dist1[v] == -1) {
                dist1[v] = dist1[u]+1;
                Q.push(v);
            }
        }
    }
    fill(dist2,dist2+N,-1);
    dist2[b] = 0;
    Q.push(b);
    while (!Q.empty()) {
        u = Q.front();
        Q.pop();

        for (i = 0; i < adjList[u].size(); i++) {
            v = adjList[u][i];
            if (dist2[v] == -1) {
                dist2[v] = dist2[u]+1;
                Q.push(v);
            }
        }
    }
    printf("%d\n",max(min(dist1[d]-dist1[s],dist2[d]-dist2[s])-1,-1));

    return 0;
}

Compilation message

007.cpp: In function 'int main()':
007.cpp:82:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (i = 0; i < adjList[u].size(); i++) {
                     ~~^~~~~~~~~~~~~~~~~~~
007.cpp:97:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (i = 0; i < adjList[u].size(); i++) {
                     ~~^~~~~~~~~~~~~~~~~~~
007.cpp:65:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&N,&M);
     ~~~~~^~~~~~~~~~~~~~~
007.cpp:66:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d %d",&s,&d,&a,&b);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
007.cpp:69:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d",&u,&v);
         ~~~~~^~~~~~~~~~~~~~~

Subtask #1
9.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 6 ms 4984 KB Partially correct
2 Partially correct 6 ms 5116 KB Partially correct
3 Partially correct 6 ms 5116 KB Partially correct
4 Correct 6 ms 5116 KB Output is correct
5 Correct 6 ms 5116 KB Output is correct
6 Partially correct 5 ms 5116 KB Partially correct
7 Partially correct 6 ms 5172 KB Partially correct
8 Correct 6 ms 5172 KB Output is correct
9 Partially correct 6 ms 5188 KB Partially correct
10 Partially correct 6 ms 5228 KB Partially correct
11 Partially correct 6 ms 5228 KB Partially correct
12 Correct 6 ms 5276 KB Output is correct
13 Partially correct 6 ms 5276 KB Partially correct
14 Correct 6 ms 5276 KB Output is correct
15 Partially correct 6 ms 5276 KB Partially correct
16 Correct 6 ms 5276 KB Output is correct
17 Correct 6 ms 5276 KB Output is correct
18 Correct 6 ms 5276 KB Output is correct
19 Partially correct 6 ms 5276 KB Partially correct
20 Partially correct 6 ms 5276 KB Partially correct
21 Partially correct 6 ms 5276 KB Partially correct
22 Partially correct 6 ms 5276 KB Partially correct
23 Partially correct 6 ms 5276 KB Partially correct
24 Correct 6 ms 5288 KB Output is correct

Subtask #2
21.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 29 ms 6840 KB Partially correct
2 Correct 35 ms 7864 KB Output is correct
3 Partially correct 31 ms 7864 KB Partially correct
4 Correct 40 ms 9128 KB Output is correct
5 Partially correct 31 ms 9128 KB Partially correct
6 Partially correct 31 ms 9176 KB Partially correct
7 Partially correct 43 ms 9312 KB Partially correct
8 Partially correct 33 ms 9324 KB Partially correct
9 Correct 49 ms 9708 KB Output is correct
10 Partially correct 188 ms 14080 KB Partially correct
11 Correct 57 ms 14080 KB Output is correct
12 Partially correct 80 ms 14080 KB Partially correct
13 Correct 66 ms 14080 KB Output is correct
14 Correct 52 ms 14080 KB Output is correct
15 Partially correct 77 ms 14080 KB Partially correct
16 Partially correct 87 ms 14080 KB Partially correct
17 Partially correct 85 ms 14080 KB Partially correct
18 Correct 72 ms 14080 KB Output is correct
19 Partially correct 126 ms 14080 KB Partially correct
20 Correct 234 ms 15900 KB Output is correct
21 Correct 111 ms 15900 KB Output is correct
22 Partially correct 117 ms 15900 KB Partially correct
23 Partially correct 102 ms 15900 KB Partially correct
24 Partially correct 100 ms 15900 KB Partially correct
25 Correct 101 ms 15900 KB Output is correct
26 Partially correct 92 ms 15900 KB Partially correct
27 Partially correct 118 ms 15900 KB Partially correct
28 Partially correct 131 ms 15900 KB Partially correct
29 Partially correct 166 ms 15900 KB Partially correct
30 Correct 267 ms 16376 KB Output is correct
31 Correct 135 ms 16376 KB Output is correct
32 Partially correct 122 ms 16376 KB Partially correct
33 Partially correct 132 ms 16376 KB Partially correct
34 Correct 136 ms 16376 KB Output is correct
35 Correct 107 ms 16376 KB Output is correct
36 Correct 108 ms 16376 KB Output is correct
37 Partially correct 129 ms 16376 KB Partially correct
38 Partially correct 126 ms 16376 KB Partially correct
39 Partially correct 155 ms 16376 KB Partially correct
40 Correct 211 ms 16636 KB Output is correct
41 Partially correct 317 ms 18660 KB Partially correct