oj.uz

Submission #497750

# Submission time Handle Problem Language Result Execution time Memory
497750 2021-12-23T17:38:12 Z Ziel XOR Sum (info1cup17_xorsum) C++17
7 / 100
 1396 ms 131076 KB 
/**
 * LES GREATEABLES BRO TEAM
**/
#pragma GCC optimization("g", on)
#pragma GCC optimize ("inline")
#pragma GCC optimization("03")
#pragma GCC optimization("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
template<class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
using ll = long long;
#define sz(x) (int)x.size()
const bool FLAG = false;
void setIO(const string &f = "");
 
#define int ll
 
void solve() {
    int n;
    cin >> n;
    vector<int> a(n);
    int mx = 0, res = 0;
    for (int &x: a) {
    	cin >> x;
    	mx = max(mx, x);
    }
 
    if (n * n <= 1e8) {
    	for (int i = 0; i < n; i++) {
    		for (int j = i; j < n; j++) {
    			res ^= (a[i] + a[j]);
    		}
    	}
    } else if (mx * mx <= 4e8) {
    	set<pair<int, int>> s;
    	ordered_set<int> occ[mx + 1];
    	for (int i = 0; i < n; i++) {
    		s.insert({i, a[i]});
    		occ[a[i]].insert(i);
    	}
    	vector<int> v(mx + mx + 2);
    	for (int a = 1; a <= mx; a++) {
    		for (int b = 1; b <= mx; b++) {
    			for (int pos: occ[a]) {
    				int k = sz(occ[b]) - occ[b].order_of_key(pos);
					v[a + b] += k;
    			}
    		}
    	}
    	for (int i = 1; i <= mx + mx; i++)
    		res ^= (v[i] % 2) * i;
    }
 
	cout << res;
}
 
signed main() {
    setIO();
    
    int tt = 1;
    if (FLAG) {
    	cin >> tt;
    }
    while (tt--) {
    	solve();
    }
    
    return 0;
}
 
void setIO(const string &f) {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    if (fopen((f + ".in").c_str(), "r")) {
        freopen((f + ".in").c_str(), "r", stdin);
        freopen((f + ".out").c_str(), "w", stdout);
    }
}

Compilation message

xorsum.cpp:4: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    4 | #pragma GCC optimization("g", on)
      | 
xorsum.cpp:6: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    6 | #pragma GCC optimization("03")
      | 
xorsum.cpp:7: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    7 | #pragma GCC optimization("unroll-loops")
      | 
xorsum.cpp:8: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    8 | #pragma comment(linker, "/stack:200000000")
      | 
xorsum.cpp: In function 'void setIO(const string&)':
xorsum.cpp:83:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   83 |         freopen((f + ".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
xorsum.cpp:84:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   84 |         freopen((f + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 2 ms 324 KB Output is correct

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 1396 ms 131076 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 1396 ms 131076 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 2 ms 324 KB Output is correct
3 Incorrect 10 ms 1972 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 2 ms 324 KB Output is correct
3 Runtime error 1396 ms 131076 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -