제출 #732880

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
732880		flappybird	단층 (JOI16_ho_t5)	C++17	34 / 100	2062 ms	9408 KiB

2016_ho_t5

#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define MAX 201010
#define MAXS 20
#define INF 1000000000000000001
#define bb ' '
#define ln '\n'
#define Ln '\n'
ll X[MAX];
ll Y[MAX];
ll P[MAX];
int D[MAX];
ll L[MAX];
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int N, Q;
	cin >> N >> Q;
	int i, j;
	for (i = 1; i <= Q; i++) cin >> P[i] >> D[i] >> L[i];
	for (i = 1; i <= N; i++) X[i] = Y[i] = i;
	for (i = Q; i >= 1; i--) {
		if (D[i] == 1) { for (j = 1; j <= N; j++) if (X[j] <= P[i]) Y[j] -= L[i] * 2; }
		else { for (j = 1; j <= N; j++) if (Y[j] > P[i]) X[j] += L[i] * 2; }
	}
	for (i = 1; i <= N; i++) cout << (X[i] - Y[i]) / 2ll << ln;
}

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