oj.uz

Submission #934858

# Submission time Handle Problem Language Result Execution time Memory
934858 2024-02-28T05:49:33 Z thunopro Meetings (JOI19_meetings) C++14
100 / 100
 497 ms 1152 KB 
#include<bits/stdc++.h>
using namespace std ; 
#define maxn 200009
#define ll long long 
#define pb push_back 
#define fi first 
#define se second 
#define left id<<1
#define right id<<1|1 
#define re exit(0); 
#define _lower(x) lower_bound(v.begin(),v.end(),x)-v.begin()+1
const int mod = 1e9+7 ;
const int INF = 1e9 ; 

typedef vector<int> vi ; 
typedef pair<int,int> pii ; 
typedef vector<pii> vii ; 

template < typename T > void chkmin ( T &a , T b ) { if ( a > b ) a = b ; } 
template < typename T > void chkmax ( T &a , T b ) { if ( a < b ) a = b ; } 

void add ( int &a , int b ) 
{
	a += b ; 
	if ( a >= mod ) a -= mod ; 
	if ( a < 0 ) a += mod ; 
}

void rf () 
{
	freopen ("bai1.inp","r",stdin) ;
}

int _pow ( int a , int n ) 
{
	if ( n == 0 ) return 1 ; 
	int res = _pow (a,n/2) ; 
	if ( n % 2 ) return 1ll*res*res%mod*a%mod ; 
	else return 1ll*res*res%mod ; 
}

int n ; 

int Query ( int i , int j , int k ) ; 
void Bridge ( int i , int j ) ; 

void Answer ( int x , int y ) 
{
	if ( x > y ) swap (x,y) ;
	Bridge (x,y) ; 
}

void Calc ( vi v ) 
{
	if ( v.size () == 1 ) return ; 
	random_shuffle (v.begin(),v.end()) ; 
	map <int,vi> m ; 
	m [v[0]] . pb (v[0]) , m [v[1]] . pb (v[1]) ; 
	vi path ; 
	for ( int i = 2 ; i < v.size () ; i ++ ) 
	{
		int x = Query (v[0],v[1],v[i]) ; 
		if ( !m.count(x) ) path . pb (x) ; 
		m [x] . pb (v[i]) ; 
	}
	sort (path.begin(),path.end(),[&](int x , int y )
	{
		return (Query (v[0],x,y) == x ) ; 
	});  
	int last = v[0] ; 
	for ( auto x : path ) Answer (last,x) , last = x ; 
	Answer (last,v[1]) ; 
	for ( auto it : m ) Calc (it.second) ;  
}

void Solve ( int N ) 
{
	n = N ; 
	vi all (n) ; 
	for ( int i = 0 ; i < n ; i ++ ) all [i] = i ; 
	Calc (all) ; 
}

Compilation message

meetings.cpp: In function 'void Calc(vi)':
meetings.cpp:60:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |  for ( int i = 2 ; i < v.size () ; i ++ )
      |                    ~~^~~~~~~~~~~
meetings.cpp: In function 'void rf()':
meetings.cpp:31:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

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 1 ms 344 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 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 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 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 1 ms 344 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 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 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 480 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct

Subtask #3
12.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 1 ms 344 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 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 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 480 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 3 ms 344 KB Output is correct
28 Correct 3 ms 344 KB Output is correct
29 Correct 3 ms 344 KB Output is correct
30 Correct 3 ms 344 KB Output is correct
31 Correct 2 ms 344 KB Output is correct
32 Correct 3 ms 344 KB Output is correct
33 Correct 4 ms 532 KB Output is correct
34 Correct 6 ms 344 KB Output is correct
35 Correct 6 ms 344 KB Output is correct
36 Correct 3 ms 344 KB Output is correct
37 Correct 6 ms 344 KB Output is correct
38 Correct 6 ms 344 KB Output is correct
39 Correct 8 ms 344 KB Output is correct

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 680 KB Output is correct
2 Correct 203 ms 1104 KB Output is correct
3 Correct 207 ms 664 KB Output is correct
4 Correct 217 ms 796 KB Output is correct
5 Correct 185 ms 692 KB Output is correct
6 Correct 174 ms 676 KB Output is correct
7 Correct 256 ms 676 KB Output is correct
8 Correct 280 ms 1132 KB Output is correct
9 Correct 295 ms 824 KB Output is correct
10 Correct 273 ms 940 KB Output is correct
11 Correct 316 ms 800 KB Output is correct
12 Correct 264 ms 848 KB Output is correct
13 Correct 174 ms 784 KB Output is correct
14 Correct 201 ms 600 KB Output is correct
15 Correct 175 ms 600 KB Output is correct
16 Correct 200 ms 700 KB Output is correct
17 Correct 279 ms 600 KB Output is correct
18 Correct 190 ms 796 KB Output is correct
19 Correct 200 ms 1108 KB Output is correct
20 Correct 177 ms 684 KB Output is correct
21 Correct 203 ms 696 KB Output is correct
22 Correct 262 ms 744 KB Output is correct
23 Correct 182 ms 600 KB Output is correct
24 Correct 186 ms 720 KB Output is correct
25 Correct 214 ms 684 KB Output is correct
26 Correct 194 ms 804 KB Output is correct
27 Correct 251 ms 752 KB Output is correct
28 Correct 392 ms 668 KB Output is correct
29 Correct 237 ms 828 KB Output is correct
30 Correct 295 ms 848 KB Output is correct
31 Correct 322 ms 980 KB Output is correct
32 Correct 497 ms 1152 KB Output is correct
33 Correct 306 ms 920 KB Output is correct
34 Correct 3 ms 344 KB Output is correct
35 Correct 3 ms 344 KB Output is correct
36 Correct 3 ms 344 KB Output is correct
37 Correct 3 ms 344 KB Output is correct
38 Correct 3 ms 344 KB Output is correct
39 Correct 3 ms 536 KB Output is correct
40 Correct 4 ms 532 KB Output is correct
41 Correct 8 ms 344 KB Output is correct
42 Correct 5 ms 344 KB Output is correct
43 Correct 3 ms 344 KB Output is correct
44 Correct 7 ms 344 KB Output is correct
45 Correct 6 ms 344 KB Output is correct
46 Correct 8 ms 344 KB Output is correct
47 Correct 0 ms 344 KB Output is correct
48 Correct 1 ms 344 KB Output is correct
49 Correct 0 ms 344 KB Output is correct
50 Correct 0 ms 344 KB Output is correct
51 Correct 1 ms 416 KB Output is correct
52 Correct 1 ms 344 KB Output is correct
53 Correct 0 ms 344 KB Output is correct
54 Correct 1 ms 344 KB Output is correct
55 Correct 0 ms 344 KB Output is correct
56 Correct 0 ms 344 KB Output is correct
57 Correct 0 ms 344 KB Output is correct
58 Correct 1 ms 344 KB Output is correct
59 Correct 1 ms 344 KB Output is correct
60 Correct 0 ms 344 KB Output is correct
61 Correct 0 ms 344 KB Output is correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 0 ms 344 KB Output is correct
64 Correct 0 ms 344 KB Output is correct
65 Correct 0 ms 344 KB Output is correct
66 Correct 0 ms 344 KB Output is correct
67 Correct 0 ms 344 KB Output is correct
68 Correct 0 ms 344 KB Output is correct
69 Correct 0 ms 344 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 0 ms 344 KB Output is correct
72 Correct 0 ms 344 KB Output is correct