oj.uz

Submission #398188

# Submission time Handle Problem Language Result Execution time Memory
398188 2021-05-03T21:41:34 Z duality Harvest (JOI20_harvest) C++11
100 / 100
 2211 ms 461544 KB 
#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<typename T>
using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
#pragma GCC optimize("Ofast")

int A[200000],B[200000];
vector<pair<LLI,int> > queries[200000];
LLI ans[200000];
int n[200000];
LLI t[200000];
int in[200000];
vi adjList[200000];
queue<int> QQ;
ordered_set<pair<LLI,int> > S[200000];
LLI add[200000];
int doDFS(int u) {
    int i;
    for (i = 0; i < adjList[u].size(); i++) {
        int v = adjList[u][i];
        doDFS(v),add[v] += t[v];
        if (S[v].size() > S[u].size()) S[u].swap(S[v]),swap(add[u],add[v]);
        for (auto it = S[v].begin(); it != S[v].end(); it++) S[u].insert(mp(it->first+add[v]-add[u],it->second));
        S[v].clear();
    }
    if (in[u] == 0) {
        for (i = 0; i < queries[u].size(); i++) ans[queries[u][i].second] = S[u].order_of_key(mp(queries[u][i].first-add[u],1e9));
    }
    return 0;
}
LLI bit[400001];
struct data {
    vector<pair<pii,LLI> > vv;
    int update(int i,LLI num) {
        vv.pb(mp(mp(i,-1),num));
        return 0;
    }
    int query(int i,int a,LLI n) {
        vv.pb(mp(mp(i,a),n));
        return 0;
    }
    int process() {
        int i,j;
        for (i = 0; i < vv.size(); i++) {
            if (vv[i].first.second == -1) {
                for (j = vv[i].first.first+1; j <= 400000; j += j & (-j)) bit[j] += vv[i].second;
            }
            else {
                for (j = vv[i].first.first+1; j > 0; j -= j & (-j)) ans[vv[i].first.second] += vv[i].second*bit[j];
            }
        }
        for (i = 0; i < vv.size(); i++) {
            if (vv[i].first.second == -1) {
                for (j = vv[i].first.first+1; j <= 400000; j += j & (-j)) bit[j] = 0;
            }
        }
        vv.clear();
        return 0;
    }
};
data tree1[400001],tree2[400001];
int update(int s,int i,int p,LLI num,LLI num2) {
    for (i++; i <= s; i += i & (-i)) {
        tree1[i].update(p,num);
        tree2[i].update(p,num2);
    }
    return 0;
}
int query(int i,int a,int p,LLI n,LLI n2) {
    for (i++; i > 0; i -= i & (-i)) {
        tree1[i].query(p,a,n);
        tree2[i].query(p,a,n2);
    }
    return 0;
}
int main() {
    int i;
    int N,M,L,C,Q,V;
    LLI T;
    scanf("%d %d %d %d",&N,&M,&L,&C);
    for (i = 0; i < N; i++) scanf("%d",&A[i]);
    for (i = 0; i < M; i++) scanf("%d",&B[i]);
    scanf("%d",&Q);
    for (i = 0; i < Q; i++) {
        scanf("%d %lld",&V,&T);
        queries[V-1].pb(mp(T,i));
    }

    int j = 0;
    for (i = 0; i < 2*N; i++) {
        while ((j <= i) && ((A[i % N]+(i >= N)*L)-(A[j % N]+(j >= N)*L) >= (C % L))) j++;
        if (j > 0) j--;
        if (i >= N) n[i-N] = j % N,t[i-N] = (A[i % N]+(i >= N)*L)-(A[j % N]+(j >= N)*L)+L*(C/L);
    }
    j = 0;
    for (i = 0; i < M; i++) {
        while ((j < N) && (A[j] <= B[i])) j++;
        if (j > 0) j--,S[j].insert(mp(B[i]-A[j],i));
        else S[N-1].insert(mp(B[i]-A[N-1]+L,i));
    }
    for (i = 0; i < N; i++) in[n[i]]++;
    for (i = 0; i < N; i++) {
        if (in[i] == 0) QQ.push(i);
    }
    while (!QQ.empty()) {
        int u = QQ.front();
        QQ.pop();

        in[n[u]]--;
        if (in[n[u]] == 0) QQ.push(n[u]);
    }
    for (i = 0; i < N; i++) {
        if (in[i] == 0) adjList[n[i]].pb(i);
    }
    int k;
    for (i = 0; i < N; i++) {
        if (in[i] > 0) {
            vi cycle;
            int u = i;
            while (in[u] > 0) cycle.pb(u),doDFS(u),in[u] = 0,u = n[u];
            LLI sum = 0;
            vlli poss;
            for (j = cycle.size()-1; j >= 0; j--) {
                sum += t[cycle[j]];
                for (auto it = S[cycle[j]].begin(); it != S[cycle[j]].end(); it++)
                    poss.pb(it->first+add[cycle[j]]+sum);
            }
            LLI sum2 = sum;
            for (j = 0; j < cycle.size(); j++) {
                for (auto it = S[cycle[j]].begin(); it != S[cycle[j]].end(); it++)
                    poss.pb(it->first+add[cycle[j]]+sum2-sum);
                sum2 -= t[cycle[j]];
            }
            if (poss.empty()) continue;
            sort(poss.begin(),poss.end());
            poss.resize(unique(poss.begin(),poss.end())-poss.begin());
            vlli poss2;
            for (j = 0; j < poss.size(); j++) poss2.pb((poss[j]+sum) % sum);
            sort(poss2.begin(),poss2.end());
            poss2.resize(unique(poss2.begin(),poss2.end())-poss2.begin());
            sum2 = 0;
            for (j = cycle.size()-1; j >= 0; j--) {
                sum2 += t[cycle[j]];
                for (auto it = S[cycle[j]].begin(); it != S[cycle[j]].end(); it++) {
                    LLI x = it->first+add[cycle[j]]+sum2;
                    int p = lower_bound(poss.begin(),poss.end(),x)-poss.begin();
                    int q = lower_bound(poss2.begin(),poss2.end(),(x+sum) % sum)-poss2.begin();
                    update(poss.size(),p,q,1,(x+sum)/sum-1);
                }
            }
            for (j = 0; j < cycle.size(); j++) {
                for (auto it = S[cycle[j]].begin(); it != S[cycle[j]].end(); it++) {
                    LLI x = it->first+add[cycle[j]]+sum2;
                    int p = lower_bound(poss.begin(),poss.end(),x)-poss.begin();
                    int q = lower_bound(poss2.begin(),poss2.end(),(x+sum) % sum)-poss2.begin();
                    update(poss.size(),p,q,-1,-((x+sum)/sum-1));
                    x -= sum;
                    p = lower_bound(poss.begin(),poss.end(),x)-poss.begin();
                    q = lower_bound(poss2.begin(),poss2.end(),(x+sum) % sum)-poss2.begin();
                    update(poss.size(),p,q,1,(x+sum)/sum-1);
                }
                for (k = 0; k < queries[cycle[j]].size(); k++) {
                    LLI x = queries[cycle[j]][k].first-(sum-sum2);
                    int p = upper_bound(poss.begin(),poss.end(),x)-poss.begin()-1;
                    int q = upper_bound(poss2.begin(),poss2.end(),(x+sum) % sum)-poss2.begin()-1;
                    query(p,queries[cycle[j]][k].second,poss2.size()-1,(x+sum)/sum-1,-1);
                    query(p,queries[cycle[j]][k].second,q,1,0);
                }
                sum2 -= t[cycle[j]];
            }
            for (j = 1; j <= poss.size(); j++) tree1[j].process(),tree2[j].process();
        }
    }
    for (i = 0; i < Q; i++) printf("%lld\n",ans[i]);

    return 0;
}

