Submission #204323

#TimeUsernameProblemLanguageResultExecution timeMemory
204323SegtreeTeams (IOI15_teams)C++14
0 / 100
2098 ms113236 KiB
#include"teams.h" #include<iostream> #include<algorithm> #include<vector> #include<queue> #include<unordered_set> using namespace std; typedef long long ll; typedef pair<ll,ll> P; #define chmin(a,b) a=min(a,b) #define chmax(a,b) a=max(a,b) #define all(x) x.begin(),x.end() #define rep(i,n) for(int i=0;i<n;i++) #define mod 1000000007 #define mad(a,b) a=(a+b)%mod #pragma gcc optimize("O3") #pragma gcc optimize("unroll-loops") #pragma gcc target("avx2,see4") #define up(x,y) upper_bound(all(x),y) #define NS (1<<19) vector<P> v; ll dat[NS*2],laste[2*NS],lastd[2*NS],correctA; vector<ll> as[NS*2]; int used[NS*100],tot; void add(int K){ correctA=K; } ll eval(ll k,bool ex){ if(k==0)return 0; if(ex)used[tot++]=k; if(k<NS){ chmax(lastd[k*2],lastd[k]); if(ex)used[tot++]=k*2; chmax(lastd[k*2+1],lastd[k]); if(ex)used[tot++]=k*2+1; } if(lastd[k]==-1e17){ if(laste[k]!=correctA){ dat[k]+=up(as[k],correctA)-up(as[k],laste[k]); } } else{ if(lastd[k]!=correctA){ dat[k]=up(as[k],correctA)-up(as[k],lastd[k]); } else dat[k]=0; } laste[k]=correctA; lastd[k]=-1e17; return dat[k]; } void erase(ll l,ll r){ l+=NS,r+=NS+1; for(ll d=20;~d;d--){ eval(l>>d,1); eval(r>>d,1); } for(ll a=l,b=r;a<b;a>>=1,b>>=1){ if(a&1){chmax(lastd[a],correctA);a++;} if(b&1){b--;chmax(lastd[b],correctA);} } for(ll a=l,b=r;a+b;a>>=1,b>>=1){ dat[a/2]=eval(a,1)+eval(a^1,1); dat[b/2]=eval(b,1)+eval(b^1,1); } } void init(int N,int A[],int B[]){ rep(i,N)v.emplace_back(make_pair(B[i],A[i])); sort(v.begin(),v.end()); rep(i,NS){ if(i<N)as[i+NS].emplace_back(v[i].second); } for(int i=NS-1;i>0;i--){ int j=0; for(auto t:as[i*2]){ for(;j<as[i*2+1].size()&&as[i*2+1][j]<t;j++){ as[i].emplace_back(as[i*2+1][j]); } as[i].emplace_back(t); } } } int can(int M,int K[]){ tot=0; correctA=0; sort(K,K+M); bool ans=1; rep(i,M){ add(K[i]); ll l,r,mid; l=-1,r=v.size(); while(l<r-1){ mid=(l+r)>>1; (v[mid].first<K[i]?l:r)=mid; } erase(0,l); if(eval(1,1)<K[i]){ ans=0; break; } ll k=1,rui=0; while(k<NS){ ll ev=eval(k*2,1); if(rui+ev>=K[i]){ k=k*2; } else{ rui+=ev; k=k*2+1; } } erase(0,k-NS); } rep(i,tot)dat[used[i]]=0,laste[used[i]]=lastd[used[i]]=-1e17; return ans; } /* int main(){ int n,a[110],b[110]; cin>>n; rep(i,n)cin>>a[i]>>b[i]; init(n,a,b); while(1){ int m,k[110]; cin>>m; rep(i,m)cin>>k[i]; cout<<(can(m,k)?"YES":"NO")<<endl; } }*/

Compilation message (stderr)

teams.cpp:16:0: warning: ignoring #pragma gcc optimize [-Wunknown-pragmas]
 #pragma gcc optimize("O3")
 
teams.cpp:17:0: warning: ignoring #pragma gcc optimize [-Wunknown-pragmas]
 #pragma gcc optimize("unroll-loops")
 
teams.cpp:18:0: warning: ignoring #pragma gcc target [-Wunknown-pragmas]
 #pragma gcc target("avx2,see4")
 
teams.cpp: In function 'll eval(ll, bool)':
teams.cpp:31:20: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
  if(ex)used[tot++]=k;
                    ^
teams.cpp:33:50: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
   chmax(lastd[k*2],lastd[k]); if(ex)used[tot++]=k*2;
                                                 ~^~
teams.cpp:34:54: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
   chmax(lastd[k*2+1],lastd[k]); if(ex)used[tot++]=k*2+1;
                                                   ~~~^~
teams.cpp:36:12: warning: conversion to 'double' from 'll {aka long long int}' may alter its value [-Wconversion]
  if(lastd[k]==-1e17){
     ~~~~~~~^
teams.cpp: In function 'void init(int, int*, int*)':
teams.cpp:76:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(;j<as[i*2+1].size()&&as[i*2+1][j]<t;j++){
         ~^~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...