oj.uz

답안 #76762

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
76762 2018-09-17T15:02:48 Z antimirage Evacuation plan (IZhO18_plan) C++17
41 / 100
 4000 ms 24428 KB 
#include <bits/stdc++.h>

#define fr first
#define sc second
#define mk make_pair
#define pb push_back
#define sz(s) (int)s.size()
#define all(s) s.begin(), s.end()

using namespace std;

const int N = 1e5 + 5;

int n, m, x, y, w, ar[N], u[N];

vector < vector <pair <int, int> > > g;

vector < vector <int> > r;

vector < pair <int, pair <int, int> > > vec;

priority_queue <pair <int, int> > q;

void dfs (int v, int porog)
{
    u[v] = 1;
    for (auto to : g[v])
    {
        if (u[to.fr] || ar[to.fr] < porog) continue;
        dfs(to.fr, porog);
    }
}

main()
{
    cin >> n >> m;
    g.resize(n + 1);
    r.resize(n + 1);

    for (int i = 1; i <= m; i++)
    {
        scanf("%d%d%d", &x, &y, &w);
        g[x].pb( mk(y, w) );
        g[y].pb( mk(x, w) );
    }
    memset( ar, 0x3f3f3f3f, sizeof(ar) );
    cin >> m;
    for (int i = 1; i <= m; i++)
    {
        scanf("%d", &x);
        q.push( mk( 0, x ) );
        ar[x] = 0;
    }
    while (!q.empty())
    {
        w = -q.top().fr, x = q.top().sc;
        q.pop();

        if (ar[x] < w) continue;

        for (auto to : g[x])
        {
            if (ar[x] + to.sc < ar[to.fr])
            {
                ar[to.fr] = ar[x] + to.sc;
                q.push( mk( -ar[to.fr], to.fr ) );
            }
        }
    }
    cin >> m;
    while (m--)
    {
        scanf("%d%d", &x, &y);
        int l = 0, r = 1e9 + 7;
        while (r - l > 1)
        {
            int md = (l + r) >> 1;
            dfs(x, md);
            if (ar[x] >= md && u[y])
                l = md;
            else
                r = md;

            for (int j = 1; j <= n; j++) u[j] = 0;
        }
        printf("%d\n", l);
    }
}
/**
9 12
1 9 4
1 2 5
2 3 7
2 4 3
4 3 6
3 6 4
8 7 10
6 7 5
5 8 1
9 5 7
5 4 12
6 8 2
2
4 7
5
1 6
5 3
4 8
5 8
1 5
**/

Compilation message

plan.cpp:34:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main()
      ^
plan.cpp: In function 'int main()':
plan.cpp:42:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d", &x, &y, &w);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~
plan.cpp:50:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &x);
         ~~~~~^~~~~~~~~~
plan.cpp:73:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &x, &y);
         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 82 ms 896 KB Output is correct
3 Correct 74 ms 760 KB Output is correct
4 Correct 2 ms 760 KB Output is correct
5 Correct 74 ms 760 KB Output is correct
6 Correct 42 ms 760 KB Output is correct
7 Correct 2 ms 760 KB Output is correct
8 Correct 2 ms 760 KB Output is correct
9 Correct 25 ms 888 KB Output is correct
10 Correct 17 ms 760 KB Output is correct
11 Correct 29 ms 760 KB Output is correct
12 Correct 78 ms 888 KB Output is correct
13 Correct 24 ms 760 KB Output is correct
14 Correct 28 ms 760 KB Output is correct
15 Correct 27 ms 760 KB Output is correct

Subtask #2
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 82 ms 896 KB Output is correct
3 Correct 74 ms 760 KB Output is correct
4 Correct 2 ms 760 KB Output is correct
5 Correct 74 ms 760 KB Output is correct
6 Correct 42 ms 760 KB Output is correct
7 Correct 2 ms 760 KB Output is correct
8 Correct 2 ms 760 KB Output is correct
9 Correct 25 ms 888 KB Output is correct
10 Correct 17 ms 760 KB Output is correct
11 Correct 29 ms 760 KB Output is correct
12 Correct 78 ms 888 KB Output is correct
13 Correct 24 ms 760 KB Output is correct
14 Correct 28 ms 760 KB Output is correct
15 Correct 27 ms 760 KB Output is correct
16 Execution timed out 4101 ms 9900 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 760 KB Output is correct
2 Correct 2 ms 760 KB Output is correct
3 Correct 2 ms 760 KB Output is correct
4 Correct 3 ms 760 KB Output is correct
5 Correct 3 ms 760 KB Output is correct
6 Correct 3 ms 760 KB Output is correct
7 Correct 2 ms 760 KB Output is correct
8 Correct 2 ms 760 KB Output is correct
9 Correct 2 ms 760 KB Output is correct
10 Correct 3 ms 760 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 266 ms 15408 KB Output is correct
2 Correct 625 ms 24428 KB Output is correct
3 Correct 638 ms 23916 KB Output is correct
4 Correct 134 ms 10728 KB Output is correct
5 Correct 690 ms 24412 KB Output is correct
6 Correct 575 ms 24108 KB Output is correct
7 Correct 630 ms 24000 KB Output is correct
8 Correct 531 ms 23460 KB Output is correct
9 Correct 614 ms 23536 KB Output is correct
10 Correct 771 ms 23660 KB Output is correct
11 Correct 679 ms 23512 KB Output is correct
12 Correct 697 ms 23504 KB Output is correct
13 Correct 652 ms 23280 KB Output is correct
14 Correct 569 ms 22556 KB Output is correct
15 Correct 648 ms 23144 KB Output is correct
16 Correct 672 ms 24056 KB Output is correct
17 Correct 542 ms 24076 KB Output is correct
18 Correct 559 ms 24044 KB Output is correct
19 Correct 80 ms 10356 KB Output is correct
20 Correct 703 ms 24400 KB Output is correct
21 Correct 438 ms 21324 KB Output is correct
22 Correct 100 ms 11116 KB Output is correct
23 Correct 161 ms 10332 KB Output is correct
24 Correct 94 ms 11244 KB Output is correct
25 Correct 103 ms 11244 KB Output is correct
26 Correct 106 ms 10132 KB Output is correct
27 Correct 136 ms 10844 KB Output is correct
28 Correct 96 ms 11244 KB Output is correct
29 Correct 134 ms 10844 KB Output is correct
30 Correct 114 ms 11244 KB Output is correct
31 Correct 136 ms 10808 KB Output is correct

Subtask #5
0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 82 ms 896 KB Output is correct
3 Correct 74 ms 760 KB Output is correct
4 Correct 2 ms 760 KB Output is correct
5 Correct 74 ms 760 KB Output is correct
6 Correct 42 ms 760 KB Output is correct
7 Correct 2 ms 760 KB Output is correct
8 Correct 2 ms 760 KB Output is correct
9 Correct 25 ms 888 KB Output is correct
10 Correct 17 ms 760 KB Output is correct
11 Correct 29 ms 760 KB Output is correct
12 Correct 78 ms 888 KB Output is correct
13 Correct 24 ms 760 KB Output is correct
14 Correct 28 ms 760 KB Output is correct
15 Correct 27 ms 760 KB Output is correct
16 Execution timed out 4101 ms 9900 KB Time limit exceeded
17 Halted 0 ms 0 KB -