oj.uz

Submission #933239

# Submission time Handle Problem Language Result Execution time Memory
933239 2024-02-25T10:02:35 Z thunopro Cluedo (IOI10_cluedo) C++14
50 / 100
 108 ms 344 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 main () 
//{
//	ios_base::sync_with_stdio(0); 
//	cin.tie(0);cout.tie(0); 
//	rf () ; 
//}
int Theory(int, int, int);

void Solve () 
{
	for ( int i = 1 ; i <= 6 ; i ++ ) for ( int j = 1 ; j <= 10 ; j ++ ) for ( int k = 1 ; k <= 6 ; k ++ )
	{
		if ( Theory(i,j,k) == 0 ) return ; 
	}
}

Compilation message

cluedo.cpp: In function 'void rf()':
cluedo.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
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 344 KB Output is correct
2 Correct 76 ms 344 KB Output is correct
3 Correct 89 ms 344 KB Output is correct
4 Correct 87 ms 344 KB Output is correct
5 Correct 90 ms 344 KB Output is correct
6 Correct 76 ms 344 KB Output is correct
7 Correct 62 ms 344 KB Output is correct
8 Correct 107 ms 344 KB Output is correct
9 Correct 93 ms 344 KB Output is correct
10 Correct 95 ms 344 KB Output is correct
11 Correct 96 ms 344 KB Output is correct
12 Correct 59 ms 344 KB Output is correct
13 Correct 107 ms 344 KB Output is correct
14 Correct 108 ms 340 KB Output is correct
15 Correct 87 ms 344 KB Output is correct
16 Correct 80 ms 344 KB Output is correct
17 Correct 73 ms 344 KB Output is correct
18 Correct 98 ms 344 KB Output is correct

Subtask #2
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 92 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -