oj.uz

답안 #1024975

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1024975 2024-07-16T13:34:20 Z hqminhuwu Pyramid Base (IOI08_pyramid_base) C++14
70 / 100
 5000 ms 161316 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <ll,ll> pll;
typedef pair <int,int> pii;
typedef pair <int,pii> piii;
 
#define forr(_a,_b,_c) for(int _a = (_b); _a <= (_c); ++_a)
#define ford(_a,_b,_c) for(int _a = (_b) + 1; _a --> (_c);)
#define forf(_a,_b,_c) for(int _a = (_b); _a < (_c); ++_a)
#define st first
#define nd second
#define pb push_back
#define mp make_pair
#define all(x) begin(x),end(x)
#define mask(i) (1LL << (i))
#define bit(x, i) (((x) >> (i)) & 1)
#define bp __builtin_popcountll
#define file "test"
 
template<class X, class Y>
    bool minz(X &x, const Y &y) {
        if (x > y) {
            x = y;
            return true;
        } return false;
    }
template<class X, class Y>
    bool maxz(X &x, const Y &y) {
        if (x < y) {
            x = y;
            return true;
        } return false;
    }
 
const int N = 1e6 + 5;
const ll oo = (ll) 1e16;
const ll mod = 1e9 + 7; // 998244353;
 
ll n, m, b, p;
 
namespace sub2{
    int tree[N * 4], lazy[N * 4], sz;
    vector <piii> add[2 * N], rem[2 * N];
    vector <int> co;
    
    void down (int i){
        if (!lazy[i]) return;
        forr (j, i << 1, (i << 1) | 1){
            //cout << i << " " << j << "\n";
            tree[j] += lazy[i];
            lazy[j] += lazy[i];
        }
        lazy[i] = 0;
    }
 
    void update(int i, int l, int r, int u, int v, int val){
        if (l > v || r < u) return;
        if (l >= u && r <= v){
            //cout << i << " " << l << " " << r << " " << val << "\n";
            tree[i] += val;
            lazy[i] += val;
            return;
        }
        down(i);
        int mid = (l + r) >> 1;
        update(i << 1, l, mid, u, v, val);
        update(i << 1 | 1, mid + 1, r, u, v, val);
        tree[i] = min(tree[i << 1], tree[i << 1 | 1]);
        //cout << i << " " << tree[i] << "\n";
    }
 
    int get (int i, int l, int r, int u, int v){
        if (u > r || v < l) return 2 * mod;
        if (l >= u && r <= v) return tree[i];
        down(i);
        int mid = (l + r) >> 1;
        return min(get(i << 1, l, mid, u, v), get(i << 1 | 1, mid + 1, r, u, v));
    }
 
    int calc(int len){
        if (!len) return 0;
        memset (tree, 0, sizeof tree);
        memset (lazy, 0, sizeof lazy); 
        int z = upper_bound(all(co), len) - co.begin();
        int res = 2 * mod;
        forr (i, 1, n){
          int flag = (i == len);
           // cout << i << ":\n";
            for (piii t : add[i]){
              	flag = 1; 
                int u = upper_bound(all(co), t.nd.nd + len - 1) - co.begin();
                int v = lower_bound(all(co), t.nd.st) - co.begin();
                //cout << "add " << t.nd.st << " " << t.nd.nd << " " << v << " " << u << " " << t.st << "\n";
                update(1, 1, m, t.nd.st, min(m, (ll)t.nd.nd + len - 1), t.st);
            }
            if (i >= len){
                for (piii t : rem[i - len]){
                    flag = 1;
                    int u = upper_bound(all(co), t.nd.nd + len - 1) - co.begin();
                    int v = lower_bound(all(co), t.nd.st) - co.begin() + 1;
                    //cout << "rem " << t.nd.st << " " << t.nd.nd << " " << v << " " << u << "\n";
                    update(1, 1, m, t.nd.st, min(m, (ll)t.nd.nd + len - 1), -t.st);
                }
            }
            if (i >= len && flag){
 
                res = min (res, get(1, 1, m, len, m));
                //cout << tree[1] << "\n";
            }
        }
        return res;
    }
    
