oj.uz

Submission #151437

# Submission time Handle Problem Language Result Execution time Memory
151437 2019-09-03T05:09:36 Z username Meetings (JOI19_meetings) C++14
0 / 100
 48 ms 504 KB 
#include "meetings.h"
#define VIS(it,con) for(auto it=con.begin();it!=con.end();++it)
#include<bits/stdc++.h>
//#define int int_fast64_t
using namespace std;
typedef pair<int,int> pii;
#define REP(i,j,k) for(register int i=(j);i<(k);++i)
#define RREP(i,j,k) for(register int i=int(j)-1;i>=(k);--i)
#define ALL(a) a.begin(),a.end()
#define pb push_back
#define f first
#define s second
#define de(...) cerr<<__VA_ARGS__
#define ar(a,s,t) {REP(__i,s,t)de(a[__i]<<' ');de(endl);}

mt19937 rd(time(0));
int o;
map<pii,int>rec;

int qr(int a,int b){
	if(rec.count({a,b}))return rec[{a,b}];
	int ret=Query(o+1,a+1,b+1)-1;
	rec[{a,b}]=ret;
	return ret;
}

void solve(int rt,vector<int>v){
	if(v.size()==1)return;
	int u=rt;
	while(u==rt)u=v[rd()%v.size()];
	map<int,vector<int>>mp;
	REP(i,0,v.size())mp[qr(u,v[i])].pb(v[i]);
	vector<int>path;
	VIS(it,mp){
		solve(it->f,it->s);
		path.pb(it->f);
	}
	sort(ALL(path),[](int a,int b){return qr(a,b)==a;});
	REP(i,1,path.size())Bridge(path[i-1],path[i]);
}

void Solve(int n){
	o=rd()%n;
	vector<int>v;
	REP(i,0,n)v.pb(i);
	solve(o,v);
}

Compilation message

meetings.cpp: In function 'void solve(int, std::vector<int>)':
meetings.cpp:7:44: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,j,k) for(register int i=(j);i<(k);++i)
                                            ^
meetings.cpp:32:2: note: in expansion of macro 'REP'
  REP(i,0,v.size())mp[qr(u,v[i])].pb(v[i]);
  ^~~
meetings.cpp:7:44: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,j,k) for(register int i=(j);i<(k);++i)
                                            ^
meetings.cpp:39:2: note: in expansion of macro 'REP'
  REP(i,1,path.size())Bridge(path[i-1],path[i]);
  ^~~

Subtask #1
0 / 7.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 12.0

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

Subtask #4
0 / 71.0

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