제출 #932717

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
932717		gaga999	Relativnost (COCI15_relativnost)	C++17	0 / 140	1196 ms	29020 KiB

relativnost

#include <cstdio>
#include <stdio.h>
#include <iostream>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stdlib.h>
#include <cstring>
#include <string.h>
#include <string>
#include <sstream>
#include <assert.h>
#include <climits>
#include <sstream>
#include <numeric>
#include <time.h>
#include <limits.h>
#include <list>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <iomanip>
#include <complex>
#include <chrono>
#include <fstream>
#include <functional>
#include <unistd.h>
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#define lowbit(x) ((x) & -(x))
#define ml(a, b) (((a) * (b)) % M)
#define tml(a, b) (a) = (((a) * (b)) % M)
#define ad(a, b) (((a) + (b)) % M)
#define tad(a, b) (a) = (((a) + (b)) % M)
#define mi(a, b) ((M + (a) - (b)) % M)
#define tmi(a, b) (a) = ((M + (a) - (b)) % M)
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
#define iter(a) (a).begin(), (a).end()
#define riter(a) (a).rbegin(), (a).rend()
#define init(a, b) memset((a), (b), sizeof(a))
#define cpy(a, b) memcpy((a), (b), sizeof(a))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define pb emplace_back
#define mpr make_pair
#define ls(i) ((i) << 1)
#define rs(i) ((i) << 1 | 1)
#define INF 0x3f3f3f3f
#define NIF 0xc0c0c0c0
#define eps 1e-9
#define F first
#define S second
#define AC cin.tie(0)->sync_with_stdio(0)
using namespace std;
typedef long long llt;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef complex<double> cd;
const int M = 1e4 + 7;

// random_device rm;
// mt19937 rg(rm());
// default_random_engine rg(rm());
// uniform_int_distribution<int> rd(INT_MIN, INT_MAX);
// uniform_real_distribution<double> rd(0, M_PI);

void db() { cerr << "\n"; }
template <class T, class... U>
void db(T a, U... b) { cerr << a << " ", db(b...); }

inline char gc()
{
    const static int SZ = 1 << 16;
    static char buf[SZ], *p1, *p2;
    if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2))
        return -1;
    return *p1++;
}
void rd() {}
template <typename T, typename... U>
void rd(T &x, U &...y)
{
    x = 0;
    bool f = 0;
    char c = gc();
    while (!isdigit(c))
        f ^= !(c ^ 45), c = gc();
    while (isdigit(c))
        x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
    f && (x = -x), rd(y...);
}

template <typename T>
void prt(T x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        prt(x / 10);
    putchar((x % 10) ^ 48);
}

inline int pw(int a, int b)
{
    int sm = 1;
    for (; b; b >>= 1)
    {
        if (b & 1)
            tml(sm, a);
        tml(a, a);
    }
    return sm;
}

const int N = 1e5 + 5;
int cnt = 1, c, p;
int tr[20][N << 2];

inline void pul(int id)
{
    for (int i = 0; i < c; i++)
    {
        tr[i][id] = 0;
        for (int j = 0; j <= i; j++)
            tad(tr[i][id], ml(tr[j][ls(id)], tr[i - j][rs(id)]));
    }
}

void blt(int l, int r, int id)
{
    if (l == r)
    {
        rd(tr[1][id], tr[0][id]);
        tr[1][id] %= M, tr[0][id] %= M;
        tml(cnt, ad(tr[1][id], tr[0][id]));
        return;
    }
    int m = (l + r) >> 1;
    blt(l, m, ls(id)), blt(m + 1, r, rs(id));
    pul(id);
}

void cg(int l, int r, int id)
{
    if (l == r)
    {
        tml(cnt, pw(ad(tr[1][id], tr[0][id]), M - 2));
        rd(tr[1][id], tr[0][id]);
        tr[1][id] %= M, tr[0][id] %= M;
        tml(cnt, ad(tr[1][id], tr[0][id]));
        return;
    }
    int m = (l + r) >> 1;
    if (p <= m)
        cg(l, m, ls(id));
    else
        cg(m + 1, r, rs(id));
    pul(id);
}

signed main()
{
    int n, q;
    rd(n, c);
    blt(1, n, 1);
    rd(q);
    while (q--)
    {
        rd(p), cg(1, n, 1);
        int ans = cnt;
        for (int i = 0; i < c; i++)
            tmi(ans, tr[i][1]);
        prt(ans), putchar('\n');
    }
}

• Subtask 1: 0 / 140