oj.uz

Submission #236646

# Submission time Handle Problem Language Result Execution time Memory
236646 2020-06-02T17:05:11 Z MvC Meetings (JOI19_meetings) C++14
100 / 100
 963 ms 1144 KB 
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#include "meetings.h"
#define fr first
#define sc second
#define vec vector
#define pb push_back
#define pii pair<int, int>
#define forn(x,y) for(int x = 1 ; x <= (int)y ; ++x)
#define all(x) (x).begin(),(x).end()
#define fast cin.tie(0);cout.tie(0);cin.sync_with_stdio(0);cout.sync_with_stdio(0);
 
using namespace std;
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
 
typedef long long ll;
typedef unsigned int uint;
typedef complex<int> point;
const int nmax = 2005;
const ll linf = 1e18;
const ll mod = 998244353;
const int inf = INT_MAX;
 
vec < pii > eds;
int A,n,vz[nmax];
vector<int>vc[nmax];
/*int Query(int x,int y,int z)
{
	cout<<"Q "<<x<<" "<<y<<" "<<z<<endl;
	int rs;
	cin>>rs;
	return rs;
}*/
bool cmp(int x,int y)
{
	return Query(A,x,y)==x;
}
void solves(vec <int> tb){
	if(tb.size() == 1)return ;
	if(tb.size()==2)
	{
		eds.pb({tb[0],tb[1]});
		return;
	}
	srand(time(0));
	for(int i:tb)vc[i].clear(),vz[i]=0;
	int m=tb.size(),B;
	A=B=0;
	while(B == A)B = tb[rand()%m],A=tb[rand()%m];
	vector<int>pth;
	for(int i : tb){
		if(i != A && i != B && Query(A,B,i) == i) pth.pb(i);
	}
	pth.pb(B);
	sort(all(pth),cmp);
	reverse(all(pth));
	pth.pb(A);
	for(int i=1;i<pth.size();i++)eds.pb({pth[i-1],pth[i]});
	for(int i=0;i<pth.size();i++)vz[pth[i]]=1,vc[pth[i]].pb(pth[i]);
	for(int i : tb){
		if(!vz[i])
		{
			vc[Query(A,B,i)].pb(i);
		}
	}
	for(int i=0;i<pth.size();i++)
	{
		solves(vc[pth[i]]);
	}
}
void Solve(int n)
{
	vec < int > asd;
	for(int i= 0; i <n ;i++)asd.pb(i);
	solves(asd);
	for(pii ed : eds){
		Bridge(min(ed.fr,ed.sc),max(ed.fr,ed.sc));
	}
}
/*int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	cin>>n;
	
	return 0;
}*/

Compilation message

meetings.cpp: In function 'void solves(std::vector<int>)':
meetings.cpp:61:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=1;i<pth.size();i++)eds.pb({pth[i-1],pth[i]});
              ~^~~~~~~~~~~
meetings.cpp:62:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<pth.size();i++)vz[pth[i]]=1,vc[pth[i]].pb(pth[i]);
              ~^~~~~~~~~~~
meetings.cpp:69:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<pth.size();i++)
              ~^~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 759 ms 888 KB Output is correct
2 Correct 846 ms 888 KB Output is correct
3 Correct 808 ms 760 KB Output is correct
4 Correct 868 ms 816 KB Output is correct
5 Correct 663 ms 888 KB Output is correct
6 Correct 576 ms 888 KB Output is correct
7 Correct 758 ms 764 KB Output is correct
8 Correct 784 ms 888 KB Output is correct
9 Correct 887 ms 888 KB Output is correct
10 Correct 816 ms 904 KB Output is correct
11 Correct 958 ms 888 KB Output is correct
12 Correct 679 ms 888 KB Output is correct
13 Correct 685 ms 780 KB Output is correct
14 Correct 901 ms 888 KB Output is correct
15 Correct 580 ms 888 KB Output is correct
16 Correct 693 ms 992 KB Output is correct
17 Correct 840 ms 888 KB Output is correct
18 Correct 848 ms 960 KB Output is correct
19 Correct 669 ms 804 KB Output is correct
20 Correct 714 ms 864 KB Output is correct
21 Correct 808 ms 888 KB Output is correct
22 Correct 853 ms 888 KB Output is correct
23 Correct 652 ms 888 KB Output is correct
24 Correct 740 ms 1016 KB Output is correct
25 Correct 706 ms 888 KB Output is correct
26 Correct 732 ms 840 KB Output is correct
27 Correct 643 ms 888 KB Output is correct
28 Correct 963 ms 1016 KB Output is correct
29 Correct 791 ms 896 KB Output is correct
30 Correct 821 ms 1016 KB Output is correct
31 Correct 804 ms 888 KB Output is correct
32 Correct 938 ms 1144 KB Output is correct
33 Correct 718 ms 888 KB Output is correct
34 Correct 15 ms 512 KB Output is correct
35 Correct 13 ms 512 KB Output is correct
36 Correct 13 ms 512 KB Output is correct
37 Correct 13 ms 512 KB Output is correct
38 Correct 11 ms 512 KB Output is correct
39 Correct 15 ms 512 KB Output is correct
40 Correct 22 ms 512 KB Output is correct
41 Correct 22 ms 512 KB Output is correct
42 Correct 20 ms 516 KB Output is correct
43 Correct 11 ms 512 KB Output is correct
44 Correct 14 ms 512 KB Output is correct
45 Correct 17 ms 512 KB Output is correct
46 Correct 14 ms 512 KB Output is correct
47 Correct 5 ms 512 KB Output is correct
48 Correct 5 ms 384 KB Output is correct
49 Correct 5 ms 384 KB Output is correct
50 Correct 5 ms 384 KB Output is correct
51 Correct 5 ms 384 KB Output is correct
52 Correct 5 ms 384 KB Output is correct
53 Correct 5 ms 512 KB Output is correct
54 Correct 5 ms 384 KB Output is correct
55 Correct 5 ms 384 KB Output is correct
56 Correct 5 ms 384 KB Output is correct
57 Correct 5 ms 512 KB Output is correct
58 Correct 5 ms 384 KB Output is correct
59 Correct 5 ms 512 KB Output is correct
60 Correct 4 ms 384 KB Output is correct
61 Correct 4 ms 384 KB Output is correct
62 Correct 4 ms 384 KB Output is correct
63 Correct 4 ms 384 KB Output is correct
64 Correct 5 ms 384 KB Output is correct
65 Correct 4 ms 512 KB Output is correct
66 Correct 4 ms 384 KB Output is correct
67 Correct 4 ms 384 KB Output is correct
68 Correct 4 ms 384 KB Output is correct
69 Correct 5 ms 384 KB Output is correct
70 Correct 5 ms 384 KB Output is correct
71 Correct 4 ms 384 KB Output is correct
72 Correct 4 ms 384 KB Output is correct