Submission #591572

# Submission time Handle Problem Language Result Execution time Memory
591572 2022-07-07T15:33:53 Z yutabi Shortcut (IOI16_shortcut) C++14
0 / 100
2000 ms 308 KB
#include "shortcut.h"


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


#define pb push_back


typedef long long ll;
typedef pair <int,int> ii;


ll maxi=100000000000000000;


ll best[3000];

ll ans=maxi;


vector <vector <ii> > graph;


void DFS(int node, ll dis=0)
{
    best[node]=min(best[node],dis);

    for(int i=0;i<graph[node].size();i++)
    {
        if(best[graph[node][i].second]>dis+graph[node][i].first)
        {
            DFS(graph[node][i].second,dis+graph[node][i].first);
        }
    }
}


long long find_shortcut(int n, std::vector<int> l, std::vector<int> d, int c)
{
    graph=vector <vector <ii> > (2*n);

    for(int i=0;i<n;i++)
    {
        if(i!=n-1)
        {
            graph[i].pb(ii(l[i],i+1));
            graph[i+1].pb(ii(l[i],i));
        }

        graph[i].pb(ii(d[i],i+n));
        graph[i+n].pb(ii(d[i],i));
    }

    for(int i=0;i<n;i++)
    {
        for(int j=i+1;j<n;j++)
        {
            graph[i].pb(ii(c,j));
            graph[j].pb(ii(c,i));

            ll maxii=0;

            for(int k=0;k<2*n;k++)
            {
                for(int l=0;l<2*n;l++)
                {
                    best[l]=maxi;
                }

                DFS(k);

                for(int l=0;l<2*n;l++)
                {
                    maxii=max(maxii,best[l]);
                }
            }

            ans=min(ans,maxii);

            graph[i].pop_back();
            graph[j].pop_back();
        }
    }

    return ans;
}

Compilation message

shortcut.cpp: In function 'void DFS(int, ll)':
shortcut.cpp:30:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     for(int i=0;i<graph[node].size();i++)
      |                 ~^~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 4, 80 is a correct answer
