oj.uz

답안 #465561

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
465561 2021-08-16T10:57:36 Z NhatMinh0208 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
100 / 100
 1618 ms 104376 KB 
#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif

int sta[200001];

// A list of preset merge functions.
int cmpg(int a, int b){if (a>b) return a; else return b;}
//The segement tree itself.
struct seg2
{
    int val[4000001];
    int def=0;
    int (*merg)(int,int); // Merge function. It must be associative.
    void reset(int c, int l, int r)
    {
        if (l<r)
        {
            int mid=(l+r)/2;
            reset((c<<1),l,mid);
            reset((c<<1)+1,mid+1,r);
            val[c]=def;
        }
        else val[c]=def;
    }
    void upd(int c, int l, int r, int x, int tl, int tr)
    {


        if ((tl>r)or(tr<l)) return ;
        if ((tl<=l)and(tr>=r)) val[c]=max(val[c],x);
        else 
        {
            int mid=(l+r)/2;
            upd((c<<1),l,mid,x,tl,tr);
            upd((c<<1)+1,mid+1,r,x,tl,tr);
        }



    }
    int get(int c, int l, int r, int t)
    {
        if ((l<=t)and(t<=r))
        {
            if (l==r) return val[c];
            else
            {
                int mid=(l+r)/2;
                int a=get((c<<1),l,mid,t);
                int b=get((c<<1)+1,mid+1,r,t);
                return max(val[c],max(a,b));
            }
        }
        else return def;
    }
};

seg2 st;

vector<int> vec,buc[1000001];
int n,m,i,j,k,t,t1,u,v,a,b;
int arr[1000001];
int ql[1000001];
int qr[1000001];
int qk[1000001];
int qx[1000001];
int main()
{
	fio;
    cin>>n;
    cin>>m;
    for (i=1;i<=n;i++)
    {
        cin>>arr[i];
    }
    st.reset(1,1,n);
    for (i=1;i<=m;i++)
    {
        cin>>ql[i]>>qr[i]>>qk[i];
        buc[qr[i]].push_back(i);
    }
    for (i=1;i<=n;i++)
    {
        while ((vec.size())and(arr[vec.back()]<=arr[i]))
        {
            vec.pop_back();
        }
        // for (auto g : vec) cout<<g<<' ';
        // cout<<endl;
        if (vec.size())
        {
            // cout<<vec.back()<<' '<<i<<endl;
            st.upd(1,1,n,arr[vec.back()]+arr[i],1,vec.back());
        }
        vec.push_back(i);
        for (auto g : buc[i])
        {
            u=st.get(1,1,n,ql[g]);
            // cout<<u<<endl;
            if (u<=qk[g]) qx[g]=1;
        }
    }
    for (i=1;i<=m;i++)
    {
        cout<<qx[i]<<endl;
    }
}
// Normie28;

Compilation message

