답안 #78655 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
78655	2018-10-06T20:46:21 Z	duality	007 (CEOI14_007)	C++11	100 / 100	361 ms	17164 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];
int visited[200000],m;
int doDFS(int u) {
    if (visited[u]) return 0;
    int i;
    visited[u] = 1;
    m = min(m,dist1[u]);
    for (i = 0; i < adjList[u].size(); i++) {
        int v = adjList[u][i];
        if ((dist1[v] == dist2[v]) && (dist1[v] < dist1[u])) doDFS(v);
    }
    return 0;
}
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);
            }
        }
    }
    int ans = max(min(dist1[d]-dist1[s],dist2[d]-dist2[s]),-1);
    if ((dist1[s] != dist2[s]) || (dist1[d] != dist2[d])) printf("%d\n",ans);
    else {
        m = N,doDFS(s);
        int t = m;
        if (!visited[d]) {
            m = N,doDFS(d);
            if (m < t) ans--;
        }
        printf("%d\n",max(ans,-1));
    }

    return 0;
}

Compilation message

007.cpp: In function 'int doDFS(int)':
007.cpp:66:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
007.cpp: In function 'int main()':
007.cpp:94:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (i = 0; i < adjList[u].size(); i++) {
                     ~~^~~~~~~~~~~~~~~~~~~
007.cpp:109:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (i = 0; i < adjList[u].size(); i++) {
                     ~~^~~~~~~~~~~~~~~~~~~
007.cpp:77: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:78: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:81: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
30.0 / 30.0

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

Subtask #2
70.0 / 70.0

#	결과	실행 시간	메모리	Grader output
1	Correct	29 ms	7008 KB	Output is correct
2	Correct	40 ms	7904 KB	Output is correct
3	Correct	34 ms	7904 KB	Output is correct
4	Correct	38 ms	8032 KB	Output is correct
5	Correct	30 ms	8032 KB	Output is correct
6	Correct	31 ms	8032 KB	Output is correct
7	Correct	36 ms	8032 KB	Output is correct
8	Correct	34 ms	8032 KB	Output is correct
9	Correct	53 ms	8032 KB	Output is correct
10	Correct	220 ms	12128 KB	Output is correct
11	Correct	64 ms	12128 KB	Output is correct
12	Correct	84 ms	12128 KB	Output is correct
13	Correct	81 ms	12128 KB	Output is correct
14	Correct	57 ms	12128 KB	Output is correct
15	Correct	92 ms	12128 KB	Output is correct
16	Correct	88 ms	12128 KB	Output is correct
17	Correct	87 ms	12128 KB	Output is correct
18	Correct	130 ms	12128 KB	Output is correct
19	Correct	142 ms	12128 KB	Output is correct
20	Correct	293 ms	13920 KB	Output is correct
21	Correct	123 ms	13920 KB	Output is correct
22	Correct	105 ms	13920 KB	Output is correct
23	Correct	107 ms	13920 KB	Output is correct
24	Correct	116 ms	13920 KB	Output is correct
25	Correct	174 ms	13920 KB	Output is correct
26	Correct	132 ms	13920 KB	Output is correct
27	Correct	130 ms	13920 KB	Output is correct
28	Correct	135 ms	13920 KB	Output is correct
29	Correct	194 ms	13920 KB	Output is correct
30	Correct	284 ms	14580 KB	Output is correct
31	Correct	140 ms	14580 KB	Output is correct
32	Correct	142 ms	14580 KB	Output is correct
33	Correct	144 ms	14580 KB	Output is correct
34	Correct	173 ms	14580 KB	Output is correct
35	Correct	132 ms	14580 KB	Output is correct
36	Correct	166 ms	14580 KB	Output is correct
37	Correct	161 ms	14580 KB	Output is correct
38	Correct	159 ms	14580 KB	Output is correct
39	Correct	170 ms	14580 KB	Output is correct
40	Correct	256 ms	15084 KB	Output is correct
41	Correct	361 ms	17164 KB	Output is correct

답안 #78655

Compilation message

Subtask #1 30.0 / 30.0

Subtask #2 70.0 / 70.0

Subtask #1
30.0 / 30.0

Subtask #2
70.0 / 70.0