제출 #865197

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
865197		vjudge1	새로운 문제 (POI11_met)	C++17	0 / 100	4445 ms	4956 KiB

met

/// tree bends in youth
/// 24  .10.2023
/// success is doing same thing in every single day!!!
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define all(x) x.begin(), x.end()
#define F first
#define S second
using namespace std;
const ll N =1e5+ 5;
const ll NN =2e6 + 5;
const ll INF = -1e1;
const ll MOD = 1e9 + 7;
const ll LG = 18;
const ll k = 316;
int a[N],ans[N];
ll nd[N],sum[N];

void solve(){
    int n,m,k;
    cin >> n >> m ;
    for(int i = 1;i <= m;i++)cin >> a[i];
    for(int i = 1;i <= n;i++){
        cin >> nd[i];
        ans[i] = 0;
    }
    cin >> k;
    for(int z = 1;z <= k;z++){
        int l,r;
        ll v;
        cin >> l >> r >> v;
        if(l >r){
            for(int i = l;i <= m;i++){
                sum[a[i]] += v;
                if(sum[a[i]] >= nd[a[i]] && ans[a[i]] == 0){
                    ans[a[i]] = z;
                }
            }
            for(int i = 1;i <= r;i++){
                sum[a[i]] += v;
                if(sum[a[i]] >= nd[a[i]] && ans[a[i]] == 0){
                    ans[a[i]] = z;
                }
            }
        }
        else{
            for(int i = l;i <= r;i++){
                sum[a[i]] += v;
                if(sum[a[i]] >= nd[a[i]] && ans[a[i]] == 0){
                    ans[a[i]] = z;
                }
            }
        }
    }
    for(int i = 1;i <= n;i++){
        if(ans[i] == 0)cout << "NLE\n";
        else cout << ans[i] << '\n';
    }
}
main (){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
//    freopen("input.txt","r",stdin);
//    freopen("output.txt","w",stdout);
    ll abd= 1;
//    cin >> abd;
    for(ll i = 1;i <= abd;i++){
//        cout << "Case " << i << ":\n";
        solve();
    }
}

컴파일 시 표준 에러 (stderr) 메시지

met.cpp:61:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   61 | main (){
      | ^~~~

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