oj.uz

Submission #59338

# Submission time Handle Problem Language Result Execution time Memory
59338 2018-07-21T15:00:08 Z Benq Relativnost (COCI15_relativnost) C++14
84 / 140
 1445 ms 33792 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 10007;
const ll INF = 1e18;
const int MX = 100001;

int N,C;

template<int SZ> struct Seg {
    int tot[2*SZ];
    array<int,20> num[2*SZ];
    
    Seg() {
        FOR(i,SZ,2*SZ) {
            tot[i] = 1;
            num[i][0] = 1;
        }
    }
    
    void comb(array<int,20>& a, array<int,20>& b, array<int,20>& c) {
        F0R(i,20) a[i] = 0;
        F0R(i,20) F0R(j,20-i) a[i+j] = (a[i+j]+b[i]*c[j])%MOD;
    }
    
    void pull(int x) {
        tot[x] = tot[2*x]*tot[2*x+1]%MOD;
        comb(num[x],num[2*x],num[2*x+1]);
    }
    
    void build() {
        FORd(i,1,SZ) pull(i);
    }
    
    void upd(int ind, pi x) {
        ind ^= 1<<17;
        num[ind][1] = x.f; num[ind][0] = x.s;
        tot[ind] = (num[ind][1]+num[ind][0])%MOD; 
        for (ind /= 2; ind; ind /= 2) pull(ind);
    }
};

Seg<1<<17> S;

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> C;
    F0R(i,N) {
        cin >> S.num[i^(1<<17)][1];
        S.num[i^(1<<17)][1] %= MOD;
    }
    F0R(i,N) {
        cin >> S.num[i^(1<<17)][0];
        S.num[i^(1<<17)][0] %= MOD;
        S.tot[i^(1<<17)] = (S.num[i^(1<<17)][0]+S.num[i^(1<<17)][1])%MOD;
    }
    S.build();
    int Q; cin >> Q;
    F0R(i,Q) {
        int p,a,b; cin >> p >> a >> b; 
        S.upd(p-1,{a%MOD,b%MOD});
        int ans = S.tot[1];
        // cout << "AH " << ans << "\n";
        F0R(i,C) ans = (ans+MOD-S.num[1][i])%MOD;
        cout << ans << "\n";
    }
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
84.0 / 140.0

# Verdict Execution time Memory Grader output
1 Correct 196 ms 21904 KB Output is correct
2 Correct 127 ms 22116 KB Output is correct
3 Correct 118 ms 22116 KB Output is correct
4 Correct 1006 ms 25232 KB Output is correct
5 Correct 1302 ms 29132 KB Output is correct
6 Correct 1000 ms 32680 KB Output is correct
7 Runtime error 1029 ms 33792 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
8 Runtime error 917 ms 33792 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
9 Runtime error 1438 ms 33792 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
10 Runtime error 1445 ms 33792 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.