oj.uz

Submission #430374

# Submission time Handle Problem Language Result Execution time Memory
430374 2021-06-16T13:14:41 Z arayi Pyramid Base (IOI08_pyramid_base) C++17
44 / 100
 5000 ms 118212 KB 
//Arayi
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <math.h>   
#include <vector>
#include <cstring>
#include <ctime>
#include <set>
#include <bitset>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <ctime>
#include <climits>
#include <cassert>
#include <chrono>
#include <random>
#include <complex>
 
#define fr first
#define sc second
#define MP make_pair
#define ad push_back
#define PB push_back
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define lli long long int
#define y1 arayikhalatyan
#define j1 jigglypuff
#define ld long double
#define itn int
#define pir pair<int, int>
#define all(x) (x).begin(), (x).end()
#define str string
#define enl endl
#define en endl
#define cd complex<long double>
#define vcd vector<cd>
#define vii vector<int>
#define vlli vector<lli>
using namespace std;
 
const int N = 1e6 + 30;
 
 
int n, k, m, p;
int x1[N], x2[N], y1[N], y2[N], c[N];
vector <pair<pair<int, int>, int> > fp[N];
lli t[4*N], flg[4*N];
void push(int nd)
{
    t[nd] += flg[nd];
    flg[nd*2] += flg[nd];
    flg[nd*2+1] += flg[nd];
    flg[nd] = 0;
}
void upd(int l, int r, int v, int nl = 1, int nr = m, int nd = 1)
{
    push(nd);
    if(l > nr || r < nl) return;
    if(l == nl && nr == r)
    {
        flg[nd] += v;
        push(nd);
        return;
    }
    int mid = (nl + nr) / 2;
    upd(l, min(mid, r), v, nl, mid, nd*2);
    upd(max(mid + 1, l), r, v, mid + 1, nr, nd * 2 + 1);
    t[nd] = min(t[nd*2], t[nd*2+1]);
}
bool stg(int md)
{
    for (int i = 0; i <= 4*m; i++) flg[i]=t[i]=0;
    upd(m - md + 2, m, k + 1);
    for (int i = 1; i <= n - md + 1; i++)
    {
        for(auto& p : fp[i])
            upd(p.fr.fr, p.fr.sc, p.sc);
        push(1);
        if(t[1] <= k) return 1;
    }
    return 0;
}
int main()
{
    fastio;
    //freopen("input.in", "r", stdin);
    cin >> n >> m >> k >> p;
    for (int i = 0; i < p; i++) cin >> x1[i] >> y1[i] >> x2[i] >> y2[i] >> c[i];
    int l = 1, r = min(n, m), ans = 0;
    while(l <= r)
    {
        int md = (l + r) / 2;
        for (int i = 0; i < p; i++)
        {
            fp[max(1, x1[i] - md + 1)].ad(MP(MP(max(1, y1[i] - md + 1), y2[i]), c[i]));
            fp[x2[i] + 1].ad(MP(MP(max(1, y1[i] - md + 1), y2[i]), -c[i]));
        }
        if(stg(md)) ans = md, l=md+1;
        else r=md-1;
        for (int i = 0; i <= n + 1; i++) fp[i].clear();
    }
    cout << ans << endl;
    return 0;
}
 
/*
    __
  *(><)*
    \/ /
    ||/
  --||
    ||
    /\
   /  \
  /    \
 
*/

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23756 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 23800 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 23964 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 24812 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 31304 KB Output is correct

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 307 ms 86660 KB Output is correct
2 Incorrect 425 ms 86948 KB Output isn't correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 422 ms 86916 KB Output is correct
2 Correct 323 ms 86692 KB Output is correct

Subtask #8
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 25080 KB Output is correct
2 Correct 92 ms 25184 KB Output is correct
3 Correct 81 ms 25284 KB Output is correct

Subtask #9
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 352 ms 33668 KB Output is correct
2 Correct 566 ms 34188 KB Output is correct
3 Correct 445 ms 34244 KB Output is correct

Subtask #10
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 964 ms 91652 KB Output is correct
2 Correct 125 ms 28684 KB Output is correct
3 Correct 373 ms 87628 KB Output is correct
4 Incorrect 1597 ms 93720 KB Output isn't correct

Subtask #11
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1427 ms 94248 KB Output is correct
2 Incorrect 2037 ms 97608 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #12
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1449 ms 92552 KB Output is correct
2 Incorrect 2786 ms 99512 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #13
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5091 ms 111156 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #14
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5104 ms 112172 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #15
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5102 ms 118212 KB Time limit exceeded
2 Halted 0 ms 0 KB -