oj.uz

답안 #865779

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
865779 2023-10-24T15:58:06 Z Nuraly_Serikbay Meteors (POI11_met) C++17
0 / 100
 4766 ms 53204 KB 
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <fstream>
#include <unordered_map>

using namespace std;

typedef long long ll;
typedef long double ld;

//#define int long long

#define all(x) x.begin(),x.end()
#define pb push_back
#define ent "\n"

const int maxn = (int)3e5 + 1;
const ll amirr = (int)1e9 + 1;

int n,m;
vector<int>pos[maxn],MID[maxn];
int a[maxn];
int l[maxn],r[maxn],w[maxn];
pair<int,int>seg[maxn];
ll t[maxn * 4],q[maxn * 4];

void push(int v,int tl,int tr){
	if(q[v]){
		q[v] = min(q[v],amirr);
		q[v * 2] += q[v];
		q[v * 2 + 1] += q[v];
		q[v * 2] = min(q[v * 2],amirr);
		q[v * 2 + 1] = min(q[v * 2 + 1],amirr);
		t[v] = q[v];
		q[v] = 0;
	}
}

void upd(int v,int tl,int tr,int l,int r,int x){
	push(v,tl,tr);
	if(l <= tl && tr <= r){
		q[v] += x;
		q[v] = min(q[v],amirr);
		return;
	}
	if(l > tr || r < tl)return;
	int mid = (tl + tr) >> 1;
	upd(v * 2,tl,mid,l,r,x);
	upd(v * 2 + 1,mid + 1,tr,l,r,x);
}

ll get(int v,int tl,int tr,int pos){
	push(v,tl,tr);
	if(tl == tr){
		return t[v];
	}
	int mid = (tl + tr) >> 1;
	if(pos <= mid){
		return get(v * 2,tl,mid,pos);
	}
	else{
		return get(v * 2 + 1,mid + 1,tr,pos);
	}
}

int ans[maxn];

void solve(){
	cin >> n >> m;
	for(int i = 1 ; i <= m ; i ++){
		int o;cin >> o;
		pos[o].pb(i);
	}
	for(int i = 1 ; i <= n ; i ++){
		cin >> a[i];
	}
	int k;cin >> k;
	for(int i = 1 ; i <= k ; i++){
		cin >> l[i] >> r[i] >> w[i];
	}
	for(int i = 1 ; i <= n ; i ++){
		seg[i] = {1, k};
	}
	bool ok = 1;
	while(ok){
		ok = 0;
		memset(t,0,sizeof(t));
		memset(q,0,sizeof(q));
		for(int i = 1 ; i <= n ; i ++){
			if(seg[i].first <= seg[i].second){
				int mid = (seg[i].first + seg[i].second) >> 1;
				MID[mid].pb(i);
				ok = 1;
			}
		}
		for(int i = 1 ; i <= k ; i ++){
			if(l[i] <= r[i]){
				upd(1,1,m,l[i],r[i],w[i]);
			}
			else{
				upd(1,1,m,l[i],m,w[i]);
				upd(1,1,m,1,r[i],w[i]);
			}
			int sum = 0;
			for(int x : MID[i]){
				sum = 0;
				for(int y : pos[x]){
					sum += get(1,1,m,y);
					if(sum >= a[x])break;
				}
				if(sum >= a[x]){
					seg[x].second = i - 1;
					ans[x] = i;
				}
				else{
					seg[x].first = i + 1;
				}
			}
			MID[i].clear();
		}
	}
	for(int i = 1 ; i <= n ; i ++){
		if (ans[i] == 0) cout << "NIE\n";
		else cout << ans[i] << '\n';
	}
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t = 1;
	//cin >> t;
	while(t --){
		solve();
	}
	return 0;
}

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 22 ms 41308 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 20 ms 41308 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 426 ms 42116 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 487 ms 42836 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 225 ms 42560 KB Output is correct
2 Incorrect 370 ms 44636 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 472 ms 41848 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4766 ms 53204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4626 ms 51852 KB Output isn't correct
2 Halted 0 ms 0 KB -