oj.uz

답안 #804006

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
804006 2023-08-03T06:50:45 Z 반딧불(#10100) Shifty Grid (CCO17_shifty) C++17
5 / 25
 8 ms 1172 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int n, m;
int arr[102][102];
int idxX[10002], idxY[10002];

struct dat{
    int a, b, c;
    dat(){}
    dat(int a, int b, int c): a(a), b(b), c(c){}
};
vector<dat> ans;

int tmp[102];

void rotateRow(int i, int c){
    for(int j=0; j<m; j++) tmp[j] = arr[i][j];
    for(int j=0; j<m; j++){
        arr[i][j] = tmp[(j+m-c)%m];
        idxX[arr[i][j]] = i, idxY[arr[i][j]] = j;
    }
    ans.push_back(dat(1, i, c));
}

void rotateColumn(int j, int c){
    for(int i=0; i<n; i++) tmp[i] = arr[i][j];
    for(int i=0; i<n; i++){
        arr[i][j] = tmp[(i+n-c)%n];
        idxX[arr[i][j]] = i, idxY[arr[i][j]] = j;
    }
    ans.push_back(dat(2, j, c));
}

void sendU(int sx, int sy, int ex, int ey){
    if(sx==ex && sy==ey) return;
    if(sx != ex && sy != ey){
        rotateColumn(ey, (sx-ex+n)%n);
        rotateRow(sx, (ey-sy+m)%m);
        rotateColumn(ey, (ex-sx+n)%n);
        rotateRow(sx, (sy-ey+m)%m);
    }
    else if(sy == ey){
        rotateRow(sx, m-1);
        rotateColumn(ey, (sx-ex+n)%n);
        rotateRow(sx, 1);
        rotateColumn(ey, (ex-sx+n)%n);
    }
    else{
        rotateColumn(sy, n-1);
        rotateRow(ex, (sy-ey+m)%m);
        rotateColumn(sy, 1);
        rotateRow(ex, (ey-sy+m)%m);
    }
}

void sendL(int sx, int sy, int ex, int ey){
    if(sx==ex && sy==ey) return;
    if(sx != ex && sy != ey){
        rotateRow(ex, (sy-ey+m)%m);
        rotateColumn(sy, (ex-sx+n)%n);
        rotateRow(ex, (ey-sy+m)%m);
        rotateColumn(sy, (sx-ex+n)%n);
    }
    else if(sx == ex){
        int a = 1, b = n-1;
        if(sx == n-2) a = n-1, b = 1;
        rotateColumn(sy, a);
        rotateRow(ex, (sy-ey+m)%m);
        rotateColumn(sy, b);
        rotateRow(ex, (ey-sy+m)%m);
    }
    else{
        rotateRow(sx, m-1);
        rotateColumn(ey, (sx-ex+n)%n);
        rotateRow(sx, 1);
        rotateColumn(ey, (ex-sx+n)%n);
    }
}

int main(){
    scanf("%d %d", &n, &m);
    for(int i=0; i<n; i++){
        for(int j=0; j<m; j++){
            scanf("%d", &arr[i][j]);
//            arr[i][j] = i*m+j;
//            if(arr[i][j] <= 1) arr[i][j] = !arr[i][j];
            idxX[arr[i][j]] = i, idxY[arr[i][j]] = j;
        }
    }

    int cnt = 0;
    again:
    for(int i=0; i<n-2; i++){
        for(int j=0; j<m; j++){
            sendU(idxX[i*m+j], idxY[i*m+j], i, j);
        }
    }

    for(int j=0; j<m-2; j++){
        for(int i=n-2; i<n; i++){
            sendL(idxX[i*m+j], idxY[i*m+j], i, j);
        }
    }

    sendU(idxX[(n-2)*m+(m-2)], idxY[(n-2)*m+(m-2)], n-2, m-2);
    sendU(idxX[(n-2)*m+(m-1)], idxY[(n-2)*m+(m-1)], n-2, m-1);

    if(arr[n-1][m-1] != n*m-1 && cnt == 0){
        rotateRow(0, 1);
        cnt++;
        goto again;
    }

    for(int i=0; i<n; i++){
        for(int j=0; j<m; j++){
//            printf("%2d ", arr[i][j]);
            assert(arr[i][j] == i*m+j);
        }
//        puts("");
    }

    printf("%d\n", (int)ans.size());
    for(dat p: ans) printf("%d %d %d\n", p.a, p.b+1, p.c);
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:85:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   85 |     scanf("%d %d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~
Main.cpp:88:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   88 |             scanf("%d", &arr[i][j]);
      |             ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Runtime error 8 ms 1172 KB Execution killed with signal 6
7 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Runtime error 8 ms 1172 KB Execution killed with signal 6
19 Halted 0 ms 0 KB -