Submission #865483

#	Time	Username	Problem	Language	Result	Execution time	Memory
865483		vjudge1	새로운 문제 (POI11_met)	C++17	74 / 100	6027 ms	6912 KiB

met

//Bismillahir-Rahmanir-Rahim
#include <bits/stdc++.h>
         
using namespace std;
      
#define flash ios_base::sync_with_stdio(0),cin.tie(0)
#define pb push_back
#define ll long long
#define ld long double
#define dbg(x) cerr << #x << " = " << x << "\n";
#define ff first
#define ss second
 
 /*     
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma comment (linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
*/ 
 
const long long INF = 1e9 + 7;
const long long MOD = 1e9 + 7;
const int maxn = 3e5 + 10;

int n, m, k, p[maxn], o[maxn], ans[maxn], met[maxn], cnt;

void press_F_() {
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		cin >> o[i];
	}
	for (int i = 1; i <= n; i++) {
		cin >> p[i];
	}
	cin >> k;
	int id = 1;
	cnt = n;
	while(k--) {
		int l, r, a;
		cin >> l >> r >> a;
		if (l <= r) {
			for (int i = l; i <= r; i++) {
				met[o[i]] += a;
			}
		} else {
			for (int i = l; i <= m; i++) {
				met[o[i]] += a;
			}
			for (int i = 1; i <= r; i++) {
				met[o[i]] += a;
			}
		}
		if (cnt == 0) {
			continue;
		}
		for (int i = 1; i <= n; i++) {
			if (met[i] >= p[i] && ans[i] == 0) {
				ans[i] = id;
				cnt--;
			}
		}
		id++;
	}
	for (int i = 1; i <= n; i++) {
		if (ans[i] == 0) {
			cout << "NIE" << '\n';
		} else {
			cout << ans[i] << '\n';
		}
	}
} 

int main() {
    flash;
    // srand(time(0));
    int T = 1;
    // cin >> T;
    for (int i = 1; i <= T; i++) {
        // cout << "Case" << " " << i << ':' << "\n";
        press_F_();
    }
    //Respa gold 2023-2024 InshAllah
    return 0;
}
/*
Maybe not today and tomorrow, but InshAllah one day I will reach expert
*/
// g++ -std=c++17 main.cpp
// ./a.out

• Subtask 1: 12 / 12
• Subtask 2: 12 / 12
• Subtask 3: 12 / 12
• Subtask 4: 12 / 12
• Subtask 5: 13 / 13
• Subtask 6: 13 / 13
• Subtask 7: 0 / 13
• Subtask 8: 0 / 13