oj.uz

답안 #787339

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
787339 2023-07-19T05:52:47 Z 8pete8 사다리꼴 (balkan11_trapezoid) C++14
14 / 100
 161 ms 20492 KB 
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include<bitset>
#include<stack>
using namespace std;
#define ll long long
#define f first
#define endl "\n"
#define s second
#define pii pair<int,int>
#define pppiiii pair<pii,pii>
#define ppii pair<pii,pii>
#define all(x) x.begin(),x.end()
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
const int mxn=2*1e5+1,mx=1e6;
#define int long long
pii seg[2*mxn+10];
//mx size + way
int n;
pii comp(pii a,pii b){
    pii tmp=max(a,b);
    if(a.f==b.f)tmp.s=a.s+b.s;
    return tmp;
}
void upd(int pos,pii val){
    pos+=n;
    seg[pos]=comp(seg[pos],val);
    for(;pos>1;pos>>=1)seg[pos>>1]=comp(seg[pos],seg[pos^1]);
}
pii qry(int l,int r){
    pii ans={0,0};
    for(l+=n,r+=n;l<=r;l>>=1,r>>=1){
        if(l&1)ans=comp(ans,seg[l++]);
        if(!(r&1))ans=comp(ans,seg[r--]);
    }
    if(ans.f==0)ans.s=1;
    return ans;
}
vector<int>up;
int getpos(int val){return lb(all(up),val)-up.begin();}
pii ans[mxn+10];
int32_t main(){
    //bot start = qry the up start
    //bot end = update up end
    cin>>n;
    vector<ppii>v;
    for(int i=0;i<n;i++){
        pii a,b;cin>>a.s>>b.s>>a.f>>b.f;
        //up start, up end,bot start, bot end
        up.pb(a.s);
        up.pb(b.s);
        v.pb({a,{1,i}});
        v.pb({b,{-1,i}});
    }
    sort(all(up));
    sort(all(v));
    n*=2;
    for(auto i:v){
        if(i.s.f==1){
            int pos=getpos(i.f.s);
            ans[i.s.s]=qry(0,pos);
            ans[i.s.s].f++;
            //for(int i=0;i<2*n;i++)cout<<seg[i].f<<" "<<seg[i].s<<'\n';
            //cout<<ans[i.s.s].f<<" "<<ans[i.s.s].s<<"A\n";
        }
        else {
            //cout<<"A\n";
            upd(getpos(i.f.s),ans[i.s.s]);
        }
    }
    pii ans=qry(0,n);
    cout<<ans.f<<" "<<ans.s<<'\n';
}

Subtask #1
14.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 232 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 1 ms 340 KB Expected int32, but "10313130667392" found
4 Incorrect 2 ms 464 KB Expected int32, but "-8550276992825950208" found
5 Partially correct 3 ms 724 KB Partially correct
6 Incorrect 4 ms 832 KB Expected int32, but "-8629080777422869056" found
7 Incorrect 6 ms 1092 KB Expected int32, but "-3319866744691032064" found
8 Partially correct 7 ms 1284 KB Partially correct
9 Incorrect 15 ms 2364 KB Expected int32, but "2248786528710863832" found
10 Incorrect 27 ms 4416 KB Expected int32, but "-5022802232222890496" found
11 Incorrect 36 ms 5352 KB Expected int32, but "-1298419000938405298" found
12 Incorrect 77 ms 10412 KB Expected int32, but "9183932486774365824" found
13 Incorrect 89 ms 12156 KB Expected int32, but "-4195152448689438272" found
14 Incorrect 108 ms 15184 KB Expected int32, but "-3175106568905838848" found
15 Incorrect 116 ms 16016 KB Expected int32, but "-8026369531311511552" found
16 Incorrect 125 ms 16808 KB Expected int32, but "6233362917342126368" found
17 Incorrect 161 ms 17956 KB Expected int32, but "-7505826292837535760" found
18 Incorrect 128 ms 18612 KB Expected int32, but "-6197299359079266322" found
19 Incorrect 143 ms 18796 KB Expected int32, but "5619696618904563712" found
20 Incorrect 153 ms 20492 KB Expected int32, but "-335818733633578353" found