oj.uz

답안 #496321

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
496321 2021-12-21T05:39:42 Z armashka Meteors (POI11_met) C++17
62 / 100
 6000 ms 4940 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 = 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, id[N], cnt[N], sum[N], ans[N];
 
const void solve(/*Armashka*/) {	
	cin >> n >> m;
	for (int i = 1; i <= m; ++ i) cin >> id[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) {
			for (int j = l; j <= r; ++ j) {
				if (ans[id[j]] != -1) continue;
				sum[id[j]] += val;
				if (sum[id[j]] >= cnt[id[j]]) ans[id[j]] = i;
			}
		} else {
			for (int j = 1; j <= r; ++ j) {
            	if (ans[id[j]] != -1) continue;
				sum[id[j]] += val;
				if (sum[id[j]] >= cnt[id[j]]) ans[id[j]] = i;
			}
			for (int j = l; j <= m; ++ j) {
				if (ans[id[j]] != -1) continue;
				sum[id[j]] += val;
				if (sum[id[j]] >= cnt[id[j]]) ans[id[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

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 3 ms 332 KB Output is correct

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 451 ms 796 KB Output is correct
2 Execution timed out 6067 ms 1228 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1676 ms 920 KB Output is correct
2 Correct 2287 ms 928 KB Output is correct
3 Correct 1784 ms 1348 KB Output is correct
4 Correct 9 ms 1100 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2041 ms 940 KB Output is correct
2 Correct 4392 ms 1300 KB Output is correct
3 Correct 26 ms 332 KB Output is correct
4 Correct 2102 ms 1236 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2221 ms 720 KB Output is correct
2 Correct 4334 ms 940 KB Output is correct
3 Correct 1459 ms 756 KB Output is correct
4 Correct 5156 ms 1436 KB Output is correct

Subtask #7
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 6072 ms 4940 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 6076 ms 4548 KB Time limit exceeded
2 Halted 0 ms 0 KB -