# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
233700 | Coroian_David | Parrots (IOI11_parrots) | C++11 | 2100 ms | 129144 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 "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
using namespace std;
int n;
int OK = 0;
void aduan2(int a[], int b[])
{
// cout << " ADUN " << a[0] << " " << b[0] << "\n";
// cout << a[1] << " " << b[1] << " " << a[2] << " " << b[2] << "\n";
/*if(a[0] == 0)
{
memset(a, 0, sizeof(a));
for(int i = 0; i <= 199; i ++)
a[i] = 0;
}*/
int i = 1;
int t = 0;
for(i = 1; i <= max(a[0], b[0]) || t; i ++)
{
//if(OK)
//cout << " SUTNEM " << i << " " << a[i] << " " << b[i] << " " << t << "\n";
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |