oj.uz

Submission #467473

# Submission time Handle Problem Language Result Execution time Memory
467473 2021-08-23T05:57:10 Z Carmel_Ab1 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
100 / 100
 1530 ms 82376 KB 
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld, ld> pld;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T>
ostream &operator<<(ostream &os, vector<T> &a) {
    os << "[";
    for (int i = 0; i < ll(a.size()); i++) { os << a[i] << ((i != ll(a.size() - 1) ? " " : "")); }
    os << "]\n";
    return os;
}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map

template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
    is >> p.first >> p.second;
    return is;
}

template<typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> &p) {
    os << "" << p.first << " " << p.second << "";
    return os;
}

void usaco(string taskname) {
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char *FIN = fin.c_str();
    const char *FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
}

template<typename T>
void read(vector<T> &v) {
    int n = v.size();
    for (int i = 0; i < n; i++)
        cin >> v[i];
}

template<typename T>
vector<T> UNQ(vector<T> a) {
    vector<T> ans;
    for (T t:a)
        if (ans.empty() || t != ans.back())
            ans.push_back(t);
    return ans;
}

ll ceil(ll a, ll b) {
    ll ans = a / b;
    if (a % b)ans++;
    return ans;
}

ld log(ld a, ld b) { return log(b) / log(a); }

ll power(ll base, ll exp, ll M = 1e18) {//(base^exp)%M
    ll ans = 1;
    while (exp) {
        if (exp % 2 == 1)ans = ((ans % M) * (base % M)) % M;
        base = ((base % M) * (base % M)) % M;
        exp /= 2;
    }
    return ans;
}

string to_base(int n, int new_base) {
    string s;
    int nn = n;
    while (nn) {
        s += to_string(nn % new_base);
        nn /= new_base;
    }
    reverse(all(s));
    return s;
}

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    ll x = (a / gcd(a, b));
    return b * x;
}

vl generate_array(ll n, ll mn = 1, ll mx = 1e18 + 1) {
    if (mx == 1e18 + 1)
        mx = n;
    vl ans(n);
    for (int i = 0; i < n; i++)
        ans[i] = (mn + rand() % (mx - mn + 1));
    return ans;
}

string substr(string s, int l, int r) {
    string ans;
    for (int i = l; i <= r; i++)
        ans += s[i];
    return ans;
}


void solve();

int main() {
    GLHF;
    int t = 1;
    //cin >> t;
    while (t--)
        solve();
}
int sz=1;
int t[(1<<21)];
void update(int i,int v){
    i+=sz/2;
    t[i]=max(t[i],v);
    while(i){
        t[i/2]=max(t[i],t[i^1]);
        i/=2;
    }
}
int query(int l,int r){
    int ans=0;
    for(l+=sz/2,r+=sz/2 +1; l<r; l/=2,r/=2){
        if(l&1)ans=max(ans,t[l++]);
        if(r&1)ans=max(ans,t[--r]);
    }
    return ans;
}


void solve() {
    int n,q;
    cin >> n>> q;
    int a[n];
    for(int i=0; i<n; i++)
        cin >> a[i];
    while(sz<=2*n)
        sz*=2;

    for(int i=0; i<sz; i++)
        t[i]=0;
    vi qs[q];
    for(int i=0; i<q; i++)
        qs[i].resize(4);
    for(int i=0; i<q; i++){
        cin >> qs[i][0] >> qs[i][1]  >> qs[i][2];
        qs[i][0]--,qs[i][1]--;
        qs[i][3]=i;
    }
    for(int i=0; i<q; i++)
        swap(qs[i][0],qs[i][1]);
    sort(qs,qs+q);
    for(int i=0; i<q; i++)
        swap(qs[i][0],qs[i][1]);

    int ans[q];
    for(int i=0; i<q; i++)
        ans[i]=0;
    int prv[n];
    for(int i=0; i<n; i++)
        prv[i]=-1;

    stack<int>s;
    for(int i=n-1; 0<=i; i--){
        while(s.size() && a[s.top()]<a[i]){
            prv[s.top()]=i;
            s.pop();
        }
        s.push(i);
    }
    for(int i=0,j=0; j<q && i<n; i++){
        int cur=prv[i];
        bool ok=1;
        while(cur!=-1 && ok){
            if(a[cur]>a[i])
                update(cur,a[cur]+a[i]);
            cur=prv[cur];
            ok=0;
        }
        while(i<n && j<q && qs[j][1]==i){
            if(query(qs[j][0],qs[j][1])<=qs[j][2])
                ans[qs[j][3]]=1;
            j++;
        }
    }
    for(int i=0; i<q ;i++)
        cout << ans[i] << " ";
}

Compilation message

sortbooks.cpp: In function 'void usaco(std::string)':
sortbooks.cpp:56:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
sortbooks.cpp:57:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |     freopen(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 3 ms 460 KB Output is correct
13 Correct 3 ms 588 KB Output is correct
14 Correct 5 ms 716 KB Output is correct
15 Correct 5 ms 716 KB Output is correct
16 Correct 4 ms 716 KB Output is correct
17 Correct 4 ms 716 KB Output is correct
18 Correct 4 ms 716 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1465 ms 77152 KB Output is correct
2 Correct 1530 ms 78076 KB Output is correct
3 Correct 1477 ms 78044 KB Output is correct
4 Correct 1480 ms 78180 KB Output is correct
5 Correct 1434 ms 82120 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 8096 KB Output is correct
2 Correct 96 ms 8116 KB Output is correct
3 Correct 93 ms 8472 KB Output is correct
4 Correct 97 ms 8516 KB Output is correct
5 Correct 93 ms 8492 KB Output is correct
6 Correct 87 ms 8464 KB Output is correct
7 Correct 87 ms 8504 KB Output is correct
8 Correct 88 ms 8260 KB Output is correct
9 Correct 69 ms 6312 KB Output is correct
10 Correct 87 ms 8388 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 3 ms 460 KB Output is correct
13 Correct 3 ms 588 KB Output is correct
14 Correct 5 ms 716 KB Output is correct
15 Correct 5 ms 716 KB Output is correct
16 Correct 4 ms 716 KB Output is correct
17 Correct 4 ms 716 KB Output is correct
18 Correct 4 ms 716 KB Output is correct
19 Correct 233 ms 15984 KB Output is correct
20 Correct 239 ms 16140 KB Output is correct
21 Correct 248 ms 15936 KB Output is correct
22 Correct 234 ms 16012 KB Output is correct
23 Correct 239 ms 16040 KB Output is correct
24 Correct 218 ms 16836 KB Output is correct
25 Correct 230 ms 16884 KB Output is correct
26 Correct 229 ms 16876 KB Output is correct
27 Correct 229 ms 16828 KB Output is correct
28 Correct 229 ms 16784 KB Output is correct
29 Correct 229 ms 16872 KB Output is correct
30 Correct 244 ms 16836 KB Output is correct
31 Correct 229 ms 16836 KB Output is correct
32 Correct 255 ms 16836 KB Output is correct
33 Correct 231 ms 16776 KB Output is correct
34 Correct 237 ms 16836 KB Output is correct
35 Correct 212 ms 16784 KB Output is correct
36 Correct 222 ms 16780 KB Output is correct
37 Correct 214 ms 16836 KB Output is correct
38 Correct 219 ms 16836 KB Output is correct
39 Correct 221 ms 16584 KB Output is correct
40 Correct 180 ms 15812 KB Output is correct
41 Correct 213 ms 16464 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 3 ms 460 KB Output is correct
13 Correct 3 ms 588 KB Output is correct
14 Correct 5 ms 716 KB Output is correct
15 Correct 5 ms 716 KB Output is correct
16 Correct 4 ms 716 KB Output is correct
17 Correct 4 ms 716 KB Output is correct
18 Correct 4 ms 716 KB Output is correct
19 Correct 1465 ms 77152 KB Output is correct
20 Correct 1530 ms 78076 KB Output is correct
21 Correct 1477 ms 78044 KB Output is correct
22 Correct 1480 ms 78180 KB Output is correct
23 Correct 1434 ms 82120 KB Output is correct
24 Correct 99 ms 8096 KB Output is correct
25 Correct 96 ms 8116 KB Output is correct
26 Correct 93 ms 8472 KB Output is correct
27 Correct 97 ms 8516 KB Output is correct
28 Correct 93 ms 8492 KB Output is correct
29 Correct 87 ms 8464 KB Output is correct
30 Correct 87 ms 8504 KB Output is correct
31 Correct 88 ms 8260 KB Output is correct
32 Correct 69 ms 6312 KB Output is correct
33 Correct 87 ms 8388 KB Output is correct
34 Correct 233 ms 15984 KB Output is correct
35 Correct 239 ms 16140 KB Output is correct
36 Correct 248 ms 15936 KB Output is correct
37 Correct 234 ms 16012 KB Output is correct
38 Correct 239 ms 16040 KB Output is correct
39 Correct 218 ms 16836 KB Output is correct
40 Correct 230 ms 16884 KB Output is correct
41 Correct 229 ms 16876 KB Output is correct
42 Correct 229 ms 16828 KB Output is correct
43 Correct 229 ms 16784 KB Output is correct
44 Correct 229 ms 16872 KB Output is correct
45 Correct 244 ms 16836 KB Output is correct
46 Correct 229 ms 16836 KB Output is correct
47 Correct 255 ms 16836 KB Output is correct
48 Correct 231 ms 16776 KB Output is correct
49 Correct 237 ms 16836 KB Output is correct
50 Correct 212 ms 16784 KB Output is correct
51 Correct 222 ms 16780 KB Output is correct
52 Correct 214 ms 16836 KB Output is correct
53 Correct 219 ms 16836 KB Output is correct
54 Correct 221 ms 16584 KB Output is correct
55 Correct 180 ms 15812 KB Output is correct
56 Correct 213 ms 16464 KB Output is correct
57 Correct 1502 ms 78460 KB Output is correct
58 Correct 1462 ms 78284 KB Output is correct
59 Correct 1478 ms 78240 KB Output is correct
60 Correct 1463 ms 78276 KB Output is correct
61 Correct 1526 ms 78276 KB Output is correct
62 Correct 1492 ms 78212 KB Output is correct
63 Correct 1374 ms 82152 KB Output is correct
64 Correct 1358 ms 81912 KB Output is correct
65 Correct 1410 ms 82288 KB Output is correct
66 Correct 1523 ms 82320 KB Output is correct
67 Correct 1446 ms 82256 KB Output is correct
68 Correct 1464 ms 82248 KB Output is correct
69 Correct 1428 ms 82344 KB Output is correct
70 Correct 1444 ms 82300 KB Output is correct
71 Correct 1479 ms 82284 KB Output is correct
72 Correct 1449 ms 82376 KB Output is correct
73 Correct 1328 ms 81908 KB Output is correct
74 Correct 1346 ms 81860 KB Output is correct
75 Correct 1309 ms 81808 KB Output is correct
76 Correct 1335 ms 81792 KB Output is correct
77 Correct 1310 ms 81876 KB Output is correct
78 Correct 1391 ms 80456 KB Output is correct
79 Correct 1042 ms 75720 KB Output is correct
80 Correct 1277 ms 79876 KB Output is correct