Task: | Counting ones |
Sender: | AleksandrPolitov |
Submission time: | 2024-10-24 01:23:29 +0300 |
Language: | C++ (C++20) |
Status: | READY |
Result: | TIME LIMIT EXCEEDED |
test | verdict | time | |
---|---|---|---|
#1 | TIME LIMIT EXCEEDED | -- | details |
#2 | TIME LIMIT EXCEEDED | -- | details |
#3 | ACCEPTED | 0.97 s | details |
#4 | ACCEPTED | 0.97 s | details |
#5 | ACCEPTED | 0.94 s | details |
#6 | ACCEPTED | 0.94 s | details |
#7 | ACCEPTED | 0.94 s | details |
#8 | ACCEPTED | 0.94 s | details |
#9 | WRONG ANSWER | 0.94 s | details |
#10 | WRONG ANSWER | 0.94 s | details |
Code
#ifdef ONPC#define _GLIBCXX_DEBUG#endif#include <bits/stdc++.h>#define char unsigned char#define rep(i, a, b) for(int i=a; i< (b); ++i)#define all(x) begin(x), end(x)#define sz(x) (int)(x).size()#define eb emplace_back#define mp make_pair#define mt make_tuple#define fi first#define se second#define pb push_back#define LSOne(S) ((S) & -(S))using namespace std;// mt19937 rnd(239);mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());template <typename T> int sgn(T x) { return (T(0) < x) - (x < T(0)); }typedef long double T;typedef complex<T> pt;#define X real()#define Y imag()template<class T>istream& operator>> (istream& is, complex<T>& p) {T value;is >> value;p.real(value);is >> value;p.imag(value);return is;}typedef long long ll;typedef long double ld;using pi = pair<ll, ll>;using vi = vector<ll>;template <class T>using pq = priority_queue<T>;template <class T>using pqg = priority_queue<T, vector<T>, greater<T>>;int popcnt(int x) { return __builtin_popcount(x); }int popcnt(ll x) { return __builtin_popcountll(x); }#define MIN(v) *min_element(all(v))#define MAX(v) *max_element(all(v))#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))void __print(int x) {cerr << x;}void __print(long x) {cerr << x;}void __print(long long x) {cerr << x;}void __print(unsigned x) {cerr << x;}void __print(unsigned long x) {cerr << x;}void __print(unsigned long long x) {cerr << x;}void __print(float x) {cerr << x;}void __print(double x) {cerr << x;}void __print(long double x) {cerr << x;}void __print(char x) {cerr << '\'' << x << '\'';}void __print(const char *x) {cerr << '\"' << x << '\"';}void __print(const string &x) {cerr << '\"' << x << '\"';}void __print(bool x) {cerr << (x ? "true" : "false");}template<typename T, typename V>void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}template<typename T>void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}void _print() {cerr << "]\n";}template <typename T, typename... V>void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}#ifdef DEBUG#define dbg(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl;#else#define dbg(x...)#endiftemplate<typename S, typename T = S> void chmin(S &s, T t) {s = s < t ? s : t;}template<typename S, typename T = S> void chmax(S &s, T t) {s = s > t ? s : t;}const int INF = 1e9; // 10^9 = 1B is < 2^31-1const ll LLINF = 4e18; // 4*10^18 is < 2^63-1const double EPS = 1e-9;const ll MOD = 1e9+7;int solve() {int n; std::cin >> n;vector<ll> v(n);for (int i = 0; i < n; i++) {std::cin >> v[i];}pair<ll, ll> res={v[0], v[1]};ll curr=popcnt(v[0]*v[1]);for (int _ = 0; _ < 20000000; _++) {int a=rnd()%n,b=rnd()%n;if(a!=b) {ll w=popcnt(v[a]*v[b]);if(w>curr) {res={v[a], v[b]};curr=w;}}}std::cout << curr << std::endl;std::cout << res.fi << " " << res.se << std::endl;return 0;}int32_t main() {ios::sync_with_stdio(0);cin.tie(0);int TET = 1;//cin >> TET;for (int i = 1; i <= TET; i++) {#ifdef ONPCcout << "TEST CASE#" << i << endl;#endifif (solve()) {break;}#ifdef ONPCcout << "__________________________" << endl;#endif}#ifdef ONPCcerr << endl << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl;#endif}
Test details
Test 1
Verdict: TIME LIMIT EXCEEDED
input |
---|
5 42 100 73 94 1 |
correct output |
---|
9 42 73 |
user output |
---|
(empty) |
Test 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
5 44 19 3 94 55 |
correct output |
---|
8 19 94 |
user output |
---|
(empty) |
Test 3
Verdict: ACCEPTED
input |
---|
10 551 71 709 840 291 122 511 570... |
correct output |
---|
15 893 438 |
user output |
---|
15 438 893 |
Test 4
Verdict: ACCEPTED
input |
---|
10 968 901 548 173 973 856 715 61... |
correct output |
---|
14 715 698 |
user output |
---|
14 698 715 |
Test 5
Verdict: ACCEPTED
input |
---|
100 221994 55181 870733 831328 206... |
correct output |
---|
29 396737 649459 |
user output |
---|
29 368163 14581 |
Test 6
Verdict: ACCEPTED
input |
---|
100 892861 947477 331980 209407 82... |
correct output |
---|
29 825210 578859 |
user output |
---|
29 825210 578859 |
Test 7
Verdict: ACCEPTED
input |
---|
10000 76308292 227339075 779918796 3... |
correct output |
---|
50 978548139 589096701 |
user output |
---|
50 589096701 978548139 |
Test 8
Verdict: ACCEPTED
input |
---|
10000 873429404 968540665 239439572 ... |
correct output |
---|
49 661547021 435157931 |
user output |
---|
49 661547021 435157931 |
Test 9
Verdict: WRONG ANSWER
input |
---|
10000 10374159 364461027 501874596 4... |
correct output |
---|
50 313852607 889662850 |
user output |
---|
48 419206601 601613582 |
Test 10
Verdict: WRONG ANSWER
input |
---|
10000 771320644 298761159 20751947 4... |
correct output |
---|
49 516789275 257079921 |
user output |
---|
48 625069515 922232785 |