2 Correct 1 ms 212 KB n = 9, 110 is a correct answer
3 Correct 1 ms 212 KB n = 4, 21 is a correct answer
4 Correct 0 ms 212 KB n = 3, 4 is a correct answer
5 Correct 1 ms 308 KB n = 2, 62 is a correct answer
6 Correct 1 ms 212 KB n = 2, 3 is a correct answer
7 Correct 0 ms 212 KB n = 3, 29 is a correct answer
8 Correct 0 ms 212 KB n = 2, 3 is a correct answer
9 Correct 0 ms 212 KB n = 2, 3 is a correct answer
10 Correct 0 ms 212 KB n = 2, 2000000001 is a correct answer
11 Correct 1 ms 212 KB n = 2, 3000000000 is a correct answer
12 Correct 1 ms 212 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 308 KB n = 3, 3000000000 is a correct answer
14 Correct 1 ms 304 KB n = 4, 3000000001 is a correct answer
15 Correct 1 ms 212 KB n = 4, 4000000000 is a correct answer
16 Correct 1 ms 304 KB n = 5, 4000000000 is a correct answer
17 Correct 1 ms 300 KB n = 10, 1000000343 is a correct answer
18 Correct 1 ms 212 KB n = 10, 3189 is a correct answer
19 Correct 1 ms 212 KB n = 10, 7000000000 is a correct answer
20 Correct 1 ms 212 KB n = 5, 12 is a correct answer
21 Correct 0 ms 212 KB n = 5, 25 is a correct answer
22 Correct 1 ms 212 KB n = 2, 122 is a correct answer
23 Correct 1 ms 304 KB n = 10, 117 is a correct answer
24 Correct 1 ms 304 KB n = 10, 336 is a correct answer
25 Correct 1 ms 212 KB n = 10, 438 is a correct answer
26 Correct 1 ms 212 KB n = 10, 206 is a correct answer
27 Correct 1 ms 212 KB n = 10, 636 is a correct answer
28 Correct 1 ms 212 KB n = 4, 2399 is a correct answer
29 Correct 1 ms 212 KB n = 10, 10992 is a correct answer
30 Correct 1 ms 300 KB n = 10, 3112 is a correct answer
31 Execution timed out 2070 ms 300 KB Time limit exceeded
32 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 4, 80 is a correct answer
2 Correct 1 ms 212 KB n = 9, 110 is a correct answer
3 Correct 1 ms 212 KB n = 4, 21 is a correct answer
4 Correct 0 ms 212 KB n = 3, 4 is a correct answer
5 Correct 1 ms 308 KB n = 2, 62 is a correct answer
6 Correct 1 ms 212 KB n = 2, 3 is a correct answer
7 Correct 0 ms 212 KB n = 3, 29 is a correct answer
8 Correct 0 ms 212 KB n = 2, 3 is a correct answer
9 Correct 0 ms 212 KB n = 2, 3 is a correct answer
10 Correct 0 ms 212 KB n = 2, 2000000001 is a correct answer
11 Correct 1 ms 212 KB n = 2, 3000000000 is a correct answer
12 Correct 1 ms 212 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 308 KB n = 3, 3000000000 is a correct answer
14 Correct 1 ms 304 KB n = 4, 3000000001 is a correct answer
15 Correct 1 ms 212 KB n = 4, 4000000000 is a correct answer
16 Correct 1 ms 304 KB n = 5, 4000000000 is a correct answer
17 Correct 1 ms 300 KB n = 10, 1000000343 is a correct answer
18 Correct 1 ms 212 KB n = 10, 3189 is a correct answer
19 Correct 1 ms 212 KB n = 10, 7000000000 is a correct answer
20 Correct 1 ms 212 KB n = 5, 12 is a correct answer
21 Correct 0 ms 212 KB n = 5, 25 is a correct answer
22 Correct 1 ms 212 KB n = 2, 122 is a correct answer
23 Correct 1 ms 304 KB n = 10, 117 is a correct answer
24 Correct 1 ms 304 KB n = 10, 336 is a correct answer
25 Correct 1 ms 212 KB n = 10, 438 is a correct answer
26 Correct 1 ms 212 KB n = 10, 206 is a correct answer
27 Correct 1 ms 212 KB n = 10, 636 is a correct answer
28 Correct 1 ms 212 KB n = 4, 2399 is a correct answer
29 Correct 1 ms 212 KB n = 10, 10992 is a correct answer
30 Correct 1 ms 300 KB n = 10, 3112 is a correct answer
31 Execution timed out 2070 ms 300 KB Time limit exceeded
32 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 4, 80 is a correct answer
2 Correct 1 ms 212 KB n = 9, 110 is a correct answer
3 Correct 1 ms 212 KB n = 4, 21 is a correct answer
4 Correct 0 ms 212 KB n = 3, 4 is a correct answer
5 Correct 1 ms 308 KB n = 2, 62 is a correct answer
6 Correct 1 ms 212 KB n = 2, 3 is a correct answer
7 Correct 0 ms 212 KB n = 3, 29 is a correct answer
8 Correct 0 ms 212 KB n = 2, 3 is a correct answer
9 Correct 0 ms 212 KB n = 2, 3 is a correct answer
10 Correct 0 ms 212 KB n = 2, 2000000001 is a correct answer
11 Correct 1 ms 212 KB n = 2, 3000000000 is a correct answer
12 Correct 1 ms 212 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 308 KB n = 3, 3000000000 is a correct answer
14 Correct 1 ms 304 KB n = 4, 3000000001 is a correct answer
15 Correct 1 ms 212 KB n = 4, 4000000000 is a correct answer
16 Correct 1 ms 304 KB n = 5, 4000000000 is a correct answer
17 Correct 1 ms 300 KB n = 10, 1000000343 is a correct answer
18 Correct 1 ms 212 KB n = 10, 3189 is a correct answer
19 Correct 1 ms 212 KB n = 10, 7000000000 is a correct answer
20 Correct 1 ms 212 KB n = 5, 12 is a correct answer
21 Correct 0 ms 212 KB n = 5, 25 is a correct answer
22 Correct 1 ms 212 KB n = 2, 122 is a correct answer
23 Correct 1 ms 304 KB n = 10, 117 is a correct answer
24 Correct 1 ms 304 KB n = 10, 336 is a correct answer
25 Correct 1 ms 212 KB n = 10, 438 is a correct answer
26 Correct 1 ms 212 KB n = 10, 206 is a correct answer
27 Correct 1 ms 212 KB n = 10, 636 is a correct answer
28 Correct 1 ms 212 KB n = 4, 2399 is a correct answer
29 Correct 1 ms 212 KB n = 10, 10992 is a correct answer
30 Correct 1 ms 300 KB n = 10, 3112 is a correct answer
31 Execution timed out 2070 ms 300 KB Time limit exceeded
32 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 4, 80 is a correct answer
2 Correct 1 ms 212 KB n = 9, 110 is a correct answer
3 Correct 1 ms 212 KB n = 4, 21 is a correct answer
4 Correct 0 ms 212 KB n = 3, 4 is a correct answer
5 Correct 1 ms 308 KB n = 2, 62 is a correct answer
6 Correct 1 ms 212 KB n = 2, 3 is a correct answer
7 Correct 0 ms 212 KB n = 3, 29 is a correct answer
8 Correct 0 ms 212 KB n = 2, 3 is a correct answer
9 Correct 0 ms 212 KB n = 2, 3 is a correct answer
10 Correct 0 ms 212 KB n = 2, 2000000001 is a correct answer
11 Correct 1 ms 212 KB n = 2, 3000000000 is a correct answer
12 Correct 1 ms 212 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 308 KB n = 3, 3000000000 is a correct answer
14 Correct 1 ms 304 KB n = 4, 3000000001 is a correct answer
15 Correct 1 ms 212 KB n = 4, 4000000000 is a correct answer
16 Correct 1 ms 304 KB n = 5, 4000000000 is a correct answer
17 Correct 1 ms 300 KB n = 10, 1000000343 is a correct answer
18 Correct 1 ms 212 KB n = 10, 3189 is a correct answer
19 Correct 1 ms 212 KB n = 10, 7000000000 is a correct answer
20 Correct 1 ms 212 KB n = 5, 12 is a correct answer
21 Correct 0 ms 212 KB n = 5, 25 is a correct answer
22 Correct 1 ms 212 KB n = 2, 122 is a correct answer
23 Correct 1 ms 304 KB n = 10, 117 is a correct answer
24 Correct 1 ms 304 KB n = 10, 336 is a correct answer
25 Correct 1 ms 212 KB n = 10, 438 is a correct answer
26 Correct 1 ms 212 KB n = 10, 206 is a correct answer
27 Correct 1 ms 212 KB n = 10, 636 is a correct answer
28 Correct 1 ms 212 KB n = 4, 2399 is a correct answer
29 Correct 1 ms 212 KB n = 10, 10992 is a correct answer
30 Correct 1 ms 300 KB n = 10, 3112 is a correct answer
31 Execution timed out 2070 ms 300 KB Time limit exceeded
32 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 4, 80 is a correct answer
2 Correct 1 ms 212 KB n = 9, 110 is a correct answer
3 Correct 1 ms 212 KB n = 4, 21 is a correct answer
4 Correct 0 ms 212 KB n = 3, 4 is a correct answer
5 Correct 1 ms 308 KB n = 2, 62 is a correct answer
6 Correct 1 ms 212 KB n = 2, 3 is a correct answer
7 Correct 0 ms 212 KB n = 3, 29 is a correct answer
8 Correct 0 ms 212 KB n = 2, 3 is a correct answer
9 Correct 0 ms 212 KB n = 2, 3 is a correct answer
10 Correct 0 ms 212 KB n = 2, 2000000001 is a correct answer
11 Correct 1 ms 212 KB n = 2, 3000000000 is a correct answer
12 Correct 1 ms 212 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 308 KB n = 3, 3000000000 is a correct answer
14 Correct 1 ms 304 KB n = 4, 3000000001 is a correct answer
15 Correct 1 ms 212 KB n = 4, 4000000000 is a correct answer
16 Correct 1 ms 304 KB n = 5, 4000000000 is a correct answer
17 Correct 1 ms 300 KB n = 10, 1000000343 is a correct answer
18 Correct 1 ms 212 KB n = 10, 3189 is a correct answer
19 Correct 1 ms 212 KB n = 10, 7000000000 is a correct answer
20 Correct 1 ms 212 KB n = 5, 12 is a correct answer
21 Correct 0 ms 212 KB n = 5, 25 is a correct answer
22 Correct 1 ms 212 KB n = 2, 122 is a correct answer
23 Correct 1 ms 304 KB n = 10, 117 is a correct answer
24 Correct 1 ms 304 KB n = 10, 336 is a correct answer
25 Correct 1 ms 212 KB n = 10, 438 is a correct answer
26 Correct 1 ms 212 KB n = 10, 206 is a correct answer
27 Correct 1 ms 212 KB n = 10, 636 is a correct answer
28 Correct 1 ms 212 KB n = 4, 2399 is a correct answer
29 Correct 1 ms 212 KB n = 10, 10992 is a correct answer
30 Correct 1 ms 300 KB n = 10, 3112 is a correct answer
31 Execution timed out 2070 ms 300 KB Time limit exceeded
32 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 4, 80 is a correct answer
2 Correct 1 ms 212 KB n = 9, 110 is a correct answer
3 Correct 1 ms 212 KB n = 4, 21 is a correct answer
4 Correct 0 ms 212 KB n = 3, 4 is a correct answer
5 Correct 1 ms 308 KB n = 2, 62 is a correct answer
6 Correct 1 ms 212 KB n = 2, 3 is a correct answer
7 Correct 0 ms 212 KB n = 3, 29 is a correct answer
8 Correct 0 ms 212 KB n = 2, 3 is a correct answer
9 Correct 0 ms 212 KB n = 2, 3 is a correct answer
10 Correct 0 ms 212 KB n = 2, 2000000001 is a correct answer
11 Correct 1 ms 212 KB n = 2, 3000000000 is a correct answer
12 Correct 1 ms 212 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 308 KB n = 3, 3000000000 is a correct answer
14 Correct 1 ms 304 KB n = 4, 3000000001 is a correct answer
15 Correct 1 ms 212 KB n = 4, 4000000000 is a correct answer
16 Correct 1 ms 304 KB n = 5, 4000000000 is a correct answer
17 Correct 1 ms 300 KB n = 10, 1000000343 is a correct answer
18 Correct 1 ms 212 KB n = 10, 3189 is a correct answer
19 Correct 1 ms 212 KB n = 10, 7000000000 is a correct answer
20 Correct 1 ms 212 KB n = 5, 12 is a correct answer
21 Correct 0 ms 212 KB n = 5, 25 is a correct answer
22 Correct 1 ms 212 KB n = 2, 122 is a correct answer
23 Correct 1 ms 304 KB n = 10, 117 is a correct answer
24 Correct 1 ms 304 KB n = 10, 336 is a correct answer
25 Correct 1 ms 212 KB n = 10, 438 is a correct answer
26 Correct 1 ms 212 KB n = 10, 206 is a correct answer
27 Correct 1 ms 212 KB n = 10, 636 is a correct answer
28 Correct 1 ms 212 KB n = 4, 2399 is a correct answer
29 Correct 1 ms 212 KB n = 10, 10992 is a correct answer
30 Correct 1 ms 300 KB n = 10, 3112 is a correct answer
31 Execution timed out 2070 ms 300 KB Time limit exceeded
32 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 4, 80 is a correct answer
2 Correct 1 ms 212 KB n = 9, 110 is a correct answer
3 Correct 1 ms 212 KB n = 4, 21 is a correct answer
4 Correct 0 ms 212 KB n = 3, 4 is a correct answer
5 Correct 1 ms 308 KB n = 2, 62 is a correct answer
6 Correct 1 ms 212 KB n = 2, 3 is a correct answer
7 Correct 0 ms 212 KB n = 3, 29 is a correct answer
8 Correct 0 ms 212 KB n = 2, 3 is a correct answer
9 Correct 0 ms 212 KB n = 2, 3 is a correct answer
10 Correct 0 ms 212 KB n = 2, 2000000001 is a correct answer
11 Correct 1 ms 212 KB n = 2, 3000000000 is a correct answer
12 Correct 1 ms 212 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 308 KB n = 3, 3000000000 is a correct answer
14 Correct 1 ms 304 KB n = 4, 3000000001 is a correct answer
15 Correct 1 ms 212 KB n = 4, 4000000000 is a correct answer
16 Correct 1 ms 304 KB n = 5, 4000000000 is a correct answer
17 Correct 1 ms 300 KB n = 10, 1000000343 is a correct answer
18 Correct 1 ms 212 KB n = 10, 3189 is a correct answer
19 Correct 1 ms 212 KB n = 10, 7000000000 is a correct answer
20 Correct 1 ms 212 KB n = 5, 12 is a correct answer
21 Correct 0 ms 212 KB n = 5, 25 is a correct answer
22 Correct 1 ms 212 KB n = 2, 122 is a correct answer
23 Correct 1 ms 304 KB n = 10, 117 is a correct answer
24 Correct 1 ms 304 KB n = 10, 336 is a correct answer
25 Correct 1 ms 212 KB n = 10, 438 is a correct answer
26 Correct 1 ms 212 KB n = 10, 206 is a correct answer
27 Correct 1 ms 212 KB n = 10, 636 is a correct answer
28 Correct 1 ms 212 KB n = 4, 2399 is a correct answer
29 Correct 1 ms 212 KB n = 10, 10992 is a correct answer
30 Correct 1 ms 300 KB n = 10, 3112 is a correct answer
31 Execution timed out 2070 ms 300 KB Time limit exceeded
32 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 4, 80 is a correct answer
2 Correct 1 ms 212 KB n = 9, 110 is a correct answer
3 Correct 1 ms 212 KB n = 4, 21 is a correct answer
4 Correct 0 ms 212 KB n = 3, 4 is a correct answer
5 Correct 1 ms 308 KB n = 2, 62 is a correct answer
6 Correct 1 ms 212 KB n = 2, 3 is a correct answer
7 Correct 0 ms 212 KB n = 3, 29 is a correct answer
8 Correct 0 ms 212 KB n = 2, 3 is a correct answer
9 Correct 0 ms 212 KB n = 2, 3 is a correct answer
10 Correct 0 ms 212 KB n = 2, 2000000001 is a correct answer
11 Correct 1 ms 212 KB n = 2, 3000000000 is a correct answer
12 Correct 1 ms 212 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 308 KB n = 3, 3000000000 is a correct answer
14 Correct 1 ms 304 KB n = 4, 3000000001 is a correct answer
15 Correct 1 ms 212 KB n = 4, 4000000000 is a correct answer
16 Correct 1 ms 304 KB n = 5, 4000000000 is a correct answer
17 Correct 1 ms 300 KB n = 10, 1000000343 is a correct answer
18 Correct 1 ms 212 KB n = 10, 3189 is a correct answer
19 Correct 1 ms 212 KB n = 10, 7000000000 is a correct answer
20 Correct 1 ms 212 KB n = 5, 12 is a correct answer
21 Correct 0 ms 212 KB n = 5, 25 is a correct answer
22 Correct 1 ms 212 KB n = 2, 122 is a correct answer
23 Correct 1 ms 304 KB n = 10, 117 is a correct answer
24 Correct 1 ms 304 KB n = 10, 336 is a correct answer
25 Correct 1 ms 212 KB n = 10, 438 is a correct answer
26 Correct 1 ms 212 KB n = 10, 206 is a correct answer
27 Correct 1 ms 212 KB n = 10, 636 is a correct answer
28 Correct 1 ms 212 KB n = 4, 2399 is a correct answer
29 Correct 1 ms 212 KB n = 10, 10992 is a correct answer
30 Correct 1 ms 300 KB n = 10, 3112 is a correct answer
31 Execution timed out 2070 ms 300 KB Time limit exceeded
32 Halted 0 ms 0 KB -