Submission #1367620


Source Code Expand

#include <cstdio>
#include <set>

#define fin stdin
#define fout stdout

#define ll long long

#define mult std::set <myc>

#define MAXN 100000

struct myc{
    ll x, y;
    myc(ll _x, ll _y){
        x = _x;
        y = _y;
    }
    inline bool operator < (const myc &u) const {
        return x > u.x;
    }
};

mult s;

ll st[MAXN + 2];
ll ans[MAXN + 1];

inline void baga(myc a){
    mult::iterator it = s.lower_bound(a);
    if (it != s.end() && it -> x == a.x) {
        a.y += it -> y;
        s.erase(it);
    }
    s.insert(a);
}

int main(){
    int n, q;
    fscanf(fin, "%d%d", &n, &q);

    int vf = 1;
    st[1] = n;
    for (int i = 0; i < q; i++) {
        ll x;
        fscanf(fin, "%lld", &x);

        while (vf > 0 && st[vf] >= x)
            vf--;

        st[++vf] = x;
    }

    s.insert(myc(st[vf], 1));

    for(int i = vf - 1; i > 0; i--){
        while ((*(s.begin())).x > st[i]) {
            myc a = *(s.begin());
            s.erase(s.begin());

            baga(myc(st[i], a.y * (a.x / st[i])));

            if (a.x % st[i])
                baga(myc(a.x % st[i], a.y));
        }
    }

    for (auto &u : s)
        ans[u.x] += u.y;

    for (int i = n - 1; i > 0; i--)
        ans[i] += ans[i + 1];

    for (int i = 1; i <= n; i++)
        fprintf(fout, "%lld\n", ans[i]);

    return 0;
}

Submission Info

Submission Time
Task E - Sequential operations on Sequence
User alexpetrescu
Language C++14 (GCC 5.4.1)
Score 1400
Code Size 1405 Byte
Status AC
Exec Time 254 ms
Memory 9344 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:40:32: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     fscanf(fin, "%d%d", &n, &q);
                                ^
./Main.cpp:46:32: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         fscanf(fin, "%lld", &x);
                                ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1400 / 1400
Status
AC × 2
AC × 38
Set Name Test Cases
Sample s1.txt, s2.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
01.txt AC 29 ms 2304 KB
02.txt AC 29 ms 2432 KB
03.txt AC 29 ms 2432 KB
04.txt AC 29 ms 2432 KB
05.txt AC 29 ms 2432 KB
06.txt AC 140 ms 7936 KB
07.txt AC 165 ms 8064 KB
08.txt AC 154 ms 8064 KB
09.txt AC 157 ms 8064 KB
10.txt AC 141 ms 8064 KB
11.txt AC 131 ms 8064 KB
12.txt AC 158 ms 7936 KB
13.txt AC 160 ms 8064 KB
14.txt AC 140 ms 8064 KB
15.txt AC 132 ms 7936 KB
16.txt AC 150 ms 7936 KB
17.txt AC 152 ms 8064 KB
18.txt AC 143 ms 8064 KB
19.txt AC 128 ms 8064 KB
20.txt AC 146 ms 8064 KB
21.txt AC 254 ms 8192 KB
22.txt AC 242 ms 9088 KB
23.txt AC 182 ms 9344 KB
24.txt AC 37 ms 3072 KB
25.txt AC 36 ms 2944 KB
26.txt AC 33 ms 2048 KB
27.txt AC 18 ms 1152 KB
28.txt AC 19 ms 1152 KB
29.txt AC 19 ms 1152 KB
30.txt AC 19 ms 1152 KB
31.txt AC 1 ms 256 KB
32.txt AC 9 ms 1152 KB
33.txt AC 1 ms 256 KB
34.txt AC 12 ms 2432 KB
35.txt AC 1 ms 256 KB
36.txt AC 1 ms 256 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB