oj.uz

답안 #153992

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
153992 2019-09-17T16:23:27 Z nicolaalexandra Relativnost (COCI15_relativnost) C++14
0 / 140
 3809 ms 25232 KB 
#include <iostream>
#define DIM 100010
#define MOD 10007
using namespace std;
int aint[3*DIM][23];
pair <int,int> nr[DIM];
int n,i,q,a,b,c,poz;
void build (int nod, int st, int dr){
    if (st == dr){
        aint[nod][0] = nr[st].second;
        aint[nod][1] = nr[st].first; /// am o sg pers care ia tablou colorat
        return;
    }
    int mid = (st+dr)>>1;
    build (nod<<1,st,mid);
    build ((nod<<1)|1,mid+1,dr);
    /// aint[i][j] j < c - sa am exact j pers care ia tablou, restul nu
    /// aint[i][c+]  - sa am cel putin c pers care ia tablou
    for (int i=0;i<=c;i++){
        for (int j=0;j<=c;j++){
            int val = i+j;
            if (val > (dr-st+1))
                continue;
            if (val > c)
                val = c;
            aint[nod][val] = (aint[nod][val] + 1LL*aint[nod<<1][i]*aint[(nod<<1)|1][j]%MOD)%MOD;
        }}}
void update (int nod, int st, int dr, int poz){
    if (st == dr){
        aint[nod][0] = nr[poz].second;
        aint[nod][1] = nr[poz].first;
        return;
    }
    int mid = (st+dr)>>1;
    if (poz <= mid)
        update (nod<<1,st,mid,poz);
    else update ((nod<<1)|1,mid+1,dr,poz);

    for (int i=0;i<=c;i++)
        aint[nod][i] = 0;

    for (int i=0;i<=c;i++){
        for (int j=0;j<=c;j++){
            int val = i+j;
            if (val > (dr-st+1))
                continue;
            if (val > c)
                val = c;
            aint[nod][val] = (aint[nod][val] + 1LL*aint[nod<<1][i]*aint[(nod<<1)|1][j]%MOD)%MOD;
        }}}
int main (){

    cin>>n>>c;
    for (i=1;i<=n;i++){
        cin>>a>>b;
        nr[i] = make_pair(a%MOD,b%MOD);
    }
    build (1,1,n);
    cin>>q;
    for (;q--;){
        cin>>poz>>a>>b;
        nr[poz] = make_pair(a%MOD,b%MOD);
        update (1,1,n,poz);
        cout<<aint[1][c]<<"\n";
    }


    return 0;
}

Subtask #1
0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 13 ms 504 KB Output isn't correct
2 Incorrect 19 ms 504 KB Output isn't correct
3 Incorrect 27 ms 504 KB Output isn't correct
4 Incorrect 797 ms 12960 KB Output isn't correct
5 Incorrect 1860 ms 25232 KB Output isn't correct
6 Incorrect 2484 ms 25120 KB Output isn't correct
7 Incorrect 1272 ms 13208 KB Output isn't correct
8 Incorrect 865 ms 24952 KB Output isn't correct
9 Incorrect 1416 ms 25056 KB Output isn't correct
10 Incorrect 3809 ms 25096 KB Output isn't correct