# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
14042 | paulsohn | 볼질 (OJUZ10_ballparade) | C++98 | 7 ms | 1084 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <algorithm>
using namespace std;
bool run[4], prev[4];
int n, score, cnt;
void mov(){
cnt=0;
for(int j=0;j<4;++j) prev[j]=run[j];
if(prev[3]){
if(prev[2]){
if(prev[1]){
++score;
run[3]=run[2]=run[1]=run[0]=true;
}
else run[1]=true;
}
else run[2]=true;
}
else{
if(prev[2] && prev[1]) run[3]=true;
else if(prev[1]) run[2]=true;
else run[1]=true;
}
}
int main()
{
int i,th;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |