Submission #921507

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
921507	2024-02-04T03:30:39 Z	1075508020060209tc	Meetings (JOI19_meetings)	C++14	17 / 100	1252 ms	628 KB

meetings

#pragma GCC optimize("O3")
#include "meetings.h"
#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define X first
#define Y second
#define SZ(x) (int)(x).size()

map<vector<int>,int>mp;
int n;
pair<int,int>slv(int st,int en){
int ret=en;
for(int i=1;i<=n;i++){
    if(i==st||i==ret){continue;}
    int v=Query(st-1,i-1,ret-1);
    v++;
    if(v==st||v==ret){continue;}
    ret=v;
}
return {min(st,ret)-1,max(st,ret)-1};
}


void Solve(int N){
set<pair<int,int>>ans;
n=N;
for(int i=1;i<=n;i++){
    for(int j=i+1;j<=n;j++){
        ans.insert(slv(i,j));
    }
}
for(auto it=ans.begin();it!=ans.end();it++){
    Bridge((*it).first, (*it).second );
}
}
/*
signed main(){


}
*/

Subtask #1

7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct

Subtask #2

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	16 ms	344 KB	Output is correct
15	Correct	13 ms	484 KB	Output is correct
16	Correct	12 ms	344 KB	Output is correct
17	Correct	14 ms	344 KB	Output is correct
18	Correct	15 ms	344 KB	Output is correct
19	Correct	12 ms	344 KB	Output is correct
20	Correct	10 ms	480 KB	Output is correct
21	Correct	11 ms	344 KB	Output is correct
22	Correct	11 ms	344 KB	Output is correct
23	Correct	16 ms	344 KB	Output is correct
24	Correct	24 ms	480 KB	Output is correct
25	Correct	25 ms	344 KB	Output is correct
26	Correct	26 ms	344 KB	Output is correct

Subtask #3

0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	16 ms	344 KB	Output is correct
15	Correct	13 ms	484 KB	Output is correct
16	Correct	12 ms	344 KB	Output is correct
17	Correct	14 ms	344 KB	Output is correct
18	Correct	15 ms	344 KB	Output is correct
19	Correct	12 ms	344 KB	Output is correct
20	Correct	10 ms	480 KB	Output is correct
21	Correct	11 ms	344 KB	Output is correct
22	Correct	11 ms	344 KB	Output is correct
23	Correct	16 ms	344 KB	Output is correct
24	Correct	24 ms	480 KB	Output is correct
25	Correct	25 ms	344 KB	Output is correct
26	Correct	26 ms	344 KB	Output is correct
27	Incorrect	128 ms	480 KB	Wrong Answer [2]
28	Halted	0 ms	0 KB	-

Subtask #4

0 / 71.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1252 ms	628 KB	Wrong Answer [2]
2	Halted	0 ms	0 KB	-