oj.uz

Submission #772132

# Submission time Handle Problem Language Result Execution time Memory
772132 2023-07-03T16:50:40 Z bachhoangxuan Worst Reporter 3 (JOI18_worst_reporter3) C++17
100 / 100
 265 ms 25288 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<pii,int>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=1e9+7;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=1e9;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

void solve(){
    int n,q;cin >> n >> q;
    vector<int> d(n+1);
    for(int i=1;i<=n;i++) cin >> d[i];
    int cur=d[1],l=1,r=0;
    vector<tuple<int,int,int>> p;
    while(l<=n){
        while(r+1<=n && d[r+1]<=cur) r++;
        p.push_back({cur,l,r});l=r+1;
        if(l==n+1) break;
        cur*=((d[l]-1)/cur+1);
    }
    for(int i=1;i<=q;i++){
        int t,ans=0;cin >> t >> l >> r;
        ans+=(l<=t && t<=r);
        for(auto &[x,lt,rt]:p){
            int add=(t/x)*x;
            ans+=max(0LL,min(r,-lt+add)-max(l,-rt+add)+1);
            cur*=2;
        }
        cout << ans << '\n';
    }
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 167 ms 22604 KB Output is correct
2 Correct 181 ms 22656 KB Output is correct
3 Correct 169 ms 22576 KB Output is correct
4 Correct 181 ms 22672 KB Output is correct
5 Correct 177 ms 22732 KB Output is correct
6 Correct 169 ms 22656 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #3
81.0 / 81.0

# Verdict Execution time Memory Grader output
1 Correct 167 ms 22604 KB Output is correct
2 Correct 181 ms 22656 KB Output is correct
3 Correct 169 ms 22576 KB Output is correct
4 Correct 181 ms 22672 KB Output is correct
5 Correct 177 ms 22732 KB Output is correct
6 Correct 169 ms 22656 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 178 ms 21160 KB Output is correct
14 Correct 174 ms 21768 KB Output is correct
15 Correct 166 ms 20400 KB Output is correct
16 Correct 170 ms 20932 KB Output is correct
17 Correct 244 ms 25208 KB Output is correct
18 Correct 241 ms 25176 KB Output is correct
19 Correct 253 ms 25196 KB Output is correct
20 Correct 262 ms 25224 KB Output is correct
21 Correct 239 ms 25224 KB Output is correct
22 Correct 237 ms 25276 KB Output is correct
23 Correct 249 ms 25088 KB Output is correct
24 Correct 241 ms 25288 KB Output is correct
25 Correct 179 ms 22612 KB Output is correct
26 Correct 176 ms 22668 KB Output is correct
27 Correct 255 ms 24780 KB Output is correct
28 Correct 260 ms 25076 KB Output is correct
29 Correct 265 ms 24624 KB Output is correct
30 Correct 258 ms 24724 KB Output is correct
31 Correct 255 ms 24984 KB Output is correct
32 Correct 175 ms 21240 KB Output is correct
33 Correct 0 ms 212 KB Output is correct