    void solve(){
        forr (i, 1, p){
            int x, y, u, v, w;
            cin >> x >> y >> u >> v >> w;
            add[x].pb({w, {y, v}});
            rem[u].pb({w, {y, v}});
            co.pb(y);
            co.pb(v);
        }
        co.pb(m);
        sort(all(co));
        co.erase(unique(all(co)), co.end());
        sz = co.size();
        //cout << sz << "\n";
        // for (int u : co){
        //     cout << u << " ";
        // }
        // cout << "\n";
       // cout << calc(33541) << "\n";
        int l = 0, r = min(n, m);
        while (l < r){
            int mid = (l + r + 1) >> 1;
            if (calc(mid) <= b)
                l = mid;
            else r = mid - 1;
        }
 
         cout << l << "\n";
    }
}
 
namespace sub3{
    void solve(){
 
    }
}
 
int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    #ifdef hqm
        freopen(file".inp", "r", stdin); freopen(file".ans", "w", stdout);
    #endif
 
    cin >> n >> m >> b >> p;
    if (b >= 0) sub2::solve();
    else sub3::solve();
 
    return 0;
}
/*
 
 
 
*/

Compilation message

pyramid_base.cpp: In function 'int sub2::calc(int)':
pyramid_base.cpp:93:21: warning: unused variable 'u' [-Wunused-variable]
   93 |                 int u = upper_bound(all(co), t.nd.nd + len - 1) - co.begin();
      |                     ^
pyramid_base.cpp:94:21: warning: unused variable 'v' [-Wunused-variable]
   94 |                 int v = lower_bound(all(co), t.nd.st) - co.begin();
      |                     ^
pyramid_base.cpp:101:25: warning: unused variable 'u' [-Wunused-variable]
  101 |                     int u = upper_bound(all(co), t.nd.nd + len - 1) - co.begin();
      |                         ^
pyramid_base.cpp:102:25: warning: unused variable 'v' [-Wunused-variable]
  102 |                     int v = lower_bound(all(co), t.nd.st) - co.begin() + 1;
      |                         ^
pyramid_base.cpp:86:13: warning: unused variable 'z' [-Wunused-variable]
   86 |         int z = upper_bound(all(co), len) - co.begin();
      |             ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 125524 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 59 ms 125532 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 125580 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 77 ms 125704 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 111 ms 125520 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 136 ms 125664 KB Output is correct
2 Correct 178 ms 125520 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 173 ms 125524 KB Output is correct
2 Correct 133 ms 125528 KB Output is correct

Subtask #8
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 107 ms 125928 KB Output is correct
2 Correct 124 ms 125780 KB Output is correct
3 Correct 112 ms 125976 KB Output is correct

Subtask #9
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 278 ms 126564 KB Output is correct
2 Correct 292 ms 126544 KB Output is correct
3 Correct 270 ms 126544 KB Output is correct

Subtask #10
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 471 ms 126932 KB Output is correct
2 Correct 168 ms 127060 KB Output is correct
3 Correct 154 ms 126412 KB Output is correct
4 Correct 723 ms 126924 KB Output is correct

Subtask #11
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 671 ms 127180 KB Output is correct
2 Correct 725 ms 127196 KB Output is correct
3 Correct 402 ms 127264 KB Output is correct

Subtask #12
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 593 ms 127696 KB Output is correct
2 Correct 930 ms 127416 KB Output is correct
3 Correct 1100 ms 128364 KB Output is correct
4 Correct 974 ms 128284 KB Output is correct
5 Correct 886 ms 128448 KB Output is correct
6 Correct 402 ms 128628 KB Output is correct

Subtask #13
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5036 ms 143808 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #14
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5049 ms 152248 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #15
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5066 ms 161316 KB Time limit exceeded
2 Halted 0 ms 0 KB -