oj.uz

Submission #134395

# Submission time Handle Problem Language Result Execution time Memory
134395 2019-07-22T15:59:08 Z duality Worst Reporter 3 (JOI18_worst_reporter3) C++11
100 / 100
 500 ms 25464 KB 
#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

int D[500000],p[500001];
struct group { int s,e,p; };
vector<group> groups;
int main() {
    int i;
    int N,Q;
    scanf("%d %d",&N,&Q);
    for (i = 0; i < N; i++) scanf("%d",&D[i]);

    p[0] = 1;
    for (i = 0; i < N; i++) {
        int x = (D[i]+p[i]-1)/p[i];
        p[i+1] = p[i]*x;
        if (p[i+1] > 1.1e9) p[i+1] = 1.1e9;
    }
    for (i = 0; i <= N; i++) {
        if ((i == 0) || (p[i] != p[i-1])) groups.pb((group){-i,-i,p[i]});
        else groups.back().s = -i;
    }

    int j,T,L,R;
    for (i = 0; i < Q; i++) {
        scanf("%d %d %d",&T,&L,&R);
        int ans = 0;
        for (j = 0; j < groups.size(); j++) {
            int x = (T/groups[j].p)*groups[j].p;
            int s = max(groups[j].s+x,L),e = min(groups[j].e+x,R);
            if (s <= e) ans += e-s+1;
        }
        printf("%d\n",ans);
    }

    return 0;
}

Compilation message

worst_reporter3.cpp: In function 'int main()':
worst_reporter3.cpp:82:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < groups.size(); j++) {
                     ~~^~~~~~~~~~~~~~~
worst_reporter3.cpp:64:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&N,&Q);
     ~~~~~^~~~~~~~~~~~~~~
worst_reporter3.cpp:65:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (i = 0; i < N; i++) scanf("%d",&D[i]);
                             ~~~~~^~~~~~~~~~~~
worst_reporter3.cpp:80:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d",&T,&L,&R);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 382 ms 22708 KB Output is correct
2 Correct 389 ms 22880 KB Output is correct
3 Correct 379 ms 22700 KB Output is correct
4 Correct 382 ms 22772 KB Output is correct
5 Correct 381 ms 22788 KB Output is correct
6 Correct 386 ms 22740 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
81.0 / 81.0

# Verdict Execution time Memory Grader output
1 Correct 382 ms 22708 KB Output is correct
2 Correct 389 ms 22880 KB Output is correct
3 Correct 379 ms 22700 KB Output is correct
4 Correct 382 ms 22772 KB Output is correct
5 Correct 381 ms 22788 KB Output is correct
6 Correct 386 ms 22740 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 380 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 395 ms 21136 KB Output is correct
14 Correct 401 ms 21908 KB Output is correct
15 Correct 377 ms 20552 KB Output is correct
16 Correct 396 ms 20984 KB Output is correct
17 Correct 485 ms 25348 KB Output is correct
18 Correct 476 ms 25316 KB Output is correct
19 Correct 487 ms 25464 KB Output is correct
20 Correct 480 ms 25292 KB Output is correct
21 Correct 478 ms 25256 KB Output is correct
22 Correct 478 ms 25464 KB Output is correct
23 Correct 476 ms 25256 KB Output is correct
24 Correct 486 ms 25256 KB Output is correct
25 Correct 387 ms 22748 KB Output is correct
26 Correct 387 ms 22648 KB Output is correct
27 Correct 488 ms 24916 KB Output is correct
28 Correct 500 ms 25272 KB Output is correct
29 Correct 489 ms 24668 KB Output is correct
30 Correct 492 ms 24864 KB Output is correct
31 Correct 497 ms 25280 KB Output is correct
32 Correct 367 ms 21372 KB Output is correct
33 Correct 2 ms 376 KB Output is correct