oj.uz

Submission #470688

# Submission time Handle Problem Language Result Execution time Memory
470688 2021-09-05T04:46:35 Z NhatMinh0208 Worst Reporter 3 (JOI18_worst_reporter3) C++14
100 / 100
 611 ms 23376 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
vector<int> vec;
int n,m,i,j,k,t,t1,u,v,a,b,l,r,mid;
int d[500001];
int qt;
int ql;
int qr;
int main()
{
	fio;
    cin>>n>>m;
    d[0]=1;
    for (i=1;i<=n;i++) {
        cin>>d[i];
        if (d[i]%d[i-1]) {
            d[i]+=d[i-1]-d[i]%d[i-1];
        }
    }
    for (i=1;i<=m;i++) {
        cin>>qt>>ql>>qr;
        v=0;
        u=ql;
        l=0;
        r=n+1;
        while (l<r) {
            mid=(l+r)/2+1;
            a=qt/d[mid-1]*d[mid-1]-(mid-1);
            if (a>=u) l=mid; else r=mid-1;
        }
        v+=l;
        u=qr+1;
        l=0;
        r=n+1;
        while (l<r) {
            mid=(l+r)/2+1;
            a=qt/d[mid-1]*d[mid-1]-(mid-1);
            if (a>=u) l=mid; else r=mid-1;
        }
        v-=l;
        cout<<v<<endl;
    }
}
// Normie28;

Compilation message

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

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 611 ms 20676 KB Output is correct
2 Correct 595 ms 20644 KB Output is correct
3 Correct 611 ms 20604 KB Output is correct
4 Correct 611 ms 20800 KB Output is correct
5 Correct 609 ms 20708 KB Output is correct
6 Correct 600 ms 20600 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 332 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 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct

Subtask #3
81.0 / 81.0

# Verdict Execution time Memory Grader output
1 Correct 611 ms 20676 KB Output is correct
2 Correct 595 ms 20644 KB Output is correct
3 Correct 611 ms 20604 KB Output is correct
4 Correct 611 ms 20800 KB Output is correct
5 Correct 609 ms 20708 KB Output is correct
6 Correct 600 ms 20600 KB Output is correct
7 Correct 1 ms 344 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 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 391 ms 19240 KB Output is correct
14 Correct 393 ms 19780 KB Output is correct
15 Correct 387 ms 18392 KB Output is correct
16 Correct 395 ms 19012 KB Output is correct
17 Correct 475 ms 23284 KB Output is correct
18 Correct 467 ms 23148 KB Output is correct
19 Correct 486 ms 23360 KB Output is correct
20 Correct 490 ms 23140 KB Output is correct
21 Correct 476 ms 23376 KB Output is correct
22 Correct 468 ms 23200 KB Output is correct
23 Correct 479 ms 23208 KB Output is correct
24 Correct 472 ms 23372 KB Output is correct
25 Correct 606 ms 21008 KB Output is correct
26 Correct 601 ms 20732 KB Output is correct
27 Correct 534 ms 22768 KB Output is correct
28 Correct 515 ms 23152 KB Output is correct
29 Correct 510 ms 22656 KB Output is correct
30 Correct 523 ms 22732 KB Output is correct
31 Correct 518 ms 22984 KB Output is correct
32 Correct 508 ms 19376 KB Output is correct
33 Correct 1 ms 204 KB Output is correct