#include <bits/stdc++.h>
using namespace std;
#undef _GLIBCXX_DEBUG // disable run-time bound checking, etc
// #pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
#pragma GCC optimize ("unroll-loops")
// #pragma GCC target("bmi,bmi2,lzcnt,popcnt") // bit manipulation
// #pragma GCC target("movbe") // byte swap
// #pragma GCC target("aes,pclmul,rdrnd") // encryption
#pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD
// #include <bits/extc++.h>
// using namespace __gnu_pbds;
// template<class T>using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// template<class T>using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define ll long long
#define INF (ll)1e9+7
#define fo(i, n) for(ll i=0;i<((ll)n);i++)
#define deb(x) cout << #x << " = " << x << endl;
#define deb2(x, y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LSOne(S) ((S) & (-S))
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
inline int readint(){ int v = 0; char c; while((c = getchar()) != EOF && c != ' ' && c != '\n'){ v *= 10; v += c - '0'; } return v; }
inline int readintsigned() { int v = 0; int sign = 1; char c = getchar(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } return v * sign; }
inline string readstring() { string s; char c; while ((c = getchar()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } return s; }
template <class result_t=std::chrono::milliseconds,class clock_t=std::chrono::steady_clock,class duration_t = std::chrono::milliseconds>
auto since(std::chrono::time_point<clock_t, duration_t> const& start){return std::chrono::duration_cast<result_t>(clock_t::now() - start);}
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vpii> vvpii;
typedef vector<vpl> vvpl;
int n, c, version = 1, it = 0;
int memo[100001][21];
vi inBatch(100001), newOrder;
vvi memo2;
vpl vals;
ll dp(int pos, int k){
if(k<0)k++;
if(pos == n) return !k;
int &ans = memo[pos][k];
if(ans != -1) return ans;
ans = 0;
return ans = ((inBatch[pos] == version?dp(pos+1, k):dp(pos+1, k-1)*vals[pos].F+dp(pos+1, k)*vals[pos].S)%10007);
}
ll dp2(int pos, int k){
if(k<0)k++;
if(pos == newOrder.size()) return memo[0][k];
int &ans = memo2[pos][k];
if(ans != -1) return ans;
return ans = (dp2(pos+1, k-1)*vals[newOrder[pos]].F+dp2(pos+1, k)*vals[newOrder[pos]].S)%10007;
}
int main() {
// cout << fixed << setprecision(20);
// auto start = std::chrono::steady_clock::now(); // since(start).count()
cin.tie(0)->sync_with_stdio(0);
cin >> n >> c;
int newpos, val1, val2, q;
fo(i, n){
cin >> val1;
vals.pb({val1, 0});
}
fo(i, n)cin >> vals[i].S;
cin >> q;
inBatch.assign(n, 0);
vpl rem(q);
vl remPos(q);
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
while(q--){
cin >> newpos >> val1 >> val2;
inBatch[--newpos] = version;
rem[it] = mp(val1, val2);
remPos[it++] = newpos;
if(q%((int)sqrt(n)) == 0){
memo2.assign(it+2, vi(c+1, -1));
memset(memo, -1, sizeof(memo));
fo(i, c+1) dp(0, i);
fo(i, n) if(inBatch[i] == version) newOrder.pb(i);
shuffle(all(newOrder), rnd);
fo(i, it){
fo(j, memo2.size()){
fo(jj, c+1){
memo2[j][jj] = -1;
}
if(newOrder[j] == remPos[i]) break;
}
vals[remPos[i]] = rem[i];
cout << dp2(0, c) << "\n";
}
newOrder.clear();
version++;
it = 0;
}
}
exit(0);
}
Compilation message
relativnost.cpp: In function 'long long int dp2(int, int)':
relativnost.cpp:64:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
64 | if(pos == newOrder.size()) return memo[0][k];
| ~~~~^~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
13 ms |
9052 KB |
Output is correct |
| 2 |
Correct |
17 ms |
9052 KB |
Output is correct |
| 3 |
Correct |
17 ms |
9052 KB |
Output is correct |
| 4 |
Correct |
2304 ms |
16008 KB |
Output is correct |
| 5 |
Execution timed out |
4075 ms |
19248 KB |
Time limit exceeded |
| 6 |
Execution timed out |
4081 ms |
19548 KB |
Time limit exceeded |
| 7 |
Correct |
3964 ms |
16848 KB |
Output is correct |
| 8 |
Correct |
3624 ms |
19200 KB |
Output is correct |
| 9 |
Execution timed out |
4054 ms |
18696 KB |
Time limit exceeded |
| 10 |
Execution timed out |
4051 ms |
18140 KB |
Time limit exceeded |