Compilation message

harvest.cpp: In function 'int doDFS(int)':
harvest.cpp:75:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |     for (i = 0; i < adjList[u].size(); i++) {
      |                 ~~^~~~~~~~~~~~~~~~~~~
harvest.cpp:83:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |         for (i = 0; i < queries[u].size(); i++) ans[queries[u][i].second] = S[u].order_of_key(mp(queries[u][i].first-add[u],1e9));
      |                     ~~^~~~~~~~~~~~~~~~~~~
harvest.cpp: In member function 'int data::process()':
harvest.cpp:100:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  100 |         for (i = 0; i < vv.size(); i++) {
      |                     ~~^~~~~~~~~~~
harvest.cpp:108:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  108 |         for (i = 0; i < vv.size(); i++) {
      |                     ~~^~~~~~~~~~~
harvest.cpp: In function 'int main()':
harvest.cpp:185:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  185 |             for (j = 0; j < cycle.size(); j++) {
      |                         ~~^~~~~~~~~~~~~~
harvest.cpp:194:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  194 |             for (j = 0; j < poss.size(); j++) poss2.pb((poss[j]+sum) % sum);
      |                         ~~^~~~~~~~~~~~~
harvest.cpp:207:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  207 |             for (j = 0; j < cycle.size(); j++) {
      |                         ~~^~~~~~~~~~~~~~
harvest.cpp:218:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  218 |                 for (k = 0; k < queries[cycle[j]].size(); k++) {
      |                             ~~^~~~~~~~~~~~~~~~~~~~~~~~~~
harvest.cpp:227:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  227 |             for (j = 1; j <= poss.size(); j++) tree1[j].process(),tree2[j].process();
      |                         ~~^~~~~~~~~~~~~~
harvest.cpp:136:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  136 |     scanf("%d %d %d %d",&N,&M,&L,&C);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
harvest.cpp:137:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  137 |     for (i = 0; i < N; i++) scanf("%d",&A[i]);
      |                             ~~~~~^~~~~~~~~~~~
harvest.cpp:138:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  138 |     for (i = 0; i < M; i++) scanf("%d",&B[i]);
      |                             ~~~~~^~~~~~~~~~~~
harvest.cpp:139:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  139 |     scanf("%d",&Q);
      |     ~~~~~^~~~~~~~~
harvest.cpp:141:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  141 |         scanf("%d %lld",&V,&T);
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 47812 KB Output is correct
2 Correct 39 ms 47632 KB Output is correct
3 Correct 53 ms 51500 KB Output is correct
4 Correct 50 ms 50244 KB Output is correct
5 Correct 49 ms 50756 KB Output is correct
6 Correct 49 ms 50756 KB Output is correct
7 Correct 51 ms 50700 KB Output is correct
8 Correct 49 ms 49796 KB Output is correct
9 Correct 49 ms 49736 KB Output is correct
10 Correct 49 ms 49848 KB Output is correct
11 Correct 48 ms 49856 KB Output is correct
12 Correct 52 ms 51324 KB Output is correct
13 Correct 52 ms 51396 KB Output is correct
14 Correct 49 ms 49784 KB Output is correct
15 Correct 51 ms 50472 KB Output is correct
16 Correct 52 ms 50508 KB Output is correct
17 Correct 50 ms 50576 KB Output is correct
18 Correct 51 ms 50456 KB Output is correct
19 Correct 49 ms 50504 KB Output is correct
20 Correct 50 ms 50468 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 343 ms 152764 KB Output is correct
2 Correct 265 ms 68528 KB Output is correct
3 Correct 202 ms 58692 KB Output is correct
4 Correct 397 ms 155908 KB Output is correct
5 Correct 260 ms 94720 KB Output is correct
6 Correct 273 ms 101184 KB Output is correct
7 Correct 233 ms 69368 KB Output is correct
8 Correct 234 ms 69432 KB Output is correct
9 Correct 490 ms 161684 KB Output is correct
10 Correct 367 ms 163456 KB Output is correct
11 Correct 542 ms 160628 KB Output is correct
12 Correct 552 ms 162916 KB Output is correct
13 Correct 556 ms 161364 KB Output is correct
14 Correct 406 ms 162436 KB Output is correct
15 Correct 402 ms 114280 KB Output is correct
16 Correct 268 ms 88900 KB Output is correct
17 Correct 267 ms 88552 KB Output is correct
18 Correct 192 ms 67780 KB Output is correct
19 Correct 187 ms 67432 KB Output is correct
20 Correct 234 ms 74884 KB Output is correct

Subtask #3
75.0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 47812 KB Output is correct
2 Correct 39 ms 47632 KB Output is correct
3 Correct 53 ms 51500 KB Output is correct
4 Correct 50 ms 50244 KB Output is correct
5 Correct 49 ms 50756 KB Output is correct
6 Correct 49 ms 50756 KB Output is correct
7 Correct 51 ms 50700 KB Output is correct
8 Correct 49 ms 49796 KB Output is correct
9 Correct 49 ms 49736 KB Output is correct
10 Correct 49 ms 49848 KB Output is correct
11 Correct 48 ms 49856 KB Output is correct
12 Correct 52 ms 51324 KB Output is correct
13 Correct 52 ms 51396 KB Output is correct
14 Correct 49 ms 49784 KB Output is correct
15 Correct 51 ms 50472 KB Output is correct
16 Correct 52 ms 50508 KB Output is correct
17 Correct 50 ms 50576 KB Output is correct
18 Correct 51 ms 50456 KB Output is correct
19 Correct 49 ms 50504 KB Output is correct
20 Correct 50 ms 50468 KB Output is correct
21 Correct 343 ms 152764 KB Output is correct
22 Correct 265 ms 68528 KB Output is correct
23 Correct 202 ms 58692 KB Output is correct
24 Correct 397 ms 155908 KB Output is correct
25 Correct 260 ms 94720 KB Output is correct
26 Correct 273 ms 101184 KB Output is correct
27 Correct 233 ms 69368 KB Output is correct
28 Correct 234 ms 69432 KB Output is correct
29 Correct 490 ms 161684 KB Output is correct
30 Correct 367 ms 163456 KB Output is correct
31 Correct 542 ms 160628 KB Output is correct
32 Correct 552 ms 162916 KB Output is correct
33 Correct 556 ms 161364 KB Output is correct
34 Correct 406 ms 162436 KB Output is correct
35 Correct 402 ms 114280 KB Output is correct
36 Correct 268 ms 88900 KB Output is correct
37 Correct 267 ms 88552 KB Output is correct
38 Correct 192 ms 67780 KB Output is correct
39 Correct 187 ms 67432 KB Output is correct
40 Correct 234 ms 74884 KB Output is correct
41 Correct 1563 ms 300916 KB Output is correct
42 Correct 511 ms 77620 KB Output is correct
43 Correct 407 ms 191472 KB Output is correct
44 Correct 2032 ms 433144 KB Output is correct
45 Correct 1432 ms 348536 KB Output is correct
46 Correct 1430 ms 349420 KB Output is correct
47 Correct 1452 ms 349268 KB Output is correct
48 Correct 1429 ms 323704 KB Output is correct
49 Correct 1435 ms 335192 KB Output is correct
50 Correct 1369 ms 280928 KB Output is correct
51 Correct 1388 ms 283084 KB Output is correct
52 Correct 2185 ms 456828 KB Output is correct
53 Correct 1602 ms 358844 KB Output is correct
54 Correct 2211 ms 461544 KB Output is correct
55 Correct 1894 ms 422284 KB Output is correct
56 Correct 1489 ms 335736 KB Output is correct
57 Correct 1481 ms 336400 KB Output is correct
58 Correct 1541 ms 337740 KB Output is correct
59 Correct 1466 ms 308840 KB Output is correct
60 Correct 1444 ms 310060 KB Output is correct
61 Correct 1425 ms 312312 KB Output is correct
62 Correct 1530 ms 253356 KB Output is correct
63 Correct 1371 ms 311456 KB Output is correct
64 Correct 1371 ms 311732 KB Output is correct
65 Correct 1418 ms 312052 KB Output is correct
66 Correct 1450 ms 281540 KB Output is correct
67 Correct 1416 ms 281768 KB Output is correct
68 Correct 1396 ms 280788 KB Output is correct
69 Correct 1542 ms 291584 KB Output is correct
70 Correct 1515 ms 308000 KB Output is correct
71 Correct 1582 ms 310328 KB Output is correct
72 Correct 1550 ms 311784 KB Output is correct