Submission #348648

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
348648	2021-01-15T11:26:19 Z	denkendoemeer	Fun Tour (APIO20_fun)	C++14	66 / 100	231 ms	18916 KB

#include<bits/stdc++.h>
#include "fun.h"
using namespace std;
vector<int>ans,av(3),dist,grup[3];
int cmp(int a,int b)
{
    return dist[a]<dist[b];
}
int cmp2(int a,int b)
{
    return grup[a].size()>grup[b].size();
}
int cmp3(int a,int b)
{
    return dist[grup[a].back()]>dist[grup[b].back()];
}
vector<int>createFunTour(int n,int q)
{
    dist.resize(n);
    int cent=0,last=-1,i,j;
    for(i=1;i<n;i++)
        if (attractionsBehind(cent,i)>n/2)
            cent=i;
    for(i=0;i<n;i++)
        if (i!=cent)
            dist[i]=hoursRequired(i,cent);
    for(i=0;i<n;i++)
        if (i!=cent){
            for(j=0;j<3;j++)
                if (grup[j].size()==0 || hoursRequired(grup[j][0],i)!=(dist[i]+dist[grup[j][0]]) || j==2){
                    grup[j].push_back(i);
                    break;
                }
        }
    av[0]=0;
    av[1]=1;
    av[2]=2;
    for(i=0;i<3;i++)
        sort(grup[i].begin(),grup[i].end(),cmp);
    while(1){
        sort(av.begin(),av.end(),cmp2);
        if (grup[av[0]].size()>=grup[av[1]].size()+grup[av[2]].size())
            break;
        sort(av.begin(),av.end(),cmp3);
        if (last==av[0])
            last=av[1];
        else
            last=av[0];
        ans.push_back(grup[last].back());
        grup[last].pop_back();
    }
    grup[av[1]].insert(grup[av[1]].end(),grup[av[2]].begin(),grup[av[2]].end());
    sort(grup[av[1]].begin(),grup[av[1]].end(),cmp);
    int aux=0;
    if (ans.size()>1 && dist[ans.back()]<dist[grup[av[1]].back()])
        aux=1;
    while(grup[av[aux]].size()){
        ans.push_back(grup[av[aux]].back());
        grup[av[aux]].pop_back();
        aux=aux^1;
    }
    ans.push_back(cent);
    return ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	0 ms	364 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	492 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	1 ms	364 KB	Output is correct
29	Correct	2 ms	364 KB	Output is correct
30	Correct	1 ms	364 KB	Output is correct
31	Correct	1 ms	364 KB	Output is correct
32	Correct	1 ms	384 KB	Output is correct
33	Correct	1 ms	364 KB	Output is correct
34	Correct	1 ms	364 KB	Output is correct
35	Correct	1 ms	364 KB	Output is correct
36	Correct	1 ms	384 KB	Output is correct
37	Correct	1 ms	364 KB	Output is correct
38	Correct	1 ms	364 KB	Output is correct
39	Correct	1 ms	364 KB	Output is correct
40	Correct	1 ms	364 KB	Output is correct
41	Correct	1 ms	364 KB	Output is correct

Subtask #3
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	0 ms	364 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	147 ms	16268 KB	Output is correct
19	Correct	1 ms	492 KB	Output is correct
20	Correct	2 ms	620 KB	Output is correct
21	Correct	4 ms	748 KB	Output is correct
22	Correct	7 ms	1388 KB	Output is correct
23	Correct	14 ms	2412 KB	Output is correct
24	Correct	19 ms	3052 KB	Output is correct
25	Correct	82 ms	9476 KB	Output is correct

Subtask #4
19.0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	0 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	2 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	2 ms	492 KB	Output is correct
14	Correct	14 ms	1900 KB	Output is correct
15	Correct	167 ms	16356 KB	Output is correct
16	Correct	170 ms	16104 KB	Output is correct
17	Correct	29 ms	4076 KB	Output is correct
18	Correct	72 ms	7476 KB	Output is correct
19	Correct	125 ms	12732 KB	Output is correct
20	Correct	5 ms	876 KB	Output is correct

Subtask #5
0 / 34.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	0 ms	364 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	492 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	1 ms	364 KB	Output is correct
29	Correct	2 ms	364 KB	Output is correct
30	Correct	1 ms	364 KB	Output is correct
31	Correct	1 ms	364 KB	Output is correct
32	Correct	1 ms	384 KB	Output is correct
33	Correct	1 ms	364 KB	Output is correct
34	Correct	1 ms	364 KB	Output is correct
35	Correct	1 ms	364 KB	Output is correct
36	Correct	1 ms	384 KB	Output is correct
37	Correct	1 ms	364 KB	Output is correct
38	Correct	1 ms	364 KB	Output is correct
39	Correct	1 ms	364 KB	Output is correct
40	Correct	1 ms	364 KB	Output is correct
41	Correct	1 ms	364 KB	Output is correct
42	Correct	1 ms	364 KB	Output is correct
43	Correct	1 ms	364 KB	Output is correct
44	Correct	147 ms	16268 KB	Output is correct
45	Correct	1 ms	492 KB	Output is correct
46	Correct	2 ms	620 KB	Output is correct
47	Correct	4 ms	748 KB	Output is correct
48	Correct	7 ms	1388 KB	Output is correct
49	Correct	14 ms	2412 KB	Output is correct
50	Correct	19 ms	3052 KB	Output is correct
51	Correct	82 ms	9476 KB	Output is correct
52	Correct	2 ms	492 KB	Output is correct
53	Correct	14 ms	1900 KB	Output is correct
54	Correct	167 ms	16356 KB	Output is correct
55	Correct	170 ms	16104 KB	Output is correct
56	Correct	29 ms	4076 KB	Output is correct
57	Correct	72 ms	7476 KB	Output is correct
58	Correct	125 ms	12732 KB	Output is correct
59	Correct	5 ms	876 KB	Output is correct
60	Correct	199 ms	16484 KB	Output is correct
61	Correct	231 ms	18916 KB	Output is correct
62	Incorrect	147 ms	15460 KB	Too many queries
63	Halted	0 ms	0 KB	-

Submission #348648

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 16.0 / 16.0

Subtask #3 21.0 / 21.0

Subtask #4 19.0 / 19.0

Subtask #5 0 / 34.0

Subtask #1
10.0 / 10.0

Subtask #2
16.0 / 16.0

Subtask #3
21.0 / 21.0

Subtask #4
19.0 / 19.0

Subtask #5
0 / 34.0