oj.uz

답안 #93652

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
93652 2019-01-10T14:27:11 Z ajmasin Relativnost (COCI15_relativnost) C++14
126 / 140
 4000 ms 27256 KB 
#include <bits/stdc++.h>
using namespace std;

#define REP(i, a, b) for(int i = a; i < b; i++)

const int maxn = 100100;
const int maxc = 25;
const int offset = (1<<17);
const int mod = 10007;

int n, c, q;

int niza[maxn];
int nizb[maxn];

int add(int a, int b)
{
    a += b;
    if(a >= mod) a -= mod;
    if(a < 0) a += mod;
    return a;
}

int mult(int a, int b)
{
    return a * b % mod;
}

struct tournament
{
    int brn[2 * offset][maxc];
    void update(int cvor)
    {
        REP(i, 0, c + 1) brn[cvor][i] = 0;
        REP(i, 0, c + 1)
        {
            REP(j, 0, c + 1)
            {
                int suma = i + j;
                if(suma > c) suma = c;
                brn[cvor][suma] = add(brn[cvor][suma], mult(brn[cvor * 2][i], brn[cvor * 2 + 1][j]));
            }
        }
        return;
    }
}T;

bool ok(char znak)
{
    if (znak >= '0' && znak <= '9') return 1;
    return 0;
}

int dajbroj()
{
    int ret = 0;
    char in;
    while(!ok(in = getchar_unlocked()));
    ret += in - '0';
    while(ok(in = getchar_unlocked()))
    {
        ret *= 10;
        ret += in - '0';
    }
    return ret;
}

int main()
{
    for(int i = 2 * offset - 1; i >= offset; i--) T.brn[i][0] = 1;
    n = dajbroj();
    c = dajbroj();
    int a, b;
    REP(i, 0, n)
    {
        //scanf("%d", &niza[i]);
        niza[i] = dajbroj();
        niza[i] %= mod;
    }
    REP(i, 0, n)
    {
        //scanf("%d", &nizb[i]);
        nizb[i] = dajbroj();
        nizb[i] %= mod;
    }
    REP(i, 0, n)
    {
        T.brn[i + offset][0] = nizb[i];
        T.brn[i + offset][1] = niza[i];
    }
    for(int i = offset - 1; i > 0; i--) T.update(i);
    q = dajbroj();
    int p;
    REP(i, 0, q)
    {
        //scanf("%d%d%d", &p, &a, &b);
        p = dajbroj();
        a = dajbroj();
        b = dajbroj();
        a %= mod;
        b %= mod;
        p--;
        T.brn[p + offset][0] = b;
        T.brn[p + offset][1] = a;
        p += offset;
        p /= 2;
        while(p)
        {
            T.update(p);
            p /= 2;
        }
        printf("%d\n", T.brn[1][c]);
    }
    return 0;
}

Subtask #1
126.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 78 ms 26104 KB Output is correct
2 Correct 113 ms 25976 KB Output is correct
3 Correct 242 ms 25976 KB Output is correct
4 Correct 676 ms 26744 KB Output is correct
5 Correct 2356 ms 27232 KB Output is correct
6 Correct 3496 ms 27144 KB Output is correct
7 Correct 1553 ms 26752 KB Output is correct
8 Correct 727 ms 27004 KB Output is correct
9 Correct 1466 ms 27256 KB Output is correct
10 Execution timed out 4018 ms 27016 KB Time limit exceeded