답안 #436162

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
436162	2021-06-24T09:42:21 Z	aymane7	즐거운 행로 (APIO20_fun)	C++17	26 / 100	384 ms	26852 KB

#include<bits/stdc++.h>
#include "fun.h"
#pragma GCC optimize("O2")
#define deb(x) cout << #x << " = " << x <<endl
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define all(c) c.begin(), c.end()
#define endl "\n"
#define sz(u) (int)(u.size())
#define L(x)(2*x)
#define R(x)(2*x+1)
#define M(x,y)((x+y)/2)
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
/*
int hoursRequired(int x,int y){
    cout<<x<<" "<<y<<endl;
    int ans;
    cin>>ans;
    return ans;
    assert(0);
}
*/
vector<int> createFunTour(int n,int q){
    vector<pair<int,pair<int,int>>> pq;
    for(int i=0;i<n;i++)
        for(int j=0;j<n;j++)
            if(i!=j){
                assert(i<n && i>=0 && j>=0 && j<n);
                int a=hoursRequired(i,j);
                pq.PB({a,{i,j}});
                pq.PB({a,{j,i}});
            }
    sort(all(pq));
    reverse(all(pq));
    vector<bool> vis(n,0);
    int cur=pq[0].S.F;
    vector<int> ans;
    ans.PB(cur);
    vis[cur]=1;

    while(sz(ans)<n){
        int mxd=-1,mxi=-1;
        for(int i=0;i<sz(pq);i++)
            if(pq[i].S.F==cur && pq[i].F>mxd && !vis[pq[i].S.S]){
                mxd=pq[i].F,mxi=pq[i].S.S;
            }
        vis[mxi]=1;
        cur=mxi;
        ans.PB(cur);
    }
    /*
    for(auto x:ans)
        cout<<x<<" ";
    */
    return ans;
}
/*
int main(){
    createFunTour(2,0);
}
*/

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct

Subtask #2
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	292 KB	Output is correct
24	Correct	326 ms	6612 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	7 ms	780 KB	Output is correct
27	Correct	20 ms	1228 KB	Output is correct
28	Correct	1 ms	204 KB	Output is correct
29	Correct	314 ms	6592 KB	Output is correct
30	Correct	2 ms	460 KB	Output is correct
31	Correct	24 ms	1988 KB	Output is correct
32	Correct	49 ms	3520 KB	Output is correct
33	Correct	13 ms	1100 KB	Output is correct
34	Correct	330 ms	6636 KB	Output is correct
35	Correct	347 ms	6592 KB	Output is correct
36	Correct	384 ms	6580 KB	Output is correct
37	Correct	6 ms	780 KB	Output is correct
38	Correct	263 ms	6528 KB	Output is correct
39	Correct	50 ms	3520 KB	Output is correct
40	Correct	103 ms	3520 KB	Output is correct
41	Correct	22 ms	1988 KB	Output is correct

Subtask #3
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	292 KB	Output is correct
12	Correct	326 ms	6612 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	7 ms	780 KB	Output is correct
15	Correct	20 ms	1228 KB	Output is correct
16	Correct	317 ms	6632 KB	Output is correct
17	Correct	353 ms	6588 KB	Output is correct
18	Incorrect	133 ms	26852 KB	Too many queries
19	Halted	0 ms	0 KB	-

Subtask #4
0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	314 ms	6592 KB	Output is correct
9	Correct	2 ms	460 KB	Output is correct
10	Correct	24 ms	1988 KB	Output is correct
11	Correct	49 ms	3520 KB	Output is correct
12	Correct	13 ms	1100 KB	Output is correct
13	Incorrect	51 ms	12732 KB	Too many queries
14	Halted	0 ms	0 KB	-

Subtask #5
0 / 34.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	292 KB	Output is correct
24	Correct	326 ms	6612 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	7 ms	780 KB	Output is correct
27	Correct	20 ms	1228 KB	Output is correct
28	Correct	1 ms	204 KB	Output is correct
29	Correct	314 ms	6592 KB	Output is correct
30	Correct	2 ms	460 KB	Output is correct
31	Correct	24 ms	1988 KB	Output is correct
32	Correct	49 ms	3520 KB	Output is correct
33	Correct	13 ms	1100 KB	Output is correct
34	Correct	330 ms	6636 KB	Output is correct
35	Correct	347 ms	6592 KB	Output is correct
36	Correct	384 ms	6580 KB	Output is correct
37	Correct	6 ms	780 KB	Output is correct
38	Correct	263 ms	6528 KB	Output is correct
39	Correct	50 ms	3520 KB	Output is correct
40	Correct	103 ms	3520 KB	Output is correct
41	Correct	22 ms	1988 KB	Output is correct
42	Correct	317 ms	6632 KB	Output is correct
43	Correct	353 ms	6588 KB	Output is correct
44	Incorrect	133 ms	26852 KB	Too many queries
45	Halted	0 ms	0 KB	-

답안 #436162

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