oj.uz

답안 #1007670

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1007670 2024-06-25T10:01:38 Z doducanh 사다리꼴 (balkan11_trapezoid) C++14
50 / 100
 500 ms 8876 KB 
#include <bits/stdc++.h>

using namespace std;
#define fi first
#define se second
const int maxn=1e5+7;
const int mod=30013;
const int maxx=1e9+7;
void cmax(pair<int,int>&a,pair<int,int>b)
{
    if(a.fi<b.fi)a=b;
    else{
        if(a.fi==b.fi&&a.fi!=0)a.se=(a.se+b.se)%mod;
    }
}
int id(int x,vector<pair<int,int>>tmp)
{
    return lower_bound(tmp.begin(),tmp.end(),make_pair(x,-maxx))-tmp.begin()+1;
}
struct BIT
{
    int n;
    vector<pair<int,int>>t;
    BIT(){}
    BIT(int n):n(n),t(n+7,make_pair(0,1)){}
    void up(int x,pair<int,int> val){
        for(;x<=n;x+=(x&(-x)))cmax(t[x],val);
    }
    pair<int,int>get(int x)
    {
        if(x<=0)return {0,1};
        pair<int,int>res={0,1};
        for(;x;x-=(x&(-x)))cmax(res,t[x]);
        return res;
    }
};
int a[maxn],b[maxn],c[maxn],d[maxn];
int n;
pair<int,int>ans[maxn];
main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin>>n;
    vector<pair<int,int>>top;
    vector<pair<int,int>>bot;
    for(int i=1;i<=n;i++){
        cin>>a[i]>>b[i]>>c[i]>>d[i];
        top.push_back({a[i],i});
        top.push_back({b[i],i});
        bot.push_back({c[i],i});
        bot.push_back({d[i],i});
    }
    sort(top.begin(),top.end());
    sort(bot.begin(),bot.end());
    BIT t(bot.size());
    for(pair<int,int>p:top){
        int x=p.fi;
        int i=p.se;
        if(x==a[i]){
            int x=id(c[i],bot)-1;
            pair<int,int>tmp=t.get(x);
            ans[i]={tmp.fi+1,tmp.se};
        }
        else if(x==b[i]){
            int x=id(d[i],bot);
            t.up(x,ans[i]);
        }
    }
    pair<int,int>res={0,0};
    for(int i=1;i<=n;i++){
        cmax(res,ans[i]);
    }
    cout<<res.fi<<" "<<res.se;
    return 0;
}

Compilation message

trapezoid.cpp:40:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   40 | main()
      | ^~~~

Subtask #1
50.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 7 ms 2676 KB Output is correct
6 Correct 15 ms 2652 KB Output is correct
7 Correct 30 ms 2804 KB Output is correct
8 Correct 37 ms 2908 KB Output is correct
9 Correct 141 ms 3128 KB Output is correct
10 Correct 496 ms 3792 KB Output is correct
11 Execution timed out 929 ms 4300 KB Time limit exceeded
12 Execution timed out 1057 ms 5824 KB Time limit exceeded
13 Execution timed out 1070 ms 6344 KB Time limit exceeded
14 Execution timed out 1073 ms 7096 KB Time limit exceeded
15 Execution timed out 1044 ms 7348 KB Time limit exceeded
16 Execution timed out 1055 ms 7640 KB Time limit exceeded
17 Execution timed out 1073 ms 8116 KB Time limit exceeded
18 Execution timed out 1065 ms 8376 KB Time limit exceeded
19 Execution timed out 1031 ms 8660 KB Time limit exceeded
20 Execution timed out 1059 ms 8876 KB Time limit exceeded