oj.uz

Submission #834049

# Submission time Handle Problem Language Result Execution time Memory
834049 2023-08-22T10:22:19 Z sysia Garden (JOI23_garden) C++17
100 / 100
 2387 ms 27916 KB 
//Sylwia Sapkowska
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;

void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << "'" << x << "'";}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

#define int long long
typedef pair<int, int> T;
const int oo = 1e18, oo2 = 1e9+7, K = 30;
const int mod = 998244353;


void solve(){
    int n, m, d; cin >> n >> m >> d;
    vector<int>Y; //,X;
    int mx = 2*d;
    vector<vector<int>>pion(mx), poz(mx), p(mx);
    for (int i = 0; i<n; i++){
        int x, y; cin >> x >> y;
        //4 punkty
        p[x].emplace_back(y);
        p[x+d].emplace_back(y);
    }
    vector<int>tab(d); //tylko punkty 
    int sum = 0;
    vector<int>last(d, -1), cnt(d); //punkty z prostych poziomych
    for (int i = 0; i<m; i++){
        int a, b; cin >> a >> b;
        // X.emplace_back(a);
        Y.emplace_back(b);
        cnt[b]++;
        last[b] = max(last[b],a);
        pion[a].emplace_back(i);
        pion[a+d].emplace_back(i);
        poz[b].emplace_back(i);
    }   
    int ans = oo;
    auto add = [&](int R){
        for (auto y: p[R]) {
            tab[y]++;
            sum++;
        }
        for (auto i:pion[R]){
            cnt[Y[i]]--;
            if (!cnt[Y[i]]) last[Y[i]] = -1;
        }
    };
    auto remove = [&](int L){
        for (auto y: p[L]){
            tab[y]--;
            sum--;
        }
        for (auto i: pion[L]){
            cnt[Y[i]]++;
            last[Y[i]] = L+d;
        }
    };
    auto calc = [&](int L, int R, vector<int>a){
        // if (L != 3) return;
        int S = 0;
        for (int i = 0; i < d; i++) {
            a[i] += cnt[i];
            S += a[i];
        }
        for (int i = 0; i<d; i++) a.emplace_back(a[i]);
        vector<int>prev(mx, oo), nxt(mx, oo);
        for (int i = 1; i<mx; i++){
            prev[i] = (a[i-1] ? i-1 : prev[i-1]);
        }
        for (int i = mx-2; i>=0; i--){
            nxt[i] = (a[i+1] ? i+1 : nxt[i+1]);
        }
        debug(a);
        vector<T>ord;
        for (int i = 0; i<d; i++){
            if (last[i] > R && !tab[i]){
                ord.emplace_back(last[i], i);
            }
        }
        sort(ord.begin(), ord.end());
        debug(ord);
        int r = -1;
        int curr = 0;
        vector<int>pocz(mx, -1), kon(mx, -1);
        int mn = oo;
        for (int l = 0; l < d; l++){
            while (curr < S){
                curr += a[++r];
            }
            if (curr == S){
                pocz[l] = r;
                kon[r] = max(kon[r], l);
                ans = min(ans, (R-L+1)*(r-l+1));
                mn = min(mn, r-l+1);
            }
            curr -= a[l];
        }
        debug(pocz);
        debug(kon);
        //i teraz bedziemy ustawiac 0 na niektorych pozycjach
        for (auto [R2, i]: ord){
            for (auto p: {i, i+d}){
                
                //1. przedzial zaczynajacy sie w p
                int newl = nxt[p];
                if (pocz[p] != -1 && newl != oo) {
                    //nowy przedzial(!)
                    debug(p, pocz[p], newl);
                    pocz[newl] = pocz[p];
                    kon[pocz[p]] = newl;
                    mn = min(mn, pocz[p]-newl+1);
                }
                //2. przedzial konczacy sie w p
                int newr = prev[p];
                if (kon[p] != -1 && newr != oo){
                    kon[newr] = max(kon[newr], kon[p]);
                    pocz[kon[p]] = newr;
                    mn = min(mn, newr-kon[p]+1);
                }
                if (prev[p] != oo) nxt[prev[p]] = nxt[p];
                if (nxt[p] != oo) prev[nxt[p]] = prev[p];
            }
            debug(R2-L+1, mn);
            ans = min(ans, (R2-L+1)*mn);
        }    
    };
    int R = -1;
    tab.assign(d, 0);
    for (int L = 0; L < d; L++){
        while (R+1 < 2*d && sum != n){
            add(++R);            
        }
        if (sum == n){
            // debug(L, R);
            // debug(last);
            // debug(tab);
            // debug(cnt);
            calc(L, R, tab);
        }
        remove(L);
    }
    cout << ans << "\n";
}

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

    int t = 1;
    //cin >> t;
    while (t--) solve();

    return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 154 ms 14968 KB Output is correct
