제출 #1157600

#제출 시각아이디문제언어결과실행 시간메모리
1157600mocha단층 (JOI16_ho_t5)C++20
18 / 100
1 ms1096 KiB
#include <bits/stdc++.h> #define int long long using namespace std; const int mx = 105; int n, q; int a[mx][mx<<3]; signed main() { cin >> n >> q; for (int i=0;i<mx;i++) { for (int j=1;j<mx<<3;j++) { a[i][j] = i; } } while (q--) { int x, d, l; cin >> x >> d >> l; assert(l==1); if (d == 1) { for (int i=0;i<mx-1;i++) { for (int j=1;j<=x;j++) { a[i][j] = a[i+1][j]; } } } else { for (int i=mx-1;i>x;i--) { int x = i, y = 0; while (x+2 < mx<<3 and y+1 < mx) { if (y>=0 and x >= 0) a[y][x] = a[y+1][x+2]; x+=2; y++; } } } } for (int i=1;i<=n;i++) cout << a[0][i] << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...