oj.uz

답안 #347764

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
347764 2021-01-13T11:12:14 Z lovro_nidogon1 Meteors (POI11_met) C++14
87 / 100
 6000 ms 57056 KB 
#include<bits/stdc++.h>
#define breturn return
#define ll long long
using namespace std;
const int maxn = 300001;
ll n, m, o[maxn], p[maxn], a, b, c, q, bn, tour[1048600], ans[maxn]; 
vector<pair<ll, pair<ll, ll> > > midl[maxn], quer;
vector<ll> v[maxn];
bool done; 
void upd(ll ax, ll bx, ll val, ll x = 1, ll l = 0, ll r = bn - 1) {	
	if(ax > r or bx < l) breturn;
	if(l >= ax and r <= bx) {
		tour[x] += val;
		breturn;
	} 
	ll mid = (l + r)/2;
	upd(ax, bx, val, x * 2, l, mid);
	upd(ax, bx, val, x * 2 + 1, mid + 1, r);
}
ll query(ll ax, ll bx, ll x = 1, ll l = 0, ll r = bn - 1) {
	if(ax > r or bx < l) breturn 0;;
	if(l >= ax and r <= bx) breturn tour[x];	 
	tour[x * 2] += tour[x];
	tour[x * 2 + 1] += tour[x];
	tour[x] = 0;
	ll mid = (l + r)/2;
	breturn query(ax, bx, x * 2, l, mid) + query(ax, bx, x * 2 + 1, mid + 1, r);
}
int main() {
	cin >> n >> m;
	for(int i = 0; i < m; i++ ) cin >> a, v[a - 1].push_back(i);
	for(ll i = 0; i < n; i++) cin >> p[i];	
	cin >> q;
	bn = (1 << ((ll)log2(m - 1 + (m == 1)) + 1));
	for(ll i = 0; i < q; i++) {
		cin >> a >> b >> c;
		quer.push_back({c, {a - 1, b - 1}});		
	}
	for(ll i = 0; i < n; i++) midl[(int)(q/2)].push_back({i, {0, q}});
	while(!done) {
		done = true;
		for(ll i = 0; i < 2 * bn; i++) tour[i] = 0;
		for(ll i = 0; i < q; i++) {
			if(quer[i].second.first > quer[i].second.second) {
				upd(0, quer[i].second.second, quer[i].first);
				upd(quer[i].second.first, m - 1, quer[i].first);
			} else upd(quer[i].second.first, quer[i].second.second, quer[i].first);			
			for(ll j = 0; j < midl[i].size(); j++) {				
				ll y = midl[i][j].first;
				ll x = 0;
				for(ll k = 0; k < v[y].size() and x < p[y]; k++) x += query(v[y][k], v[y][k]);														
				ll le = midl[i][j].second.first;
				ll re = midl[i][j].second.second;
				ll mid = (le + re)/2;
				if(x < p[y]) le = mid + 1;
				else re = mid;				
				mid = (le + re)/2;
				if(le == re) ans[y] = le;
				else midl[mid].push_back({y, {le, re}}), done = false;													
			}
			midl[i].clear();		
			midl[i].shrink_to_fit();
		}
	}
	for(ll i = 0; i < n; i++) {
		if(ans[i] == q) cout << "NIE\n";
		else cout << ans[i] + 1 << '\n';
	}
}

Compilation message

met.cpp: In function 'int main()':
met.cpp:48:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |    for(ll j = 0; j < midl[i].size(); j++) {
      |                  ~~^~~~~~~~~~~~~~~~
met.cpp:51:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |     for(ll k = 0; k < v[y].size() and x < p[y]; k++) x += query(v[y][k], v[y][k]);
      |                   ~~^~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 369 ms 18040 KB Output is correct
2 Correct 570 ms 20292 KB Output is correct
3 Correct 524 ms 18528 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 495 ms 18476 KB Output is correct
2 Correct 509 ms 18436 KB Output is correct
3 Correct 552 ms 20320 KB Output is correct
4 Correct 152 ms 17588 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 280 ms 17904 KB Output is correct
2 Correct 403 ms 19940 KB Output is correct
3 Correct 204 ms 16228 KB Output is correct
4 Correct 493 ms 19044 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 454 ms 17248 KB Output is correct
2 Correct 456 ms 18452 KB Output is correct
3 Correct 435 ms 17376 KB Output is correct
4 Correct 563 ms 20064 KB Output is correct

Subtask #7
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4128 ms 45048 KB Output is correct
2 Correct 1914 ms 32968 KB Output is correct
3 Correct 976 ms 20700 KB Output is correct
4 Execution timed out 6083 ms 53768 KB Time limit exceeded

Subtask #8
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4409 ms 45724 KB Output is correct
2 Correct 1520 ms 32988 KB Output is correct
3 Correct 908 ms 20700 KB Output is correct
4 Correct 5879 ms 57056 KB Output is correct