# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
14036 | 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];
run[0]=true;
run[1]=prev[0];
run[2]=prev[1];
run[3]=prev[2]&&prev[1];
if(prev[3]&&run[3]) ++score;
}
int main()
{
int i,th;
scanf("%d",&n);
for(i=0;i<n;++i){
scanf("%d",&th);
switch(th){
case 1:
if(++cnt==4) mov();
break;
case 2:
mov();
break;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |