/*
||-----------------------------------||
|| Rahat Khan Pathan ||
|| BGC Trust University ||
|| Department of CSE ||
||-----------------------------------||
*/
#include<bits/stdc++.h>
#include "grader.h"
#include "cluedo.h"
#define ll long long int
#define pub push_back
#define pi 3.14159265359
#define vll vector<ll>
#define All(X) (X).begin(),(X).end()
#define Unique(X) (X).erase(unique(All(X)),(X).end()))
#define fast ios_base::sync_with_stdio(0); cin.tie(0);
#define pi pair<ll,ll>
#define vpair vector<pair<ll,ll> >
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
#define minus cout<<-1<<endl
using namespace std;
void Solve()
{
ll i=1,j=1,k=1,x;
while(1)
{
x=Theory(i,j,k);
if(x==1)
i++;
else if(x==2)
j++;
else if(x==3)
k++;
else break;
}
return;
}
Compilation message
cluedo.cpp:18: warning: "pi" redefined
18 | #define pi pair<ll,ll>
|
cluedo.cpp:13: note: this is the location of the previous definition
13 | #define pi 3.14159265359
|
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
11 ms |
200 KB |
Output is correct |
2 |
Correct |
13 ms |
200 KB |
Output is correct |
3 |
Correct |
13 ms |
200 KB |
Output is correct |
4 |
Correct |
13 ms |
200 KB |
Output is correct |
5 |
Correct |
10 ms |
200 KB |
Output is correct |
6 |
Correct |
9 ms |
200 KB |
Output is correct |
7 |
Correct |
11 ms |
200 KB |
Output is correct |
8 |
Correct |
13 ms |
200 KB |
Output is correct |
9 |
Correct |
14 ms |
200 KB |
Output is correct |
10 |
Correct |
10 ms |
200 KB |
Output is correct |
11 |
Correct |
10 ms |
200 KB |
Output is correct |
12 |
Correct |
15 ms |
200 KB |
Output is correct |
13 |
Correct |
12 ms |
200 KB |
Output is correct |
14 |
Correct |
5 ms |
200 KB |
Output is correct |
15 |
Correct |
10 ms |
200 KB |
Output is correct |
16 |
Correct |
6 ms |
200 KB |
Output is correct |
17 |
Correct |
12 ms |
200 KB |
Output is correct |
18 |
Correct |
12 ms |
200 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
12 ms |
200 KB |
Output is correct |
2 |
Correct |
5 ms |
280 KB |
Output is correct |
3 |
Correct |
10 ms |
200 KB |
Output is correct |
4 |
Correct |
9 ms |
200 KB |
Output is correct |
5 |
Correct |
14 ms |
200 KB |
Output is correct |
6 |
Correct |
10 ms |
200 KB |
Output is correct |
7 |
Correct |
9 ms |
200 KB |
Output is correct |
8 |
Correct |
10 ms |
200 KB |
Output is correct |
9 |
Correct |
7 ms |
200 KB |
Output is correct |
10 |
Correct |
13 ms |
200 KB |
Output is correct |
11 |
Correct |
10 ms |
200 KB |
Output is correct |
12 |
Correct |
11 ms |
200 KB |
Output is correct |
13 |
Correct |
13 ms |
200 KB |
Output is correct |
14 |
Correct |
12 ms |
200 KB |
Output is correct |
15 |
Correct |
10 ms |
200 KB |
Output is correct |
16 |
Correct |
16 ms |
200 KB |
Output is correct |
17 |
Correct |
10 ms |
200 KB |
Output is correct |
18 |
Correct |
13 ms |
200 KB |
Output is correct |