/*
$$$$$$$\ $$\ $$$$$$$\
$$ __$$\ \__| $$ __$$\
$$ | $$ | $$$$$$\ $$$$$$\ $$\ $$$$$$$\ $$ | $$ | $$$$$$\ $$$$$$\ $$$$$$$\ $$$$$$\
$$$$$$$\ |$$ __$$\ $$ __$$\ $$ |$$ _____|$$$$$$$\ | \____$$\ $$ __$$\ $$ _____|\____$$\
$$ __$$\ $$ / $$ |$$ | \__|$$ |\$$$$$$\ $$ __$$\ $$$$$$$ |$$ | \__|$$ / $$$$$$$ |
$$ | $$ |$$ | $$ |$$ | $$ | \____$$\ $$ | $$ |$$ __$$ |$$ | $$ | $$ __$$ |
$$$$$$$ |\$$$$$$ |$$ | $$ |$$$$$$$ |$$$$$$$ |\$$$$$$$ |$$ | \$$$$$$$\\$$$$$$$ |
\_______/ \______/ \__| \__|\_______/ \_______/ \_______|\__| \_______|\_______|
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define PB push_back
#define MP make_pair
#define INS insert
#define LB lower_bound
#define UB upper_bound
#define pii pair <int,int>
#define pll pair <long long, long long>
#define X first
#define Y second
#define _ << " " <<
#define sz(x) (int)x.size()
#define all(a) (a).begin(),(a).end()
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORD(i, a, b) for (int i = (a); i > (b); --i)
#define FORA(i, x) for (auto &i : x)
#define REP(i, n) FOR(i, 0, n)
#define BITS(x) __builtin_popcount(x)
#define SQ(a) (a) * (a)
#define TRACE(x) cout << #x " = " << (x) << '\n';
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define umap unordered_map
typedef long long ll;
typedef long double ld;
typedef vector <int> vi;
typedef vector <pii> vpi;
typedef vector <ll> vll;
typedef vector <pll> vpl;
typedef vector <double> vd;
typedef vector <ld> vld;
typedef vector<string> vs;
typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
//find_by_order -> kti najmanji
//order_of_key -> koliko ima manjih od x
//((float) t)/CLOCKS_PER_SEC
const int MOD = 10007;
const double PI = acos(-1);
const int INF = 1e9 + 10;
const ll INFL = 1e18 + 10;
const int ABC = 30;
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const int dox[] = {-1, 1, 0, 0, -1, -1, 1, 1};
const int doy[] = {0, 0, -1, 1, -1, 1, -1, 1};
inline int sum(int a, int b){
if (a + b < 0)
return (a + b + MOD) % MOD;
return (a + b) % MOD;
}
inline void add(int &a, int b){
a = sum(a, b);
}
inline int mul(ll a, ll b){
return ((a % MOD) * ((ll)b % MOD)) % MOD;
}
inline int sub(int a, int b){
return (a - b + MOD) % MOD;
}
inline int fast_pot(ll pot, ll n){
ll ret = 1;
while (n){
if (n & 1LL)
ret = (ret * pot) % MOD;
pot = (pot * pot) % MOD;
n >>= 1LL;
}
return ret;
}
inline int divide(int a, int b){
return mul(a, fast_pot(b, MOD - 2));
}
ll lcm(ll a, ll b){
return abs(a * b) / __gcd(a, b);
}
inline double ccw(pii A, pii B, pii C){
return (A.X * B.Y) - (A.Y * B.X) + (B.X * C.Y) - (B.Y * C.X) + (C.X * A.Y) - (C.Y * A.X);
}
inline int CCW(pii A, pii B, pii C){
double val = ccw(A, B, C);
double eps = max(max(abs(A.X), abs(A.Y)), max(max(abs(B.X), abs(B.Y)), max(abs(C.X), abs(C.Y)))) / 1e9;
if (val <= -eps)
return -1;
if (val >= eps)
return 1;
return 0;
}
void to_upper(string &x){
REP(i, sz(x))
x[i] = toupper(x[i]);
}
void to_lower(string &x){
REP(i, sz(x))
x[i] = tolower(x[i]);
}
string its(ll x){
if (x == 0)
return "0";
string ret = "";
while (x > 0){
ret += (x % 10) + '0';
x /= 10;
}
reverse(all(ret));
return ret;
}
ll sti(string s){
ll ret = 0;
REP(i, sz(s)){
ret *= 10;
ret += (s[i] - '0');
}
return ret;
}
const int N = 1e5 + 10;
const int C = 21;
const int LOG = 17;
const int OFF = 1 << LOG;
int n, c, a[N], b[N];
struct tournament{
int off, n, t[2 * OFF][C];
void init(int _n){
n = _n;
for (off = 1; off < n; off *= 2);
REP(i, 2 * off){
REP(j, c + 1)
t[i][j] = 0;
t[i][0] = 1;
}
}
void upd(int x, int a, int b){
t[x + off][0] = b;
t[x + off][1] = a;
for (int i = (x + off) / 2; i > 0; i /= 2){
REP(j, c + 1)
t[i][j] = 0;
REP(j, c + 1)
REP(k, c + 1)
add(t[i][min(j + k, (int)c)], mul(t[i * 2][j], t[i * 2 + 1][k]));
}
}
int query(){
return t[1][c];
}
} T;
int main () {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> c;
REP(i, n)
cin >> a[i];
REP(i, n)
cin >> b[i];
T.init(n);
REP(i, n){
T.upd(i, a[i] % MOD, b[i] % MOD);
}
int q; cin >> q;
REP(i, q){
int p, A, B; cin >> p >> A >> B;
p--;
a[p] = A % MOD, b[p] = B % MOD;
T.upd(p, a[p], b[p]);
cout << T.query() << '\n';
}
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
19 ms |
620 KB |
Output is correct |
| 2 |
Correct |
36 ms |
620 KB |
Output is correct |
| 3 |
Correct |
68 ms |
620 KB |
Output is correct |
| 4 |
Correct |
1104 ms |
14500 KB |
Output is correct |
| 5 |
Execution timed out |
4037 ms |
26308 KB |
Time limit exceeded |
| 6 |
Execution timed out |
4057 ms |
24556 KB |
Time limit exceeded |
| 7 |
Correct |
2908 ms |
14880 KB |
Output is correct |
| 8 |
Correct |
1740 ms |
26172 KB |
Output is correct |
| 9 |
Correct |
2500 ms |
26920 KB |
Output is correct |
| 10 |
Execution timed out |
4027 ms |
23916 KB |
Time limit exceeded |
