| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 563201 |
2022-05-16T13:36:48 Z |
zaneyu |
Cluedo (IOI10_cluedo) |
C++14 |
|
15 ms |
208 KB |
#include "grader.h"
#include "cluedo.h"
/*input
1
7 22
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld long double
#define pii pair<int,int>
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=1e4+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int MOD=1e9+7;
const int INF=0x3f3f3f3f;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())+1
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
out<<P.f<<' '<<P.s;
return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?" ":"");
return out;
}
ll mult(ll a,ll b){
if(a<0) a+=MOD;
return (a*b)%MOD;
}
ll mypow(ll a,ll b){
if(b<=0) return 1;
ll res=1LL;
while(b){
if(b&1) res=mult(res,a);
a=mult(a,a);
b>>=1;
}
return res;
}
int arr[4];
void Solve(){
arr[1]=arr[2]=arr[3]=1;
int k=Theory(1,1,1);
while(k){
arr[k]++;
k=Theory(arr[1],arr[2],arr[3]);
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
208 KB |
Output is correct |
| 2 |
Correct |
9 ms |
208 KB |
Output is correct |
| 3 |
Correct |
9 ms |
208 KB |
Output is correct |
| 4 |
Correct |
7 ms |
208 KB |
Output is correct |
| 5 |
Correct |
8 ms |
208 KB |
Output is correct |
| 6 |
Correct |
7 ms |
208 KB |
Output is correct |
| 7 |
Correct |
9 ms |
208 KB |
Output is correct |
| 8 |
Correct |
10 ms |
208 KB |
Output is correct |
| 9 |
Correct |
9 ms |
208 KB |
Output is correct |
| 10 |
Correct |
5 ms |
208 KB |
Output is correct |
| 11 |
Correct |
12 ms |
208 KB |
Output is correct |
| 12 |
Correct |
9 ms |
208 KB |
Output is correct |
| 13 |
Correct |
8 ms |
208 KB |
Output is correct |
| 14 |
Correct |
5 ms |
208 KB |
Output is correct |
| 15 |
Correct |
9 ms |
208 KB |
Output is correct |
| 16 |
Correct |
7 ms |
208 KB |
Output is correct |
| 17 |
Correct |
10 ms |
208 KB |
Output is correct |
| 18 |
Correct |
9 ms |
208 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
10 ms |
208 KB |
Output is correct |
| 2 |
Correct |
10 ms |
208 KB |
Output is correct |
| 3 |
Correct |
5 ms |
208 KB |
Output is correct |
| 4 |
Correct |
9 ms |
208 KB |
Output is correct |
| 5 |
Correct |
5 ms |
208 KB |
Output is correct |
| 6 |
Correct |
6 ms |
208 KB |
Output is correct |
| 7 |
Correct |
9 ms |
208 KB |
Output is correct |
| 8 |
Correct |
12 ms |
208 KB |
Output is correct |
| 9 |
Correct |
10 ms |
208 KB |
Output is correct |
| 10 |
Correct |
10 ms |
208 KB |
Output is correct |
| 11 |
Correct |
11 ms |
208 KB |
Output is correct |
| 12 |
Correct |
13 ms |
208 KB |
Output is correct |
| 13 |
Correct |
15 ms |
208 KB |
Output is correct |
| 14 |
Correct |
9 ms |
208 KB |
Output is correct |
| 15 |
Correct |
9 ms |
208 KB |
Output is correct |
| 16 |
Correct |
10 ms |
208 KB |
Output is correct |
| 17 |
Correct |
10 ms |
208 KB |
Output is correct |
| 18 |
Correct |
14 ms |
208 KB |
Output is correct |
