# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
8433 | ainta | Solve another chuck (kriii2_S) | C++98 | 4 ms | 1732 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.
#pragma warning(disable:4996)
#include<stdio.h>
#include<algorithm>
using namespace std;
bool Neg[110][110], chk, Com[110], TNeg[110];
int n, m, w[110][110], Tw[110], cnt;
struct Answer{
int ck, x, d;
}Res[50010];
void Ins(int ck, int x, int d){
Res[cnt].ck = ck;
Res[cnt].x = x;
Res[cnt].d = d;
cnt++;
}
void Move(bool ck, int x, int d){
int i;
if (!ck){
d %= m;
for (i = m - d + 1; i <= m; i++){
Tw[i - m + d] = w[x][i];
TNeg[i - m + d] = Neg[x][i];
}
for (i = m; i != d; i--){
w[x][i] = w[x][i - d];
Neg[x][i] = Neg[x][i - d];
}
for (i = 1; i <= d; i++){
w[x][i] = Tw[i];
Neg[x][i] = TNeg[i];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |