oj.uz

Submission #496233

# Submission time Handle Problem Language Result Execution time Memory
496233 2021-12-21T03:37:58 Z armashka Meteors (POI11_met) C++17
24 / 100
 56 ms 588 KB 
#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 = 2e5 + 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, id[1005], cnt[1005], t[1005 * 4], fl[1005 * 4], ans[1005];
set <ll> st[1005];

void push(ll v, ll tl, ll tr) {
	t[v] += fl[v] * (tr - tl + 1);
	if (tl < tr) {
		fl[v + v] += fl[v];
		fl[v + v + 1] += fl[v];
	}
	fl[v] = 0;
}

void upd(ll l, ll r, ll val, ll v = 1, ll tl = 1, ll tr = m) {
	push(v, tl, tr);
	if (r < tl || tr < l) return;
	if (l <= tl && tr <= r) {
		fl[v] += val;
		push(v, tl, tr);
		return;
	}
	ll tm = (tl + tr) / 2;
	upd(l, r, val, v + v, tl, tm);
	upd(l, r, val, v + v + 1, tm + 1, tr);
	t[v] = t[v + v] + t[v + v + 1];
}

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

const void solve(/*Armashka*/) {	
	cin >> n >> m;
	for (int i = 1; i <= m; ++ i) cin >> id[i], st[id[i]].insert(i);
	for (int i = 1; i <= n; ++ i) cin >> cnt[i], ans[i] = -1;
	cin >> k;
	for (int i = 1; i <= k; ++ i) {
		ll l, r, val;
		cin >> l >> r >> val;
		if (l > r) {
			upd(1, r, val);
			upd(l, m, val);
		} else upd(l, r, val);
		for (int j = 1; j <= n; ++ j) {
			if (ans[j] != -1) continue;
			ll sum = 0;
			for (auto x : st[j]) sum += get(x); 
			if (sum >= cnt[j]) ans[j] = i;
		}
	}
	for (int i = 1; i <= n; ++ i) {
		if (ans[i] == -1) cout << "NIE\n";
		else cout << ans[i] << "\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.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 460 KB Output is correct
2 Correct 56 ms 460 KB Output is correct
3 Correct 27 ms 460 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 460 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 39 ms 460 KB Output is correct

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 460 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 460 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 588 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 460 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -