oj.uz

Submission #762414

# Submission time Handle Problem Language Result Execution time Memory
762414 2023-06-21T11:36:32 Z Kaztaev_Alisher Meteors (POI11_met) C++17
74 / 100
 1060 ms 27516 KB 
#include <bits/stdc++.h>
 
#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define all(a) a.begin() , a.end()
#define F first
#define S second
#define int ll
using namespace std;
using ll = long long;
 
const int N = 3e5+5 , inf = 2e9 + 7;
const ll INF = 1e18 ,   mod = 1e9+7 , P = 6547;	

int p[N] , n , m , k ;
int L[N] , R[N] , res[N];
int l[N] , r[N] , c[N];
ll t[N]; 
vector<int> g[N] , v;
deque<pair<int,int>> q;
void upd(int i, int x) {
	for(; i <= m; i |= (i + 1)) t[i] += x;
}

void updlr(int l, int r, int x){
    upd(l, x); upd(r + 1, -x);
}
ll get(int i){
    ll res = 0;
    for(; i > 0; i = (i & (i + 1)) - 1) res += t[i];
    return res;
}
void cl(){
	for(int i = 1; i <= m; i++) t[i] = 0;
}
void solve(){
	cin >> n >> m;
	for(int i = 1; i <= m; i++) {
		int a;
		cin >> a;
		g[a].push_back(i);
	}
	for(int i = 1; i <= n; i++) cin >> p[i];
	cin >> k;
	for(int i = 1; i <= n; i++) {
		L[i] = 1;
		R[i] = k;
		q.push_back(make_pair((k+1)/2,i));
	}
	for(int i = 1; i <= k; i++) cin >> l[i] >> r[i] >> c[i];
	for(int _ = 1; _ < 20; _++){
		cl();
		sort(all(q));
		for(int i = 1; i <= k; i++){
			if(l[i] > r[i]){
				updlr(l[i],m,c[i]);
				updlr(1,r[i],c[i]);
			} else  updlr(l[i],r[i],c[i]);
			while(!q.empty() && q.front().F == i){
				int x = q.front().S;
				q.pop_front();
				ll sum = p[x];
				for(int j = 0 ; j < g[x].size(); j++) sum -= get(g[x][j]);
				if(sum <= 0){
					res[x] = i;
					R[x] = i-1;
				} else {
					L[x] = i+1; 
				}
				if(L[x] <= R[x]) q.push_back({(L[x]+R[x])/2,x});
			}
		}
	}
	for(int i = 1; i <= n; i++) {
		if(res[i] == 0){
			cout << "NIE\n";
		} else {
			cout << res[i] << "\n";
		}
	}
}
/*

*/
signed main(){
	ios;
	solve();
	return 0;
}

Compilation message

met.cpp: In function 'void solve()':
met.cpp:63:23: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |     for(int j = 0 ; j < g[x].size(); j++) sum -= get(g[x][j]);
      |                     ~~^~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 4 ms 7508 KB Output is correct
3 Correct 4 ms 7392 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7508 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 9752 KB Output is correct
2 Correct 107 ms 11084 KB Output is correct
3 Correct 75 ms 10384 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 10140 KB Output is correct
2 Correct 77 ms 10112 KB Output is correct
3 Correct 110 ms 11068 KB Output is correct
4 Correct 35 ms 9428 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 9908 KB Output is correct
2 Correct 80 ms 11076 KB Output is correct
3 Correct 35 ms 8540 KB Output is correct
4 Correct 79 ms 10560 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 9424 KB Output is correct
2 Correct 98 ms 10088 KB Output is correct
3 Correct 51 ms 9648 KB Output is correct
4 Correct 105 ms 11144 KB Output is correct

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1060 ms 27516 KB Output is correct
2 Incorrect 810 ms 19276 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1028 ms 26548 KB Output is correct
2 Incorrect 743 ms 19268 KB Output isn't correct
3 Halted 0 ms 0 KB -