Submission #934842

#	Time	Username	Problem	Language	Result	Execution time	Memory
934842		thunopro	Meetings (JOI19_meetings)	C++14	0 / 100	1 ms	600 KiB

meetings

#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 ) ; 
int Bridge ( int i , int j ) ; 
int Solve ( int N ) ; 

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

Compilation message (stderr)

meetings.cpp: In function 'int Solve(int)':
meetings.cpp:70:1: warning: no return statement in function returning non-void [-Wreturn-type]
   70 | }
      | ^
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: 0 / 7
• Subtask 2: 0 / 10
• Subtask 3: 0 / 12
• Subtask 4: 0 / 71