제출 #775631

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
775631		hgmhc	단층 (JOI16_ho_t5)	C++17	18 / 100	2 ms	716 KiB

2016_ho_t5

#include <bits/stdc++.h>
#define rep(i,a,b) for (auto i = (a); i <= (b); ++i)
#define per(i,a,b) for (auto i = (b); i >= (a); --i)
#define all(x) begin(x),end(x)
#define siz(x) int((x).size())
#define Mup(x,y) x = max(x,y)
#define mup(x,y) x = min(x,y)
#define dbg(...) fprintf(stderr,__VA_ARGS__)
#define fi first
#define se second
using namespace std; using ll = long long; using ii = pair<int,int>;

const int N = 103;
int n, q;
int b[N][3*N];

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> q;
    rep(i,0,N-1) fill(b[i],b[i+1],i);
    rep(i,1,q) {
        int x, d, l;
        cin >> x >> d >> l;
        if (d == 1) {
            rep(k,0,N-2) {
                rep(j,1,N+x-1-k) {
                    b[k][j] = b[k+1][j-1];
                }
            }
        } else {
            rep(k,0,N-2) {
                rep(j,N+x+k,3*N-2) {
                    b[k][j] = b[k+1][j+1];
                }
            }
        }
        // rep(i,0,n) {
        //     rep(j,N,N+n) dbg("%d ", b[i][j]);
        //     dbg("\n");
        // }
        // dbg("----------------------\n");
    }
    rep(i,N,N+n-1) {
        printf("%d\n", b[0][i]);
    }
}

• Subtask 1: 18 / 18
• Subtask 2: 0 / 16
• Subtask 3: 0 / 66