Submission #496252

#	Time	Username	Problem	Language	Result	Execution time	Memory
496252		armashka	Meteors (POI11_met)	C++17	12 / 100	6033 ms	65540 KiB

met

#include <bits/stdc++.h>
 
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define all(v) v.begin(),v.end()
#define pb push_back
#define sz size()
#define ft first
#define sd second
 
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
 
const int N = 3e5 + 5;
const ll M = 1e8;
const ll inf = 1e9;
const ll mod = 1e9;
const double Pi = acos(-1); 
 
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }
bool even(ll n) { return (n % 2 == 0); }            
 
ll n, m, k, a[N], l[N], r[N], val[N];
map <ll, ll> t[N];

void upd(ll x, ll pos, ll val, ll v = 1, ll tl = 1, ll tr = m) {
	if (tl == tr) {
		t[x][v] = val;
		return;
	}
	ll tm = (tl + tr) / 2;
	if (pos <= tm) upd(x, pos, val, v + v, tl, tm);
	else upd(x, pos, val, v + v + 1, tm + 1, tr);
	t[x][v] = t[x][v + v] + t[x][v + v + 1];
}

ll get(ll x, ll l, ll r, ll v = 1, ll tl = 1, ll tr = m) {
	if (r < tl || tr < l) return 0;
	if (l <= tl && tr <= r) return t[x][v];
	ll tm = (tl + tr) / 2;
	return get(x, l, r, v + v, tl, tm) + get(x, l, r, v + v + 1, tm + 1, tr); 
}

const void solve(/*Armashka*/) {	
	cin >> n >> m;
	for (int i = 1; i <= m; ++ i) {
		ll id; cin >> id;
		upd(id, i, 1);
	}
	for (int i = 1; i <= n; ++ i) cin >> a[i];
	cin >> k;
	for (int i = 1; i <= k; ++ i) cin >> l[i] >> r[i] >> val[i];
	for (int i = 1; i <= n; ++ i) {
		ll bl = 1, br = k, ans = -1;
		while (bl <= br) {
			ll mid = (bl + br) / 2;
			ll sum = 0;
			for (int j = 1; j <= mid; ++ j) {
				ll cnt = 0;
				if (l[j] > r[j]) cnt = get(i, l[j], m) + get(i, 1, r[j]);
				else cnt = get(i, l[j], r[j]);
				sum += cnt * val[j]; 
			}
			if (sum >= a[i]) br = mid - 1, ans = mid;
			else bl = mid + 1;
		}
		if (ans == -1) cout << "NIE\n";
		else cout << ans << "\n";
	}
}                     
 
signed main() {
    fast;
    //freopen("divide.in", "r", stdin);
    //freopen("divide.out", "w", stdout);
    int tt = 1;
    //cin >> tt;
    while (tt --) {
        solve();
    }
}                                                                          
 
/*
5 4 4
1 2
3 1
3 4
5 3
4 5 2 3
2 1 3 1
1 3 5
2 3 4 5
2 1 3 1
*/

• Subtask 1: 12 / 12
• Subtask 2: 0 / 12
• Subtask 3: 0 / 12
• Subtask 4: 0 / 12
• Subtask 5: 0 / 13
• Subtask 6: 0 / 13
• Subtask 7: 0 / 13
• Subtask 8: 0 / 13