oj.uz

답안 #377757

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
377757 2021-03-14T23:54:35 Z rrrr10000 운세 보기 2 (JOI14_fortune_telling2) C++14
4 / 100
 3000 ms 5216 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define pb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void outset(T s){auto itr=s.begin();while(itr!=s.end()){if(itr!=s.begin())cout<<' ';cout<<*itr;itr++;}cout<<'\n';}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
class BIT{
    vi bit;
public:
    BIT(ll n):bit(n){}
    void add(ll i,ll x){
        for(int j=i;j<bit.size();j=j|(j+1))bit[j]+=x;
    }
    ll get(ll i){
        ll res=0;
        for(int j=i;j>=0;j=((j+1)&j)-1)res+=bit[j];
        return res;
    }
    ll get(ll a,ll b){
        return get(b-1)-get(a-1);
    }
};
int main(){
    ll n,k;cin>>n>>k;
    vp v(n);
    rep(i,n)cin>>v[i].fi>>v[i].se;
    vb swapped(n,false);
    rep(i,n){
        if(v[i].fi>v[i].se){
            swap(v[i].fi,v[i].se);
            swapped[i]=true;
        }
    }
    vi t(k);
    rep(i,k)cin>>t[i];
    vi srt;
    rep(i,n){
        srt.pb(v[i].fi);srt.pb(v[i].se);
    }
    rep(i,k)srt.pb(t[i]);
    dupli(srt);
    BIT seg(srt.size());
    vp id(n);
    rep(i,n){
        id[i].fi=lb(srt,v[i].fi);
        id[i].se=lb(srt,v[i].se);
    }
    vb done(n,false);
    ll ans=0;
    for(int i=k-1;i>=0;i--){
        ll l=lb(srt,t[i]);
        rep(j,n)if(!done[j]&&id[j].fi<=l&&l<id[j].se){
            done[j]=true;
            ll num=seg.get(id[j].se,srt.size());
            if(num&1)ans+=v[j].fi;
            else ans+=v[j].se;
            // cout<<i<<' '<<j<<' '<<num<<endl;
        }
        seg.add(l,1);
    }
    // out(ans);
    rep(j,n)if(!done[j]){
        ll num=seg.get(id[j].se,srt.size());
        if(swapped[j])num++;
        if(num&1)ans+=v[j].se;
        else ans+=v[j].fi;
    }
    out(ans);
}

Compilation message

fortune_telling2.cpp: In member function 'void BIT::add(ll, ll)':
fortune_telling2.cpp:55:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |         for(int j=i;j<bit.size();j=j|(j+1))bit[j]+=x;
      |                     ~^~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 4 ms 364 KB Output is correct
4 Correct 4 ms 364 KB Output is correct
5 Correct 4 ms 364 KB Output is correct
6 Correct 4 ms 364 KB Output is correct
7 Correct 6 ms 364 KB Output is correct
8 Correct 3 ms 364 KB Output is correct
9 Correct 3 ms 364 KB Output is correct
10 Correct 3 ms 364 KB Output is correct
11 Correct 5 ms 364 KB Output is correct
12 Correct 4 ms 364 KB Output is correct
13 Correct 6 ms 364 KB Output is correct

Subtask #2
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 4 ms 364 KB Output is correct
4 Correct 4 ms 364 KB Output is correct
5 Correct 4 ms 364 KB Output is correct
6 Correct 4 ms 364 KB Output is correct
7 Correct 6 ms 364 KB Output is correct
8 Correct 3 ms 364 KB Output is correct
9 Correct 3 ms 364 KB Output is correct
10 Correct 3 ms 364 KB Output is correct
11 Correct 5 ms 364 KB Output is correct
12 Correct 4 ms 364 KB Output is correct
13 Correct 6 ms 364 KB Output is correct
14 Correct 136 ms 1384 KB Output is correct
15 Correct 503 ms 2276 KB Output is correct
16 Correct 1090 ms 2972 KB Output is correct
17 Correct 1951 ms 3960 KB Output is correct
18 Correct 1938 ms 5212 KB Output is correct
19 Correct 1908 ms 5216 KB Output is correct
20 Correct 1975 ms 5124 KB Output is correct
21 Correct 1931 ms 5088 KB Output is correct
22 Correct 1888 ms 4320 KB Output is correct
23 Correct 1884 ms 4064 KB Output is correct
24 Correct 1893 ms 3932 KB Output is correct
25 Correct 1938 ms 4576 KB Output is correct
26 Execution timed out 3089 ms 4320 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #3
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 4 ms 364 KB Output is correct
4 Correct 4 ms 364 KB Output is correct
5 Correct 4 ms 364 KB Output is correct
6 Correct 4 ms 364 KB Output is correct
7 Correct 6 ms 364 KB Output is correct
8 Correct 3 ms 364 KB Output is correct
9 Correct 3 ms 364 KB Output is correct
10 Correct 3 ms 364 KB Output is correct
11 Correct 5 ms 364 KB Output is correct
12 Correct 4 ms 364 KB Output is correct
13 Correct 6 ms 364 KB Output is correct
14 Correct 136 ms 1384 KB Output is correct
15 Correct 503 ms 2276 KB Output is correct
16 Correct 1090 ms 2972 KB Output is correct
17 Correct 1951 ms 3960 KB Output is correct
18 Correct 1938 ms 5212 KB Output is correct
19 Correct 1908 ms 5216 KB Output is correct
20 Correct 1975 ms 5124 KB Output is correct
21 Correct 1931 ms 5088 KB Output is correct
22 Correct 1888 ms 4320 KB Output is correct
23 Correct 1884 ms 4064 KB Output is correct
24 Correct 1893 ms 3932 KB Output is correct
25 Correct 1938 ms 4576 KB Output is correct
26 Execution timed out 3089 ms 4320 KB Time limit exceeded
27 Halted 0 ms 0 KB -