# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
950721 | willychan | Intergalactic ship (IZhO19_xorsum) | C++17 | 1431 ms | 7700 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include<bits/extc++.h>
//__gnu_pbds
const int MOD = 1e9+7;
const int N = 1e5+5;
int p2[N];
inline int mul(const int &a,const int &b){
return (1LL*a*b)%MOD;
}
int main(){
ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int n;cin>>n;
vector<int> a(n+1);
for(int i=1;i<=n;i++) cin>>a[i];
int q;cin>>q;
vector<tuple<int,int,int> > Q(q);
for(int i=0;i<q;i++){
cin>>get<0>(Q[i])>>get<1>(Q[i])>>get<2>(Q[i]);
}
p2[0]=1;
for(int i=1;i<=max(q,100);i++) p2[i] = (2LL*p2[i-1])%MOD;
ll ans = 0;
for(int b1=0;b1<7;b1++){for(int b2=0;b2<7;b2++){
vector<int> cnt1(n+2,0);
vector<int> cnt2(n+2,0);
vector<vector<int> > both(n+2,vector<int>(n+2,0));
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |