Submission #1109164

#TimeUsernameProblemLanguageResultExecution timeMemory
1109164KasymKMosaic (IOI24_mosaic)C++17
22 / 100
726 ms91836 KiB
#include "bits/stdc++.h" using namespace std; #define ff first #define ss second #define all(v) v.begin(), v.end() #define ll long long #define pb push_back #define pii pair<int, int> #define pli pair<ll, int> #define pll pair<ll, ll> #define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i) #define wr puts("----------------") template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;} template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;} const int N = 4e5+5; int cnt[N]; int wow(int a, int b){ return (!(a|b)?1:0); } vector<ll> mosaic(vector<int> X, vector<int> Y, vector<int> T, vector<int> B, vector<int> L, vector<int> R){ map<pii, int> mp; int n = (int)X.size(); for(int i = 1; i <= n; ++i) mp[{1, i}] = X[i-1], mp[{i, 1}] = Y[i-1]; for(int i = 2; i <= n; ++i) for(int j = 2; j <= 3; ++j) mp[{i, j}] = wow(mp[{i-1, j}], mp[{i, j-1}]); for(int i = 2; i <= 3; ++i) for(int j = 2; j <= n; ++j) mp[{i, j}] = wow(mp[{i-1, j}], mp[{i, j-1}]); for(auto i : mp) cnt[i.ff.ff-i.ff.ss+n] = i.ss; int q = (int)L.size(); vector<ll> ans; for(int i = 0; i < q; ++i){ int x = T[i]+1, y = L[i]+1; if(x <= 3 or y <= 3) ans.pb(mp[{x, y}]); else ans.pb(cnt[x-y+n]); } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...