oj.uz

Submission #934845

# Submission time Handle Problem Language Result Execution time Memory
934845 2024-02-28T05:26:35 Z thunopro Meetings (JOI19_meetings) C++14
17 / 100
 1646 ms 624 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 Solve ( int N ) ; 

//int main () 
//{
//	ios_base::sync_with_stdio(0); 
//	cin.tie(0);cout.tie(0); 
////	rf () ; 
//}
void Solve ( int N ) 
{
	n = N ; 
	for ( int i = 0 ; i < n ; i ++ ) 
	{
		for ( int j = i+1 ; j < n ; j ++ ) 
		{
			int cnt = 0 ; 
			for ( int k = 0 ; k < n ; k ++ ) 
			{
				if ( k == i || k == j ) continue ; 
				int t = Query (i,j,k) ; 
				if ( t == i || t == j ) cnt ++ ; 
				if ( cnt == n - 2 ) Bridge (i,j) ; 
			}
		}
	}
}

Compilation message

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 1 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 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 1 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 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 21 ms 344 KB Output is correct
15 Correct 20 ms 344 KB Output is correct
16 Correct 19 ms 344 KB Output is correct
17 Correct 24 ms 344 KB Output is correct
18 Correct 22 ms 480 KB Output is correct
19 Correct 20 ms 344 KB Output is correct
20 Correct 18 ms 344 KB Output is correct
21 Correct 23 ms 344 KB Output is correct
22 Correct 19 ms 344 KB Output is correct
23 Correct 24 ms 344 KB Output is correct
24 Correct 30 ms 344 KB Output is correct
25 Correct 30 ms 344 KB Output is correct
26 Correct 29 ms 344 KB Output is correct

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 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 21 ms 344 KB Output is correct
15 Correct 20 ms 344 KB Output is correct
16 Correct 19 ms 344 KB Output is correct
17 Correct 24 ms 344 KB Output is correct
18 Correct 22 ms 480 KB Output is correct
19 Correct 20 ms 344 KB Output is correct
20 Correct 18 ms 344 KB Output is correct
21 Correct 23 ms 344 KB Output is correct
22 Correct 19 ms 344 KB Output is correct
23 Correct 24 ms 344 KB Output is correct
24 Correct 30 ms 344 KB Output is correct
25 Correct 30 ms 344 KB Output is correct
26 Correct 29 ms 344 KB Output is correct
27 Incorrect 200 ms 476 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -

Subtask #4
0 / 71.0

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