Submission #345665

#	Time	Username	Problem	Language	Result	Execution time	Memory
345665		oleh1421	Intergalactic ship (IZhO19_xorsum)	C++17	0 / 100	73 ms	111104 KiB

xorsum

//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define endl '\n'
const int N=1010;
const ll mod=1000000007;
int S[7][7][N][N];
int a[N];
void solve(){
    int n;cin>>n;
    for (int i=1;i<=n;i++){
        cin>>a[i];
    }
    n=999;
    for (int j=0;j<7;j++){
        for (int t=j;t<7;t++){
            for (int x=1;x<=n;x++){
                for (int y=x;y<=n;y++){
                    S[j][t][x][y]++;
                }
            }
        }
    }
//    for (int bit=0;bit<7;bit++){
//        for (int i=1;i<=n;++i){
//            for (int j=1;j<=n;j++) S[bit][i][j]+=S[bit][i][j-1];
//            for (int j=1;j<=n;j++) S[bit][i][j]+=S[bit][i-1][j];
//        }
//    }
//    for (int i=1;i<=n;i++){
//        for (int j=1;j<=n;j++){
//            for (int bit_i=0;bit_i<7;bit_i++){
//                for (int int bit_j=0;bit_j<7;bit_j++){
//                    int cnt_i=
//                }
//            }
//        }
//    }
}
int32_t main()
{

    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int tt=1;
    while (tt--){
        solve();
    }

    return 0;
}

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