Submission #12901167

---

Source Code Expand

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
/*---------------------------------------------------------------------------------------------------
　　　　　　　　　　　 ∧＿∧
　　　　　 ∧＿∧ 　（´<_｀ ）　 Welcome to My Coding Space!
　　　　 （ ´_ゝ`）　/　 ⌒i     @hamayanhamayan0
　　　　／　　　＼　 　  |　|
　　　 /　　 /￣￣￣￣/　　|
　 ＿_(__ﾆつ/　    ＿/ .| .|＿＿＿＿
　 　　　＼/＿＿＿＿/　（u　⊃
---------------------------------------------------------------------------------------------------*/














int D, L, N, F[101010]; ll T[101010];
vector<int> days[101010];
vector<int> humans[101010];
ll ans[101010];
//---------------------------------------------------------------------------------------------------
pair<ll, int> dp[31][101010];
void solve(int dish) {
	int n = days[dish].size();

	if (n == 0) return;

	rep(i, 0, n) {
		int j = (i + 1) % n;
		int d = days[dish][j] - days[dish][i];
		if (d <= 0) d += D;

		int cnt = 1 + (d - 1) / L;
		dp[0][i] = { cnt, j };
	}
	rep(p, 1, 31) rep(i, 0, n) {
		auto pa = dp[p - 1][i];
		auto pa2 = dp[p - 1][pa.second];
		dp[p][i] = { pa.first + pa2.first, pa2.second };
	}

	fore(h, humans[dish]) {
		int x = F[h] % D;
		auto ite = lower_bound(all(days[dish]), x);

		if (ite != days[dish].end() && *ite == x) ans[h]++;
		T[h]--;

		ite = upper_bound(all(days[dish]), x);

		int d = 0, cu = 0;
		if (ite == days[dish].end()) d = D - x + days[dish][0];
		else d = *ite - x, cu = ite - days[dish].begin();

		T[h] -= (d - 1) / L;
		if (T[h] <= 0) continue;
		T[h]--;
		ans[h]++;

		rrep(p, 30, 0) {
			auto pa = dp[p][cu];
			if (pa.first <= T[h]) {
				ans[h] += 1 << p;
				T[h] -= pa.first;
				cu = pa.second;
			}
		}
	}
}
//---------------------------------------------------------------------------------------------------
void _main() {
	cin >> D >> L >> N;
	rep(i, 0, D) {
		int C; cin >> C;
		days[C].push_back(i);
	}
	rep(i, 0, N) {
		int K; cin >> K >> F[i] >> T[i];
		F[i]--;
		humans[K].push_back(i);
	}

	rep(dish, 1, 101010) solve(dish);
	rep(i, 0, N) printf("%d\n", ans[i]);
}

Submission Info

Compile Error

./Main.cpp: In function ‘void _main()’:
./Main.cpp:102:24: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘ll’ {aka ‘long long int’} [-Wformat=]
  102 |  rep(i, 0, N) printf("%d\n", ans[i]);
      |                       ~^     ~~~~~~
      |                        |          |
      |                        int        ll {aka long long int}
      |                       %lld

Judge Result