oj.uz

답안 #797906

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
797906 2023-07-30T06:08:39 Z vjudge1 Worst Reporter 3 (JOI18_worst_reporter3) C++17
7 / 100
 445 ms 11276 KB 

#include <bits/stdc++.h>



using namespace std;

#define TL ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define rall(s) s.rbegin(),s.rend()
#define all(s) s.begin(),s.end()
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ld long double
#define YES cout<<"YES\n"
#define Yes cout<<"Yes\n"
#define yes cout<<"yes\n"
#define NO cout<<"NO\n"
#define No cout<<"No\n"
#define no cout<<"no\n"


const int N = 5e5 + 9 , mod = 1e9 + 7;
ll  d[N] = {} , a[N] = {}, dp[N] = {}, b[N] , c[N];

void solve(){
    ll q , i , j , m ,n, z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = -1;
    cin>>n>>q;
    for(i = 1; i <= n; i++)
        cin>>a[i];
    c[0] = 1 , c[1] = a[1] ;
    for(i = 2; i <= n; i++)
        if(a[i] <= a[i - 1])
            c[i] = c[i - 1];
        else
            c[i] = ((a[i] + 1) / c[i - 1] + (((a[i] + 1) % c[i - 1]) != 0)) * c[i - 1];
    while(q--){
        cin>>k>>x>>y;
        l = 0;
        r = n;
        while(l != r){
            m = (l + r + 1) / 2;
            if((k / c[m]) * c[m] + (-m) >= x) l =  m;
            else r = m - 1;
        }
        f = l;
        l = 0, r= n;
        while(l != r){
            m = (l + r) / 2;
            if((k / c[m])* c[m] + (-m) <= y) r = m;
            else l = m + 1;
        }
        k = (((k / c[f]) * c[f] + -(f) >= x) && ((k / c[l]) * c[l] + (-l) <=y));
        if(k == 1)
            cout<<max(0ll ,f - l + 1)<<"\n";
        else
            cout<<0<<"\n";
    }
}

int main(){

     TL;
     /*
     #ifndef ONLINE_JUDGE
     freopen("input.txt", "r", stdin);
     freopen("output.txt", "w", stdout);
     #endif
     */
int t = 1;
//cin>>t;

while(t--)
     {
     solve();
     }

}
// Author : حسن

Compilation message

worst_reporter3.cpp: In function 'void solve()':
worst_reporter3.cpp:29:16: warning: unused variable 'j' [-Wunused-variable]
   29 |     ll q , i , j , m ,n, z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = -1;
      |                ^
worst_reporter3.cpp:29:26: warning: unused variable 'z' [-Wunused-variable]
   29 |     ll q , i , j , m ,n, z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = -1;
      |                          ^
worst_reporter3.cpp:29:30: warning: unused variable 's' [-Wunused-variable]
   29 |     ll q , i , j , m ,n, z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = -1;
      |                              ^
worst_reporter3.cpp:29:61: warning: unused variable 'mn' [-Wunused-variable]
   29 |     ll q , i , j , m ,n, z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = -1;
      |                                                             ^~
worst_reporter3.cpp:29:74: warning: unused variable 'mx' [-Wunused-variable]
   29 |     ll q , i , j , m ,n, z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = -1;
      |                                                                          ^~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 443 ms 11168 KB Output is correct
2 Correct 445 ms 11176 KB Output is correct
3 Correct 443 ms 11136 KB Output is correct
4 Correct 445 ms 11196 KB Output is correct
5 Correct 443 ms 11276 KB Output is correct
6 Correct 437 ms 11084 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 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 340 KB Output is correct
5 Incorrect 1 ms 340 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 81.0

# 결과 실행 시간 메모리 Grader output
1 Correct 443 ms 11168 KB Output is correct
2 Correct 445 ms 11176 KB Output is correct
3 Correct 443 ms 11136 KB Output is correct
4 Correct 445 ms 11196 KB Output is correct
5 Correct 443 ms 11276 KB Output is correct
6 Correct 437 ms 11084 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 340 KB Output is correct
11 Incorrect 1 ms 340 KB Output isn't correct
12 Halted 0 ms 0 KB -