제출 #950721

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
950721	2024-03-20 15:45:50	willychan	Intergalactic ship (IZhO19_xorsum)	C++17	100 / 100	1431 ms	7700 KiB

xorsum

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#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));
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 4 / 4
• Subtask 2: 5 / 5
• Subtask 3: 6 / 6
• Subtask 4: 9 / 9
• Subtask 5: 8 / 8
• Subtask 6: 11 / 11
• Subtask 7: 19 / 19
• Subtask 8: 30 / 30
• Subtask 9: 8 / 8