oj.uz

답안 #213627

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
213627 2020-03-26T09:39:34 Z wendy_virgo XOR Sum (info1cup17_xorsum) C++14
7 / 100
 1600 ms 8568 KB 
#include <bits/stdc++.h>

using namespace std;

template<typename TH>
void _dbg(const char* sdbg, TH h)
{
	cerr << sdbg << " = " << h << "\n";
}

template<typename TH, typename... TA>
void _dbg(const char* sdbg, TH h, TA... t)
{
	while (*sdbg != ',') cerr << *sdbg++;
	cerr << " = " << h << ",";
	_dbg(sdbg + 1, t...);
}

#define db(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#define chkpt cerr << "--- Checkpoint here ---\n";

const int N=1e6+6;

int n;
int64_t a[N];

void Sub1(){
    int ans=0;
    for(int i=1;i<=n;++i){
        for(int j=i;j<=n;++j){
            ans^=(a[i]+a[j]);
        }
    }
    cout<<ans;
}

int Check(int pos){
    int res=0;
    vector<vector<int>> vec(2);
    for(int i=n;i>=1;--i){
        int64_t val=0;
        for(int j=0;j<pos;++j){
            if((a[i]>>j)&1){
                val|=1<<j;
            }
        }
        if((a[i]>>pos)&1){
            vec[1].push_back(val);
            int cnt=0;
            for(int j=0;j<vec[0].size();++j){
                if(vec[0][j]+val<(1<<pos)){
                    cnt++;
                }
            }
            res^=(cnt%2);
            cnt=0;
            for(int j=0;j<vec[1].size();++j){
                if(vec[1][j]+val>=(1<<pos)){
                    cnt++;
                }
            }
            res^=(cnt%2);
        }
        else{
            vec[0].push_back(val);
            int cnt=0;
            for(int j=0;j<vec[1].size();++j){
                if(vec[1][j]+val<(1<<pos)){
                    cnt++;
                }
            }
            res^=(cnt%2);
            cnt=0;
            for(int j=0;j<vec[0].size();++j){
                if(vec[0][j]+val>=(1<<pos)){
                    cnt++;
                }
            }
            res^=(cnt%2);
        }
    }
    return res;
}

void Sub2(){
    int64_t ans=0;
    for(int i=0;i<=31;++i){
        if(Check(i)){
            ans+=(int64_t)1<<i;
        }
    }
    cout<<ans;
}

int main()
{
//    freopen("info1cup17_xorsum.inp","r",stdin);
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin>>n;
	for(int i=1;i<=n;++i){
        cin>>a[i];
	}
	Sub2();
    return 0;
}

Compilation message

xorsum.cpp: In function 'int Check(int)':
xorsum.cpp:50:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int j=0;j<vec[0].size();++j){
                         ~^~~~~~~~~~~~~~
xorsum.cpp:57:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int j=0;j<vec[1].size();++j){
                         ~^~~~~~~~~~~~~~
xorsum.cpp:67:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int j=0;j<vec[1].size();++j){
                         ~^~~~~~~~~~~~~~
xorsum.cpp:74:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int j=0;j<vec[0].size();++j){
                         ~^~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 291 ms 504 KB Output is correct
2 Correct 288 ms 256 KB Output is correct

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1700 ms 8568 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1700 ms 8568 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 291 ms 504 KB Output is correct
2 Correct 288 ms 256 KB Output is correct
3 Execution timed out 1700 ms 1528 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 291 ms 504 KB Output is correct
2 Correct 288 ms 256 KB Output is correct
3 Execution timed out 1700 ms 8568 KB Time limit exceeded
4 Halted 0 ms 0 KB -