oj.uz

Submission #231045

# Submission time Handle Problem Language Result Execution time Memory
231045 2020-05-12T12:37:47 Z JooDdae 역사적 조사 (JOI14_historical) C++17
25 / 100
 4000 ms 14456 KB 
#include<bits/stdc++.h>
using namespace std;
using ll = long long;


const ll sz = 100000000;

char in_buf[sz];
char out_buf[sz];

inline char read_next()
{
    static ll i = sz;
    if (i == sz)
    {
        fread(in_buf, 1, sz, stdin);
        i = 0;
    }
    return in_buf[i++];
}

inline ll read_int()
{
    ll r = read_next() - '0';
    char ch;
    while ((ch = read_next()) >= '0' && ch <= '9')
        r = r * 10 + ch - '0';
    return r;
}

ll w_idx;
inline void write_next(char ch)
{
    if (w_idx == sz)
    {
        fwrite(out_buf, 1, sz, stdout);
        w_idx = 0;
    }
    out_buf[w_idx++] = ch;
}

inline void write_int(ll x)
{
    char s[10];
    ll i = 0;

    do {
        s[i++] = x % 10;
        x /= 10;
    } while (x > 0);

    i--;
    while (i >= 0)
        write_next(s[i--] + '0');
}

#define mid ((l+r)>>1)
struct query{
    int l, r, id;
    bool operator < (const query &o) const{
        return make_pair(l>>9, r) < make_pair(o.l >> 9, o.r);
    }
}q[100100];
int n, m, cnt;
ll x[100100], tree[400400], ans[100100];
map<ll, int> mp;

void update(int id, ll val, int node = 1, int l = 1, int r = cnt){
    if(id < l || r < id) return;
    if(l == r){
        tree[node] += val;
        return;
    }
    update(id, val, node*2, l, mid), update(id, val, node*2+1, mid+1, r);
    tree[node] = max(tree[node*2], tree[node*2+1]);
}

int main(){
    n = read_int();
    m = read_int();
    for(int i=1;i<=n;i++) x[i] = read_int(), mp[x[i]] = 0;
    for(auto &x : mp) x.second = ++cnt;

    for(int i=1;i<=m;i++) q[i].l = read_int(), q[i].r = read_int(), q[i].id = i;
    sort(q+1, q+1+m);
    
    int l = 1, r = 0;
    for(int i=1;i<=m;i++){
        while(l > q[i].l) l--, update(mp[x[l]], x[l]);
        while(r < q[i].r) r++, update(mp[x[r]], x[r]);
        while(l < q[i].l) update(mp[x[l]], -x[l]), l++;
        while(r > q[i].r) update(mp[x[r]], -x[r]), r--;

        ans[q[i].id] = tree[1];
    }
    for(int i=1;i<=m;i++){write_int(ans[i]); write_next('\n');}
    fwrite(out_buf, 1, w_idx, stdout);
}

Compilation message

historic.cpp: In function 'char read_next()':
historic.cpp:16:14: warning: ignoring return value of 'size_t fread(void*, size_t, size_t, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         fread(in_buf, 1, sz, stdin);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Runtime error 13 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
6 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 8 ms 384 KB Output is correct
3 Correct 17 ms 384 KB Output is correct
4 Runtime error 42 ms 812 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 9 ms 640 KB Output is correct
8 Correct 12 ms 884 KB Output is correct
9 Correct 26 ms 1408 KB Output is correct
10 Correct 7 ms 1024 KB Output is correct
11 Correct 35 ms 5624 KB Output is correct
12 Correct 41 ms 1920 KB Output is correct
13 Correct 79 ms 3576 KB Output is correct
14 Correct 135 ms 8168 KB Output is correct
15 Correct 149 ms 11772 KB Output is correct
16 Correct 163 ms 13016 KB Output is correct
17 Correct 27 ms 2680 KB Output is correct
18 Correct 37 ms 5624 KB Output is correct
19 Correct 91 ms 14456 KB Output is correct
20 Correct 63 ms 11256 KB Output is correct

Subtask #4
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 186 ms 1016 KB Output is correct
2 Correct 657 ms 1604 KB Output is correct
3 Correct 1616 ms 2812 KB Output is correct
4 Correct 2855 ms 3896 KB Output is correct
5 Execution timed out 4008 ms 4876 KB Time limit exceeded
6 Halted 0 ms 0 KB -