제출 #491295

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
491295		Wayne_Yan	Meteors (POI11_met)	C++17	37 / 100	6099 ms	2596 KiB

met

#include <bits/extc++.h>
using namespace std;
using namespace __gnu_pbds;

typedef int64_t ll;
typedef long double ld;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define pb emplace_back
#define mp make_pair
#define mt make_tuple
#define pii pair<int,int>
#define F(n) Fi(i,n)
#define Fi(i,n) Fl(i,0,n)
#define Fl(i,l,n) for(int i=l;i<n;i++)
#define RF(n) RFi(i,n)
#define RFi(i,n) RFl(i,0,n)
#define RFl(i,l,n) for(int i=n-1;i>=l;i--)
#define all(v) begin(v),end(v)
#define siz(v) (ll(v.size()))
#define get_pos(v,x) (lower_bound(all(v),x)-begin(v))
#define sort_uni(v) sort(begin(v),end(v)),v.erase(unique(begin(v),end(v)),end(v))
#define mem(v,x) memset(v,x,sizeof v)
#define ff first
#define ss second
#define mid ((l+r)>>1)
#define RAN(a,b) uniform_int_distribution<int> (a, b)(rng)
#define debug(x) (cerr << (#x) << " = " << x << "\n")

template <typename T> using max_heap = __gnu_pbds::priority_queue<T,less<T> >;
template <typename T> using min_heap = __gnu_pbds::priority_queue<T,greater<T> >;
template <typename T> using rbt = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;

signed main(){
  
  int m,n,k;
  cin >> n >> m;
  int o[m];
  F(m) cin >> o[i], o[i]--;
  int t[n];
  F(n) cin >> t[i];
  cin >> k;
  int ans[n];
  fill(ans, ans+n, -1);
  int curr[n] = {};

  F(k){
    int l,r,c;
    cin >> l >> r >> c;
    l--, r--;
    if(l <= r){
      Fl(j, l, r+1){
        curr[o[j]]+=c;
        if(curr[o[j]] >= t[o[j]] && ans[o[j]]==-1){
          ans[o[j]]=i;
        }
      }
    }else{
      Fl(j, 0, r+1){
        curr[o[j]]+=c;
        if(curr[o[j]] >= t[o[j]] && ans[o[j]]==-1){
          ans[o[j]]=i;
        }
      }
      Fl(j, l, m){
        curr[o[j]]+=c;
        if(curr[o[j]] >= t[o[j]] && ans[o[j]]==-1){
          ans[o[j]]=i;
        }
      }
    }
  }
   
  F(n){
    if(ans[i] == -1){
      printf("NIE");
    }else{
      printf("%d", ans[i]+1);
    }
    printf("\n");
  }
  return 0;
}

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