| CARVIEW |
Select Language
HTTP/2 200
date: Tue, 14 Oct 2025 23:13:38 GMT
content-type: text/html; charset=UTF-8
server: cloudflare
x-frame-options: DENY
x-content-type-options: nosniff
x-xss-protection: 1;mode=block
vary: accept-encoding
cf-cache-status: DYNAMIC
content-encoding: gzip
set-cookie: _csrf-frontend=ea70c87f7ace4a34969970b19fd19c9698236065a06e64e4dddc1c17be48d64fa%3A2%3A%7Bi%3A0%3Bs%3A14%3A%22_csrf-frontend%22%3Bi%3A1%3Bs%3A32%3A%22laMxsFpTacFdifma4E03GC3wTLEZzTA6%22%3B%7D; HttpOnly; Path=/
cf-ray: 98eac4b7ffd4c16f-BLR
#include <bits/stdc++.h>#define F first#define S second#define all(x) x.be - Pastebin.com
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- #define F first
- #define S second
- #define all(x) x.begin(),x.end()
- #define endl '\n'
- using namespace std;
- using ll = long long;
- using pii = pair<int, int>;
- const int INF = 0x3f3f3f3f;
- const ll INFLL = 0x3f3f3f3f3f3f3f3fLL;
- const int MOD = 1000000007;
- const int dx[] = { 0, 0, -1, 1, 1, -1, 1, -1};
- const int dy[] = {-1, 1, 0, 0, 1, -1, -1, 1};
- const int MAXN = 300010;
- typedef long long t_bit;
- t_bit bit[MAXN];
- //1-indexed
- t_bit get(int i){
- t_bit s = 0;
- for (; i > 0; i -= (i & -i))
- s += bit[i];
- return s;
- }
- //1-indexed
- void add(int i, t_bit value){
- assert(i > 0);
- for (; i < MAXN; i += (i & -i))
- bit[i] += value;
- }
- void add(int l, int r, t_bit val){
- if(l <= r){
- add(l, val);
- add(r+1, -val);
- }else{
- add(l, val);
- add(1, val);
- add(r+1, -val);
- }
- }
- typedef tuple<int, int, int> tp;
- vector<int> pos[MAXN];
- int p[MAXN], ans[MAXN];
- tp q[MAXN];
- void solve(int i, int j, vector<int> &v){
- if(i == j){
- for(int x: v)
- ans[x] = i;
- return;
- }
- int mid = (i+j)/2;
- for(int k=i; k<=mid; k++){
- auto [l, r, a] = q[k];
- add(l, r, a);
- }
- vector<int> left, right;
- for(int x: v){
- ll sum = 0;
- for(int y: pos[x]){
- sum += get(y);
- if(sum >= p[x])
- break;
- }
- if(sum >= p[x])
- left.push_back(x);
- else
- right.push_back(x);
- }
- v.clear();
- solve(mid+1, j, right);
- for(int k=mid; k>=i; k--){
- auto [l, r, a] = q[k];
- add(l, r, -a);
- }
- solve(i, mid, left);
- }
- int main() {
- ios_base::sync_with_stdio(false); cin.tie(NULL);
- int n, m;
- cin >> n >> m;
- for(int i=1; i<=m; i++){
- int x;
- cin >> x;
- pos[x].push_back(i);
- }
- for(int i=1; i<=n; i++){
- cin >> p[i];
- }
- int k;
- cin >> k;
- for(int i=1; i<=k; i++){
- int l, r, a;
- cin >> l >> r >> a;
- q[i] = tp(l, r, a);
- }
- q[k+1] = tp(1, m, 1e9);
- vector<int> v(n);
- iota(all(v), 1);
- solve(1, k+1, v);
- for(int i=1; i<=n; i++){
- if(ans[i] > k)
- cout << "NIE" << endl;
- else
- cout << ans[i] << endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
-
đ¨ Free Crypto Method đ¨
JavaScript | 2 sec ago | 0.24 KB
-
âââExploit 500$ in 15 Minutesââ
Java | 5 sec ago | 0.15 KB
-
â
Marketplace Glitch â
Working NEVER SEEN BE...
JavaScript | 6 sec ago | 0.25 KB
-
âââExploit 500$ in 15 Minutesââ
Java | 7 sec ago | 0.15 KB
-
đĄ Instant BTC Profit Method â
Working
JavaScript | 13 sec ago | 0.24 KB
-
ââ
Exploit 2500$ in 15 Minutesâââ X
JavaScript | 14 sec ago | 0.25 KB
-
âââExchange Exploitââ
Java | 16 sec ago | 0.15 KB
-
âââMake $1500 in 20 minutesââ
Java | 17 sec ago | 0.15 KB
We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy. OK, I Understand
