Submission #570433

#	Time	Username	Problem	Language	Result	Execution time	Memory
570433		urosk	Meteors (POI11_met)	C++14	87 / 100	1490 ms	54080 KiB

met

// __builtin_popcount(x) broj bitova
// __builtin_popcountll(x)
// __builtin_clz(x) vodece nule
// __builtin_clzll(x)
// __builtin_ctz(x) nule na pocetku
// __builtin_ctzll(x)
// 2000000011
// 2000000033
#include "bits/stdc++.h"
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define ld double
#define ll int
#define ull unsigned long long
#define llinf 100000000000000000LL // 10^17
#define iinf 2000000000 // 2*10^9
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define sz(a) ((ll)(a.size()))
#define all(a) a.begin(),a.end()
#define rall(a) a.begin(),a.end(),greater<int>()
#define getunique(v) {sort(all(v)); v.erase(unique(all(v)), v.end());}
#define pi 3.14159265358979323846
#define here cerr<<"=============================================================================\n"
#define ceri(a,l,r) {for(ll i_ = l;i_<=r;i_++) cerr<<a[i_]<< " ";cerr<<endl;}
#define ceri2(a,l,r,n,m) {for(ll i = l;i<=r;i++){for(ll j = n;j<=m;j++) cerr<<a[i][j]<< " ";cerr<<endl;}}
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
#define daj_mi_malo_vremena ios_base::sync_with_stdio(false);cerr.tie(0);cin.tie(0);
using namespace std;
using namespace __gnu_pbds;

typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef tree<ll,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_multiset;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rnd(ll l,ll r){
    return uniform_int_distribution<ll>(l,r)(rng);
}

void setIO(string inoutname)
{
	freopen((inoutname+".in").c_str(),"r",stdin);
    	freopen((inoutname+".out").c_str(),"w",stdout);
}
#define mod 1
ll gcd(ll a, ll b)
{
   if(b==0) return a;
   if(a==0) return b;
   if(a>=b)  return gcd(a%b,b);
   return  gcd(a,b%a);
}
ll lcm(ll a,ll b){
   return (a/gcd(a,b))*b;
}
ll add(ll x,ll y){
    x+=y;
    if(x<0){
        x%=mod;
        x+=mod;
	if(x==mod) x = 0;
    }else{
        if(x>=mod) x%=mod;
    }
    return x;
}
ll mul(ll a,ll b){
	ll ans = (a*b)%mod;
	if(ans<0) ans+=mod;
	return ans;
}
ll po(ll x,ll y){
    if(y==0) return 1LL;
    ll ans = po(x,y/2);
    ans = mul(ans,ans);
    if(y&1) ans = mul(ans,x);
    return ans;
}
ll inv(ll x){return po(x,mod-2);}

#define maxn 300005
ll n,m;
ll a[maxn];
ll b[maxn];
vector<ll> v[maxn];
vector<ll> q[maxn];
ll L[maxn],R[maxn],rez[maxn];
ll k;
ll metr[maxn][3];
ll bit[maxn];
void upd(ll idx,ll val) {
    while(idx < maxn) {
        bit[idx] += val;
        idx += idx&-idx;
    }
}
ll get(ll idx) {
    ll sum = 0;
    while(idx) {
        sum += bit[idx];
        idx -= idx&-idx;
    }
    return sum;
}
void tc(){
	daj_mi_malo_vremena
    cin >> m >> n;
    for(ll i = 1;i<=n;i++){
        cin >> a[i];
        v[a[i]].pb(i);
    }
    for(ll i = 1;i<=m;i++) cin >> b[i];
    cin >> k;
    for(ll i = 1;i<=k;i++){
        cin >> metr[i][0] >> metr[i][1] >> metr[i][2];
    }
    for(ll i = 1;i<=m;i++) L[i] = 1,R[i] = k,rez[i] = k+1;
    bool menja = 1;
    while(menja){
        for(ll i = 1;i<=k;i++) q[i].clear();
        fill(bit,bit+maxn,0LL);
        menja = 0;
        for(ll i = 1;i<=m;i++){
            if(L[i]>R[i]) continue;
            menja = 1;
            ll mid = (L[i]+R[i])/2;
            q[mid].pb(i);
        }
        /*here;
        for(ll i = 1;i<=k;i++){
            cerr<<"mid: "<<i<<endl;
            for(ll x : q[i]) cerr<<x<< " ";
            cerr<<endl;
        }*/
        for(ll i = 1;i<=k;i++){
            ll l = metr[i][0];
            ll r = metr[i][1];
            ll x = metr[i][2];
            //cerr<<l<< " "<<r<<" "<<x<<endl;
            if(l<=r){
                upd(l,x);
                upd(r+1,-x);
            }else{
                upd(1,x);
                upd(r+1,-x);
                upd(l,x);
            }
            for(ll x : q[i]){
                ll sum = 0;
                for(ll y : v[x]){
                    sum+=get(y);
                    if(sum>=b[x]) break;
                }
                //cerr<<x<< " "<<sum<<endl;
                if(sum>=b[x]){
                    rez[x] = i;
                    R[x] = i-1;
                }else L[x] = i+1;
            }
        }
        //here;
    }
    for(ll i = 1;i<=m;i++){
        if(rez[i]==k+1) cout<<"NIE"<<endl;
        else cout<<rez[i]<<endl;
    }
}
int main(){
	daj_mi_malo_vremena
	//setIO("lol");
	int t; t = 1;
	while(t--){
		tc();
	}
	return 0;
}

Compilation message (stderr)

met.cpp: In function 'void setIO(std::string)':
met.cpp:48:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |  freopen((inoutname+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
met.cpp:49:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |      freopen((inoutname+".out").c_str(),"w",stdout);
      |      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• 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: 13 / 13
• Subtask 8: 0 / 13