# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
9775 | pichulia | Solve another chuck (kriii2_S) | C++98 | 12 ms | 73848 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<stdio.h>
#include<algorithm>
using namespace std;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
int n, m;
int a[2003][2003];
int b[2003][2003];
piii aa[400001];
int ss[400001];
int aal;
int c[2003];
int res;
piii ra[3000009];
int al;
int sum;
void print(piii x)
{
if(x.second == 0){
printf("rotS %d %d\n",x.first.first+1, x.first.second);
}
if(x.second == 1){
printf("rotR %d %d\n",x.first.first+1, x.first.second);
}
if(x.second == 2){
printf("negR %d\n",x.first.first+1);
}
if(x.second == 3){
printf("negS %d\n",x.first.first+1);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |