Submission #847889

#TimeUsernameProblemLanguageResultExecution timeMemory
847889TB_Relativnost (COCI15_relativnost)C++17
56 / 140
4054 ms17880 KiB
#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; int memo[100001][21]; vi inBatch, 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]?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; vl remPos; while(q--){ cin >> newpos >> val1 >> val2; inBatch[--newpos] = 1; rem.pb(mp(val1, val2)); remPos.pb(newpos); if(q%((int)sqrt(n)) == 0){ memset(memo, -1, sizeof(memo)); fo(i, c+1) dp(0, i); fo(i, n) if(inBatch[i]) newOrder.pb(i); fo(i, rem.size()){ memo2.assign(newOrder.size(), vi(c+1, -1)); vals[remPos[i]] = rem[i]; cout << dp2(0, c) << "\n"; } inBatch.assign(n, 0); rem.clear(); remPos.clear(); newOrder.clear(); } } exit(0); }

Compilation message (stderr)

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];
      |        ~~~~^~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...