# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
419899 | 2021-06-07T16:17:27 Z | Rahat_Khan_Pathan | Cluedo (IOI10_cluedo) | C++17 | 1 ms | 200 KB |
/* ||-----------------------------------|| || 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; x=Theory(i,j,k); while(1) { if(x==1) i++; else if(x==2) j++; else if(x==3) k++; else break; } return; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 200 KB | Incorrect |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 200 KB | Incorrect |
2 | Halted | 0 ms | 0 KB | - |