oj.uz

답안 #920501

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
920501 2024-02-02T16:08:09 Z ttamx 사다리꼴 (balkan11_trapezoid) C++14
4 / 100
 103 ms 9504 KB 
#include<bits/stdc++.h>

using namespace std;

const int N=1e5+5;
const int M=2e5+5;

int n;
int v1[M],v2[M],id1[N],id2[N];

struct Trapezoid{
    int a,b,c,d;
    Trapezoid(){};
}t[N];

struct Info{
    int val,freq;
    Info():val(0),freq(0){}
    Info(int _val,int _freq):val(_val),freq(_freq){}
    friend Info operator+(const Info &lhs,const Info &rhs){
        if(lhs.val>rhs.val)return lhs;
        if(lhs.val<rhs.val)return rhs;
        return Info(lhs.val,lhs.freq+rhs.freq);
    }
    Info &operator+=(const Info &rhs){
        *this=*this+rhs;
        return *this;
    }
}dp[N];

struct fenwick{
    Info t[M];
    void update(int i,Info v){
        for(;i<M;i+=i&-i)t[i]+=v;
    }
    Info query(int i){
        Info res{};
        for(;i>0;i-=i&-i)res+=t[i];
        return res;
    }
}f;

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n;
    for(int i=1;i<=n;i++){
        cin >> t[i].a >> t[i].b >> t[i].c >> t[i].d;
        v1[i*2-1]=t[i].a;
        v1[i*2]=t[i].b;
        v2[i*2-1]=t[i].c;
        v2[i*2]=t[i].d;
    }
    sort(v1+1,v1+2*n+1);
    sort(v2+1,v2+2*n+1);
    for(int i=1;i<=n;i++){
        t[i].a=lower_bound(v1+1,v1+2*n+1,t[i].a)-v1;
        t[i].b=lower_bound(v1+1,v1+2*n+1,t[i].b)-v1;
        t[i].c=lower_bound(v2+1,v2+2*n+1,t[i].c)-v2;
        t[i].d=lower_bound(v2+1,v2+2*n+1,t[i].d)-v2;
    }
    iota(id1+1,id1+n+1,1);
    iota(id2+1,id2+n+1,1);
    sort(id1+1,id1+n+1,[&](int i,int j){return t[i].a<t[j].a;});
    sort(id2+1,id2+n+1,[&](int i,int j){return t[i].b<t[j].b;});
    Info ans{};
    for(int _i=1,p=1;_i<=n;_i++){
        int i=id1[_i];
        while(t[id2[p]].b<t[i].a)f.update(t[id2[p]].d,dp[id2[p++]]);
        dp[i]=f.query(t[i].c);
        dp[i].val++;
        if(dp[i].freq==0)dp[i].freq=1;
        ans+=dp[i];
    }
    cout << ans.val << " " << ans.freq;
}

Compilation message

trapezoid.cpp: In function 'int main()':
trapezoid.cpp:68:63: warning: operation on 'p' may be undefined [-Wsequence-point]
   68 |         while(t[id2[p]].b<t[i].a)f.update(t[id2[p]].d,dp[id2[p++]]);
      |                                                              ~^~
trapezoid.cpp:68:63: warning: operation on 'p' may be undefined [-Wsequence-point]

Subtask #1
4.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 4700 KB Partially correct
2 Incorrect 1 ms 4700 KB Output isn't correct
3 Incorrect 1 ms 4700 KB Output isn't correct
4 Incorrect 2 ms 4700 KB Output isn't correct
5 Incorrect 3 ms 4700 KB Output isn't correct
6 Incorrect 3 ms 4700 KB Output isn't correct
7 Incorrect 4 ms 4912 KB Output isn't correct
8 Incorrect 5 ms 4956 KB Output isn't correct
9 Incorrect 10 ms 4956 KB Output isn't correct
10 Incorrect 18 ms 5468 KB Output isn't correct
11 Incorrect 23 ms 5724 KB Output isn't correct
12 Incorrect 53 ms 7128 KB Output isn't correct
13 Incorrect 57 ms 7260 KB Output isn't correct
14 Incorrect 68 ms 8088 KB Output isn't correct
15 Incorrect 77 ms 8020 KB Output isn't correct
16 Incorrect 85 ms 8432 KB Output isn't correct
17 Incorrect 85 ms 8572 KB Output isn't correct
18 Partially correct 84 ms 8788 KB Partially correct
19 Incorrect 91 ms 8924 KB Output isn't correct
20 Incorrect 103 ms 9504 KB Output isn't correct