2 Correct 67 ms 14796 KB Output is correct
3 Correct 459 ms 9448 KB Output is correct
4 Correct 476 ms 10720 KB Output is correct
5 Correct 459 ms 10696 KB Output is correct
6 Correct 814 ms 12124 KB Output is correct
7 Correct 822 ms 12356 KB Output is correct
8 Correct 690 ms 14012 KB Output is correct
9 Correct 696 ms 17140 KB Output is correct
10 Correct 48 ms 10140 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 592 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 592 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 544 KB Output is correct
14 Correct 2 ms 564 KB Output is correct
15 Correct 1 ms 584 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 588 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 596 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 592 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 544 KB Output is correct
14 Correct 2 ms 564 KB Output is correct
15 Correct 1 ms 584 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 588 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 2 ms 596 KB Output is correct
25 Correct 2 ms 596 KB Output is correct
26 Correct 1 ms 596 KB Output is correct
27 Correct 2 ms 624 KB Output is correct
28 Correct 2 ms 576 KB Output is correct
29 Correct 1 ms 596 KB Output is correct
30 Correct 2 ms 596 KB Output is correct
31 Correct 1 ms 596 KB Output is correct
32 Correct 1 ms 596 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 592 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 544 KB Output is correct
14 Correct 2 ms 564 KB Output is correct
15 Correct 1 ms 584 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 588 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 2 ms 596 KB Output is correct
25 Correct 2 ms 596 KB Output is correct
26 Correct 1 ms 596 KB Output is correct
27 Correct 2 ms 624 KB Output is correct
28 Correct 2 ms 576 KB Output is correct
29 Correct 1 ms 596 KB Output is correct
30 Correct 2 ms 596 KB Output is correct
31 Correct 1 ms 596 KB Output is correct
32 Correct 1 ms 596 KB Output is correct
33 Correct 18 ms 896 KB Output is correct
34 Correct 1 ms 596 KB Output is correct
35 Correct 1593 ms 2076 KB Output is correct
36 Correct 1617 ms 2128 KB Output is correct
37 Correct 1617 ms 2172 KB Output is correct
38 Correct 1576 ms 2296 KB Output is correct
39 Correct 1308 ms 2068 KB Output is correct
40 Correct 1200 ms 2060 KB Output is correct
41 Correct 1006 ms 3000 KB Output is correct
42 Correct 969 ms 2156 KB Output is correct
43 Correct 996 ms 2184 KB Output is correct
44 Correct 818 ms 1988 KB Output is correct
45 Correct 770 ms 2032 KB Output is correct
46 Correct 630 ms 3508 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 154 ms 14968 KB Output is correct
2 Correct 67 ms 14796 KB Output is correct
3 Correct 459 ms 9448 KB Output is correct
4 Correct 476 ms 10720 KB Output is correct
5 Correct 459 ms 10696 KB Output is correct
6 Correct 814 ms 12124 KB Output is correct
7 Correct 822 ms 12356 KB Output is correct
8 Correct 690 ms 14012 KB Output is correct
9 Correct 696 ms 17140 KB Output is correct
10 Correct 48 ms 10140 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 464 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 588 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 1 ms 592 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 1 ms 544 KB Output is correct
24 Correct 2 ms 564 KB Output is correct
25 Correct 1 ms 584 KB Output is correct
26 Correct 1 ms 596 KB Output is correct
27 Correct 1 ms 588 KB Output is correct
28 Correct 1 ms 596 KB Output is correct
29 Correct 1 ms 596 KB Output is correct
30 Correct 1 ms 596 KB Output is correct
31 Correct 1 ms 596 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 2 ms 468 KB Output is correct
34 Correct 2 ms 596 KB Output is correct
35 Correct 2 ms 596 KB Output is correct
36 Correct 1 ms 596 KB Output is correct
37 Correct 2 ms 624 KB Output is correct
38 Correct 2 ms 576 KB Output is correct
39 Correct 1 ms 596 KB Output is correct
40 Correct 2 ms 596 KB Output is correct
41 Correct 1 ms 596 KB Output is correct
42 Correct 1 ms 596 KB Output is correct
43 Correct 18 ms 896 KB Output is correct
44 Correct 1 ms 596 KB Output is correct
45 Correct 1593 ms 2076 KB Output is correct
46 Correct 1617 ms 2128 KB Output is correct
47 Correct 1617 ms 2172 KB Output is correct
48 Correct 1576 ms 2296 KB Output is correct
49 Correct 1308 ms 2068 KB Output is correct
50 Correct 1200 ms 2060 KB Output is correct
51 Correct 1006 ms 3000 KB Output is correct
52 Correct 969 ms 2156 KB Output is correct
53 Correct 996 ms 2184 KB Output is correct
54 Correct 818 ms 1988 KB Output is correct
55 Correct 770 ms 2032 KB Output is correct
56 Correct 630 ms 3508 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 791 ms 1760 KB Output is correct
60 Correct 197 ms 16916 KB Output is correct
61 Correct 143 ms 26192 KB Output is correct
62 Correct 2387 ms 26804 KB Output is correct
63 Correct 2344 ms 26856 KB Output is correct
64 Correct 1955 ms 27916 KB Output is correct
65 Correct 1206 ms 27276 KB Output is correct
66 Correct 2302 ms 26764 KB Output is correct
67 Correct 1577 ms 27672 KB Output is correct
68 Correct 2268 ms 26788 KB Output is correct
69 Correct 1457 ms 27844 KB Output is correct
70 Correct 663 ms 27076 KB Output is correct
71 Correct 1738 ms 26752 KB Output is correct
72 Correct 1762 ms 26724 KB Output is correct
73 Correct 302 ms 24792 KB Output is correct
74 Correct 297 ms 21652 KB Output is correct