oj.uz

Submission #969896

# Submission time Handle Problem Language Result Execution time Memory
969896 2024-04-25T18:41:29 Z VinhLuu trapezoid (balkan11_trapezoid) C++17
90 / 100
 149 ms 65536 KB 
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
//#define int long long
#define ll long long
#define fi first
#define se second
#define pb push_back
#define all(lmao) lmao.begin(), lmao.end()

using namespace std;

typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
const int N = 1e5 + 5;
const int M = 1e6 + 5;
const int mod = 30013;
//const ll oo = 5e18;

int n, mx = 0;
vector<pii> open[M], close[M];

int st[M << 1], t[M << 1], f[N], g[N];

void update(int i,int x,int cnt){
    i += mx - 1;
    if(st[i] < x) st[i] = x, t[i] = cnt; else if(st[i] == x) t[i] = (t[i] + cnt) % mod;
    while(i > 1){
        i /= 2;
        if(st[i] < x) st[i] = x, t[i] = cnt; else if(st[i] == x) t[i] = (t[i] + cnt) % mod;
    }
}

pii get(int l,int r){
    r++;
    int ret = 0, cnt = 0;
    for(l += mx - 1, r += mx - 1; l < r; l /= 2, r /= 2){
        if(l & 1){
            if(ret < st[l]) ret = st[l], cnt = t[l];
            else if(ret == st[l]) cnt = (cnt + t[l]) % mod;
            l++;
        }
        if(r & 1){
            --r;
            if(ret < st[r]) ret = st[r], cnt = t[r];
            else if(ret == st[r]) cnt = (cnt + t[r]) % mod;
        }
    }
    return {ret, cnt};
}

signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    #define task "v"
    if(fopen(task ".inp","r")){
        freopen(task ".inp","r",stdin);
        freopen(task ".out","w",stdout);
    }

    cin >> n;
    for(int i = 1; i <= n; i ++){
        int a, b, c, d; cin >> a >> b >> c >> d;
        open[a].pb({i, c});
        close[b + 1].pb({i, d});
        mx = max({mx, d, b});
    }

    for(int i = 1; i <= mx; i ++){
        for(auto [id, j] : close[i]) update(j, f[id], g[id]);
        close[i].clear();
        for(auto [id, j] : open[i]){
            auto kq = get(1, j - 1);
            f[id] = kq.fi + 1, g[id] = kq.se;
            if(f[id] == 1) g[id] = 1;
        }
        open[i].clear();
    }
    int ans = 0, cnt = 0;
    for(int i = 1; i <= n; i ++) if(ans < f[i]) ans = f[i], cnt = g[i]; else if(ans == f[i]) cnt = (cnt + g[i]) % mod;
    cout << ans << " " << cnt;
}

Compilation message

trapezoid.cpp: In function 'int main()':
trapezoid.cpp:57:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |         freopen(task ".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
trapezoid.cpp:58:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |         freopen(task ".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
90.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 49244 KB Output is correct
2 Correct 13 ms 49268 KB Output is correct
3 Correct 12 ms 49244 KB Output is correct
4 Correct 14 ms 49524 KB Output is correct
5 Correct 13 ms 49756 KB Output is correct
6 Correct 15 ms 51036 KB Output is correct
7 Correct 15 ms 50740 KB Output is correct
8 Correct 15 ms 50012 KB Output is correct
9 Correct 20 ms 50532 KB Output is correct
10 Correct 30 ms 56404 KB Output is correct
11 Correct 33 ms 55376 KB Output is correct
12 Correct 59 ms 60756 KB Output is correct
13 Correct 64 ms 64340 KB Output is correct
14 Runtime error 149 ms 65536 KB Execution killed with signal 9
15 Correct 94 ms 60240 KB Output is correct
16 Correct 84 ms 62576 KB Output is correct
17 Runtime error 76 ms 65536 KB Execution killed with signal 9
18 Correct 79 ms 62540 KB Output is correct
19 Correct 85 ms 65536 KB Output is correct
20 Correct 101 ms 65536 KB Output is correct