/*
* Author: xynex
* Created: 21.12.2021 09:47
* Why am I so stupid? :c
* Slishkom slab
*/
#include <bits/stdc++.h>
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse,-fgcse-lm")
#pragma GCC optimize("-ftree-pre,-ftree-vrp")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define ll long long
#define dl double long
#define ull unsigned long long
#define pr pair
#define vt vector
#define ff first
#define ss second
#define mp make_pair
#define sz(a) (int)a.size()
#define pb push_back
#define pf push_front
#define popB pop_back
#define popF pop_front
#define bit_count __builtin_popcount
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sp(x) fixed << setprecision(x)
template<typename T> T get_rand(T l, T r) {
random_device rd;
mt19937 gen(rd());
return uniform_int_distribution<T>(l, r)(gen);
}
template<typename T> T lcm(T a, T b) { return a * (b / __gcd(a, b)); }
template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(array<A, S>& a);
template<class T> void read(T& x) { cin >> x; }
void read(double& d) { string t; read(t); d = stod(t); }
void read(long double& d) { string t; read(t); d = stold(t); }
template<class H, class... T> void read(H& h, T&... t) { read(h); read(t...); }
template<class A> void read(vt<A>& x) { for (auto& a : x) read(a); }
template<class A, size_t S> void read(array<A, S>& x) { for (auto& a : x) read(a); }
string to_string(char c) { return string(1, c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return string(s); }
string to_string(string s) { return s; }
string to_string(vt<bool> v) { string res; for (int i = 0; i < sz(v); ++i) res += char('0' + v[i]); return res; }
template<size_t S> string to_string(bitset<S> b) { string res; for (int i = 0; i < S; ++i) res += char('0' + b[i]); return res; }
template<class T> string to_string(T v) { bool f = 1; string res; for (auto x : v) { if (!f) res += ' '; f = 0; res += to_string(x); } return res; }
template<class A> void write(A x) { cout << to_string(x); }
template<class H, class... T> void write(const H& h, const T&... t) { write(h); write(t...); }
void print() { write("\n"); }
template<class H, class... T> void print(const H& h, const T&... t) { write(h); if (sizeof...(t)) write(' '); print(t...); }
void freop(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
const int MOD = 1e9 + 7;
const int N = 3e6 + 5;
const ll INF = 9e18;
const int M = 3e3 + 5;
const dl pi = acos(-1);
const dl eps = 1e-12;
const int sq = 550;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
/* ll vs int*/
void precalc() {
}
ll a[N], need[N];
ll l[N], r[N], ind[N];
bool ok[N];
ll ans[N];
ll get(ll x, ll y, vt<ll> pos) {
ll L = 0, R = sz(pos) - 1;
while((R - L) >= 0) {
ll MID = (R + L) >> 1;
if(pos[MID] <= y) L = MID + 1;
else R = MID - 1;
}
L--;
L = max(L, 0ll);
if(pos[L] > y) return 0;
ll L1 = 0, R1 = sz(pos) - 1;
while((R1 - L1) >= 0) {
ll MID = (R1 + L1) >> 1;
if(pos[MID] < x) L1 = MID + 1;
else R1 = MID - 1;
}
R1++;
R1 = min(R1, (ll)sz(pos) - 1);
if(pos[R1] < x) return 0;
return R1 - L + 1;
}
void solve() {
int n, m; read(n, m);
vt<ll> cnt(m + 2);
for(int i = 1; i <= m; ++i) {
read(a[i]);
}
for(int i = 1; i <= n; ++i) {
read(need[i]);
}
int k; read(k);
for(int i = 1; i <= k; ++i) {
read(l[i], r[i], ind[i]);
}
set<int> poses;
for(int i = 1; i <= n; ++i) poses.insert(i);
for(int i = 1; i <= k; i += sq) {
int lim = min(k, i + sq - 1);
vt<ll> cop = cnt;
for(int j = i; j <= lim; ++j) {
if(l[j] > r[j]) {
cnt[l[j]] += ind[j];
cnt[m + 1] -= ind[j];
cnt[1] += ind[j];
cnt[r[j] + 1] -= ind[j];
}
else {
cnt[l[j]] += ind[j];
cnt[r[j] + 1] -= ind[j];
}
}
for(int j = 1; j <= m; ++j) cnt[j] += cnt[j - 1];
vt<ll> sum(n + 1), sum1(n + 1);
vt<vt<ll> > pos(n + 1);
for(int j = 1; j <= m; ++j) {
sum[a[j]] += cnt[j];
sum1[a[j]] += cop[j];
pos[a[j]].pb(j);
}
//print("");
/* set<pr<ll, ll> > uberem;
for(auto j : poses) {
if(sum[j] < need[j]) {
continue;
}
ok[j] = 1;
ll nehvat = need[j] - sum1[j];
uberem.insert({(ll)j, nehvat});
}
for(int whr = i; whr <= lim; ++whr) {
set<pr<ll, ll> > ubrano;
for(auto cur : uberem) {
int j = cur.ff;
ll nehvat = cur.ss;
if(l[whr] > r[whr]) {
ll leftside = get(1, r[whr], pos[j]), rightside = get(l[whr], m, pos[j]);
leftside += rightside;
nehvat -= (ll)leftside * (ll) ind[whr];
if(nehvat > 0) ubrano.insert({j, nehvat});
if(nehvat <= 0) {
ans[j] = whr;
continue;
}
}
else {
ll sum = get(l[whr], r[whr], pos[j]);
nehvat -= (ll)sum * (ll) ind[whr];
if(nehvat > 0) ubrano.insert({j, nehvat});
if(nehvat <= 0) {
ans[j] = whr;
continue;
}
}
}
uberem.clear();
for(auto cur : ubrano) uberem.insert(cur);
}
for(int j = 1; j <= n; ++j) {
if(ok[j]) poses.erase(j);
}*/
}
for(int i = 1; i <= n; ++i) {
if(!ok[i]) print("NIE");
else print(ans[i]);
}
}
int main() {
//freop("");
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
//read(t);
precalc();
for (int i = 1; i <= t; ++i) {
//write("Case #" + to_string(i) + ": ");
solve();
}
return 0;
}
Compilation message
met.cpp: In function 'void freop(std::string)':
met.cpp:73:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
73 | freopen((s + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
met.cpp:74:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
74 | freopen((s + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
460 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
93 ms |
3880 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
192 ms |
4360 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
148 ms |
3848 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
112 ms |
3512 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Execution timed out |
6062 ms |
30292 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Execution timed out |
6090 ms |
29676 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
