oj.uz

Submission #706738

# Submission time Handle Problem Language Result Execution time Memory
706738 2023-03-07T15:44:07 Z Antekb Meetings (JOI19_meetings) C++14
100 / 100
 755 ms 1216 KB 
#include "meetings.h"
#include<bits/stdc++.h>
 
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("trapv")
 
#define st first
#define nd second
#define pb push_back
#define eb emplace_back
#define pp(x) pop_back(x)
#define mp(a, b) make_pair(a, b)
#define all(x) (x).begin(), (x).end()
#define rev(x) reverse(all(x))
#define sor(x) sort(all(x))
#define sz(x) (int)(x).size()
#define rsz(x) resize(x)
 
using namespace std;
 
///~~~~~~~~~~~~~~~~~~~~~~~~~~
 
template <typename H, typename T> 
ostream& operator<<(ostream& os, pair<H, T> m){
	return os <<"("<< m.st<<", "<<m.nd<<")";
}
template <typename H> 
ostream& operator<<(ostream& os, vector<H> V){
	os<<"{";
	for(int i=0; i<V.size(); i++){
		if(i)os<<" ";
		os<<V[i];
	}
	os<<"}";
	return os;
}
 
void debug(){cerr<<"\n";}
template <typename H, typename... T>
void debug(H h, T... t) {cerr<<h; if (sizeof...(t)) cerr << ", "; debug(t...);}
#define deb(x...) cerr<<#x<<" = ";debug(x);
//#define deb(x...) ;
 
///~~~~~~~~~~~~~~~~~~~~~~~~~
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii > vii;
typedef vector<ll> vl;
typedef vector<pll> vll;
typedef string str;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

 
#define BOOST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
 
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
int P;
void bridge(int a, int b){
	if(a>b)swap(a, b);
	Bridge(a, b);
}
void solve(vi V){
	deb(V);
	int n=V.size();
	if(n==2)bridge(V[0], V[1]);
	if(n<=2)return;
	swap(V[0], V[rng()%n]);
	swap(V[n-1], V[1+(rng()%(n-1))]);
	int pp=V[0], kk=V[n-1];
	deb(pp, kk);
	vii V2(n);
	for(int i=0; i<n; i++){
		if(i==0 || i+1==n)V2[i]=mp(V[i], V[i]);
		else V2[i]=mp(Query(V[0], V[i], V[n-1]), V[i]);
	}
	V.clear();
	sor(V2);
	vi V3;
	deb("a");
	for(int i=0; i<=n; i++){
		if(i==n || (i && V2[i].st!=V2[i-1].st)){
			deb(V3);
			solve(V3);
			if(V2[i-1].st!=pp && V2[i-1].st!=kk)V.pb(V2[i-1].st);
			V3.clear();
		}
		if(i!=n)V3.pb(V2[i].nd);
	}
	P=pp;
	sort(V.begin(), V.end(), [](int a, int b){if(Query(P, a, b)==a)return 1;else return 0;});
	for(int i=1; i<V.size(); i++){
		bridge(V[i], V[i-1]);
	}
	if(V.size()){
		bridge(pp, V[0]);
		bridge(V.back(), kk);
	}
	else bridge(pp, kk);
}
void Solve(int N) {
	vi V(N);
	iota(all(V), 0);
	solve(V);
}

Compilation message

meetings.cpp: In function 'void solve(vi)':
meetings.cpp:101:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |  for(int i=1; i<V.size(); i++){
      |               ~^~~~~~~~~
meetings.cpp: In instantiation of 'std::ostream& operator<<(std::ostream&, std::vector<_Tp>) [with H = int; std::ostream = std::basic_ostream<char>]':
meetings.cpp:40:30:   required from 'void debug(H, T ...) [with H = std::vector<int>; T = {}]'
meetings.cpp:73:2:   required from here
meetings.cpp:30:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |  for(int i=0; i<V.size(); i++){
      |               ~^~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 382 ms 848 KB Output is correct
2 Correct 567 ms 900 KB Output is correct
3 Correct 438 ms 828 KB Output is correct
4 Correct 408 ms 760 KB Output is correct
5 Correct 332 ms 868 KB Output is correct
6 Correct 346 ms 792 KB Output is correct
7 Correct 453 ms 1096 KB Output is correct
8 Correct 466 ms 976 KB Output is correct
9 Correct 445 ms 968 KB Output is correct
10 Correct 495 ms 1008 KB Output is correct
11 Correct 474 ms 1100 KB Output is correct
12 Correct 473 ms 828 KB Output is correct
13 Correct 328 ms 852 KB Output is correct
14 Correct 326 ms 852 KB Output is correct
15 Correct 332 ms 840 KB Output is correct
16 Correct 320 ms 820 KB Output is correct
17 Correct 476 ms 940 KB Output is correct
18 Correct 328 ms 840 KB Output is correct
19 Correct 350 ms 824 KB Output is correct
20 Correct 411 ms 976 KB Output is correct
21 Correct 423 ms 904 KB Output is correct
22 Correct 384 ms 824 KB Output is correct
23 Correct 473 ms 948 KB Output is correct
24 Correct 372 ms 784 KB Output is correct
25 Correct 500 ms 964 KB Output is correct
26 Correct 394 ms 832 KB Output is correct
27 Correct 346 ms 968 KB Output is correct
28 Correct 569 ms 1216 KB Output is correct
29 Correct 454 ms 968 KB Output is correct
30 Correct 501 ms 932 KB Output is correct
31 Correct 546 ms 984 KB Output is correct
32 Correct 755 ms 784 KB Output is correct
33 Correct 476 ms 852 KB Output is correct
34 Correct 15 ms 336 KB Output is correct
35 Correct 15 ms 388 KB Output is correct
36 Correct 14 ms 396 KB Output is correct
37 Correct 16 ms 424 KB Output is correct
38 Correct 14 ms 412 KB Output is correct
39 Correct 21 ms 400 KB Output is correct
40 Correct 24 ms 384 KB Output is correct
41 Correct 28 ms 436 KB Output is correct
42 Correct 29 ms 456 KB Output is correct
43 Correct 13 ms 420 KB Output is correct
44 Correct 17 ms 336 KB Output is correct
45 Correct 19 ms 400 KB Output is correct
46 Correct 14 ms 420 KB Output is correct
47 Correct 3 ms 336 KB Output is correct
48 Correct 2 ms 336 KB Output is correct
49 Correct 2 ms 336 KB Output is correct
50 Correct 2 ms 336 KB Output is correct
51 Correct 2 ms 336 KB Output is correct
52 Correct 3 ms 336 KB Output is correct
53 Correct 3 ms 336 KB Output is correct
54 Correct 3 ms 336 KB Output is correct
55 Correct 3 ms 336 KB Output is correct
56 Correct 2 ms 336 KB Output is correct
57 Correct 2 ms 336 KB Output is correct
58 Correct 1 ms 336 KB Output is correct
59 Correct 2 ms 336 KB Output is correct
60 Correct 0 ms 336 KB Output is correct
61 Correct 1 ms 336 KB Output is correct
62 Correct 1 ms 336 KB Output is correct
63 Correct 0 ms 336 KB Output is correct
64 Correct 1 ms 336 KB Output is correct
65 Correct 1 ms 336 KB Output is correct
66 Correct 1 ms 336 KB Output is correct
67 Correct 0 ms 336 KB Output is correct
68 Correct 1 ms 336 KB Output is correct
69 Correct 1 ms 336 KB Output is correct
70 Correct 1 ms 336 KB Output is correct
71 Correct 0 ms 336 KB Output is correct
72 Correct 0 ms 336 KB Output is correct