sortbooks.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 23812 KB Output is correct
2 Correct 14 ms 23756 KB Output is correct
3 Correct 15 ms 23756 KB Output is correct
4 Correct 16 ms 23748 KB Output is correct
5 Correct 14 ms 23756 KB Output is correct
6 Correct 18 ms 23828 KB Output is correct
7 Correct 14 ms 23828 KB Output is correct
8 Correct 14 ms 23756 KB Output is correct
9 Correct 14 ms 23820 KB Output is correct
10 Correct 14 ms 23764 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 23812 KB Output is correct
2 Correct 14 ms 23756 KB Output is correct
3 Correct 15 ms 23756 KB Output is correct
4 Correct 16 ms 23748 KB Output is correct
5 Correct 14 ms 23756 KB Output is correct
6 Correct 18 ms 23828 KB Output is correct
7 Correct 14 ms 23828 KB Output is correct
8 Correct 14 ms 23756 KB Output is correct
9 Correct 14 ms 23820 KB Output is correct
10 Correct 14 ms 23764 KB Output is correct
11 Correct 16 ms 24012 KB Output is correct
12 Correct 17 ms 24132 KB Output is correct
13 Correct 17 ms 24096 KB Output is correct
14 Correct 18 ms 24196 KB Output is correct
15 Correct 18 ms 24200 KB Output is correct
16 Correct 19 ms 24084 KB Output is correct
17 Correct 18 ms 24140 KB Output is correct
18 Correct 16 ms 24080 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1555 ms 67696 KB Output is correct
2 Correct 1584 ms 100472 KB Output is correct
3 Correct 1612 ms 100444 KB Output is correct
4 Correct 1514 ms 100616 KB Output is correct
5 Correct 1391 ms 104376 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 113 ms 29936 KB Output is correct
2 Correct 110 ms 29748 KB Output is correct
3 Correct 93 ms 30284 KB Output is correct
4 Correct 93 ms 30532 KB Output is correct
5 Correct 99 ms 30540 KB Output is correct
6 Correct 79 ms 29012 KB Output is correct
7 Correct 79 ms 28996 KB Output is correct
8 Correct 99 ms 30128 KB Output is correct
9 Correct 59 ms 27328 KB Output is correct
10 Correct 92 ms 30152 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 23812 KB Output is correct
2 Correct 14 ms 23756 KB Output is correct
3 Correct 15 ms 23756 KB Output is correct
4 Correct 16 ms 23748 KB Output is correct
5 Correct 14 ms 23756 KB Output is correct
6 Correct 18 ms 23828 KB Output is correct
7 Correct 14 ms 23828 KB Output is correct
8 Correct 14 ms 23756 KB Output is correct
9 Correct 14 ms 23820 KB Output is correct
10 Correct 14 ms 23764 KB Output is correct
11 Correct 16 ms 24012 KB Output is correct
12 Correct 17 ms 24132 KB Output is correct
13 Correct 17 ms 24096 KB Output is correct
14 Correct 18 ms 24196 KB Output is correct
15 Correct 18 ms 24200 KB Output is correct
16 Correct 19 ms 24084 KB Output is correct
17 Correct 18 ms 24140 KB Output is correct
18 Correct 16 ms 24080 KB Output is correct
19 Correct 244 ms 39956 KB Output is correct
20 Correct 254 ms 40032 KB Output is correct
21 Correct 220 ms 38168 KB Output is correct
22 Correct 209 ms 38116 KB Output is correct
23 Correct 204 ms 38052 KB Output is correct
24 Correct 170 ms 37812 KB Output is correct
25 Correct 169 ms 37836 KB Output is correct
26 Correct 212 ms 38708 KB Output is correct
27 Correct 197 ms 38736 KB Output is correct
28 Correct 217 ms 39044 KB Output is correct
29 Correct 218 ms 40016 KB Output is correct
30 Correct 228 ms 40064 KB Output is correct
31 Correct 207 ms 39872 KB Output is correct
32 Correct 226 ms 39876 KB Output is correct
33 Correct 225 ms 40036 KB Output is correct
34 Correct 169 ms 37572 KB Output is correct
35 Correct 168 ms 37496 KB Output is correct
36 Correct 159 ms 37276 KB Output is correct
37 Correct 165 ms 37312 KB Output is correct
38 Correct 169 ms 37572 KB Output is correct
39 Correct 206 ms 38228 KB Output is correct
40 Correct 181 ms 35976 KB Output is correct
41 Correct 205 ms 37940 KB Output is correct

