Submission #725146

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
725146	2023-04-17T01:39:50 Z	n0sk1ll	Fun Tour (APIO20_fun)	C++14	26 / 100	13 ms	1364 KB

#include <bits/stdc++.h>

#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0)
#define mp make_pair
#define xx first
#define yy second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define all(x) x.begin(),x.end()
#define ff(i,a,b) for (int i = a; i < b; i++)
#define fff(i,a,b) for (int i = a; i <= b; i++)
#define bff(i,a,b) for (int i = b-1; i >= a; i--)
#define bfff(i,a,b) for (int i = b; i >= a; i--)

using namespace std;
long double typedef ld;
unsigned int typedef ui;
long long int typedef li;
pair<int,int> typedef pii;
pair<li,li> typedef pli;
pair<ld,ld> typedef pld;
vector<vector<int>> typedef graph;
unsigned long long int typedef ull;
//const int mod = 998244353;
const int mod = 1000000007;







//Note to self: Check for overflow

#include "fun.h"

int n;
int dist[503][503];
bool active[503];

int mostdist(int p)
{
    int ret=p;
    ff(i,0,n) if (active[i] && dist[p][i]>dist[p][ret]) ret=i;
    return ret;
}

vector<int> createFunTour(int N,int q)
{
    n=N;

    ff(i,0,n) ff(j,i+1,n) dist[i][j]=hoursRequired(i,j),dist[j][i]=dist[i][j];

    vector<int> ans;
    ff(i,0,n) active[i]=true;

    int x=0;
    while(true)
    {
        x=mostdist(x);
        ans.pb(x),active[x]=false;
        if ((int)ans.size()==n) return ans;
    }
}

//Note to self: Check for overflow

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	308 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	308 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	308 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct

Subtask #2
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	308 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	308 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	308 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	304 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	9 ms	1336 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	468 KB	Output is correct
27	Correct	2 ms	596 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	10 ms	1336 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	2 ms	680 KB	Output is correct
32	Correct	5 ms	820 KB	Output is correct
33	Correct	1 ms	468 KB	Output is correct
34	Correct	8 ms	1364 KB	Output is correct
35	Correct	10 ms	1340 KB	Output is correct
36	Correct	13 ms	1236 KB	Output is correct
37	Correct	1 ms	468 KB	Output is correct
38	Correct	10 ms	1236 KB	Output is correct
39	Correct	4 ms	852 KB	Output is correct
40	Correct	6 ms	980 KB	Output is correct
41	Correct	3 ms	596 KB	Output is correct

Subtask #3
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	308 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	308 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	1 ms	304 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	9 ms	1336 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	468 KB	Output is correct
15	Correct	2 ms	596 KB	Output is correct
16	Correct	9 ms	1348 KB	Output is correct
17	Incorrect	1 ms	1236 KB	Invalid size
18	Halted	0 ms	0 KB	-

Subtask #4
0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	308 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	10 ms	1336 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	2 ms	680 KB	Output is correct
11	Correct	5 ms	820 KB	Output is correct
12	Correct	1 ms	468 KB	Output is correct
13	Incorrect	1 ms	1332 KB	Invalid size
14	Halted	0 ms	0 KB	-

Subtask #5
0 / 34.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	308 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	308 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	308 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	304 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	9 ms	1336 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	468 KB	Output is correct
27	Correct	2 ms	596 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	10 ms	1336 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	2 ms	680 KB	Output is correct
32	Correct	5 ms	820 KB	Output is correct
33	Correct	1 ms	468 KB	Output is correct
34	Correct	8 ms	1364 KB	Output is correct
35	Correct	10 ms	1340 KB	Output is correct
36	Correct	13 ms	1236 KB	Output is correct
37	Correct	1 ms	468 KB	Output is correct
38	Correct	10 ms	1236 KB	Output is correct
39	Correct	4 ms	852 KB	Output is correct
40	Correct	6 ms	980 KB	Output is correct
41	Correct	3 ms	596 KB	Output is correct
42	Correct	9 ms	1348 KB	Output is correct
43	Incorrect	1 ms	1236 KB	Invalid size
44	Halted	0 ms	0 KB	-

Submission #725146

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 16.0 / 16.0

Subtask #3 0 / 21.0

Subtask #4 0 / 19.0

Subtask #5 0 / 34.0

Subtask #1
10.0 / 10.0

Subtask #2
16.0 / 16.0

Subtask #3
0 / 21.0

Subtask #4
0 / 19.0

Subtask #5
0 / 34.0