Subtask #6
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 23812 KB Output is correct
2 Correct 14 ms 23756 KB Output is correct
3 Correct 15 ms 23756 KB Output is correct
4 Correct 16 ms 23748 KB Output is correct
5 Correct 14 ms 23756 KB Output is correct
6 Correct 18 ms 23828 KB Output is correct
7 Correct 14 ms 23828 KB Output is correct
8 Correct 14 ms 23756 KB Output is correct
9 Correct 14 ms 23820 KB Output is correct
10 Correct 14 ms 23764 KB Output is correct
11 Correct 16 ms 24012 KB Output is correct
12 Correct 17 ms 24132 KB Output is correct
13 Correct 17 ms 24096 KB Output is correct
14 Correct 18 ms 24196 KB Output is correct
15 Correct 18 ms 24200 KB Output is correct
16 Correct 19 ms 24084 KB Output is correct
17 Correct 18 ms 24140 KB Output is correct
18 Correct 16 ms 24080 KB Output is correct
19 Correct 1555 ms 67696 KB Output is correct
20 Correct 1584 ms 100472 KB Output is correct
21 Correct 1612 ms 100444 KB Output is correct
22 Correct 1514 ms 100616 KB Output is correct
23 Correct 1391 ms 104376 KB Output is correct
24 Correct 113 ms 29936 KB Output is correct
25 Correct 110 ms 29748 KB Output is correct
26 Correct 93 ms 30284 KB Output is correct
27 Correct 93 ms 30532 KB Output is correct
28 Correct 99 ms 30540 KB Output is correct
29 Correct 79 ms 29012 KB Output is correct
30 Correct 79 ms 28996 KB Output is correct
31 Correct 99 ms 30128 KB Output is correct
32 Correct 59 ms 27328 KB Output is correct
33 Correct 92 ms 30152 KB Output is correct
34 Correct 244 ms 39956 KB Output is correct
35 Correct 254 ms 40032 KB Output is correct
36 Correct 220 ms 38168 KB Output is correct
37 Correct 209 ms 38116 KB Output is correct
38 Correct 204 ms 38052 KB Output is correct
39 Correct 170 ms 37812 KB Output is correct
40 Correct 169 ms 37836 KB Output is correct
41 Correct 212 ms 38708 KB Output is correct
42 Correct 197 ms 38736 KB Output is correct
43 Correct 217 ms 39044 KB Output is correct
44 Correct 218 ms 40016 KB Output is correct
45 Correct 228 ms 40064 KB Output is correct
46 Correct 207 ms 39872 KB Output is correct
47 Correct 226 ms 39876 KB Output is correct
48 Correct 225 ms 40036 KB Output is correct
49 Correct 169 ms 37572 KB Output is correct
50 Correct 168 ms 37496 KB Output is correct
51 Correct 159 ms 37276 KB Output is correct
52 Correct 165 ms 37312 KB Output is correct
53 Correct 169 ms 37572 KB Output is correct
54 Correct 206 ms 38228 KB Output is correct
55 Correct 181 ms 35976 KB Output is correct
56 Correct 205 ms 37940 KB Output is correct
57 Correct 1618 ms 103424 KB Output is correct
58 Correct 1525 ms 103316 KB Output is correct
59 Correct 1424 ms 99104 KB Output is correct
60 Correct 1413 ms 99124 KB Output is correct
61 Correct 1457 ms 99180 KB Output is correct
62 Correct 1427 ms 99204 KB Output is correct
63 Correct 870 ms 91568 KB Output is correct
64 Correct 892 ms 91580 KB Output is correct
65 Correct 1210 ms 98600 KB Output is correct
66 Correct 1297 ms 98564 KB Output is correct
67 Correct 1442 ms 98972 KB Output is correct
68 Correct 1381 ms 103428 KB Output is correct
69 Correct 1336 ms 103292 KB Output is correct
70 Correct 1309 ms 102592 KB Output is correct
71 Correct 1383 ms 102568 KB Output is correct
72 Correct 1378 ms 102564 KB Output is correct
73 Correct 855 ms 89408 KB Output is correct
74 Correct 877 ms 90324 KB Output is correct
75 Correct 853 ms 89396 KB Output is correct
76 Correct 918 ms 89528 KB Output is correct
77 Correct 858 ms 89428 KB Output is correct
78 Correct 1221 ms 95408 KB Output is correct
79 Correct 891 ms 82232 KB Output is correct
80 Correct 1195 ms 93144 KB Output is correct