結果
問題 |
No.702 中央値を求めよ LIMITED
|
ユーザー |
![]() |
提出日時 | 2021-06-07 01:31:25 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
CE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 1,873 bytes |
コンパイル時間 | 1,277 ms |
コンパイル使用メモリ | 105,432 KB |
最終ジャッジ日時 | 2025-01-01 23:14:49 |
合計ジャッジ時間 | 1,950 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp:46:1: error: ‘uint32_t’ does not name a type 46 | uint32_t x = 0, y = 1, z = 2, w = 3; | ^~~~~~~~ main.cpp:23:1: note: ‘uint32_t’ is defined in header ‘<cstdint>’; did you forget to ‘#include <cstdint>’? 22 | #include <utility> +++ |+#include <cstdint> 23 | #include <vector> main.cpp: In function ‘ll generate()’: main.cpp:49:5: error: ‘uint32_t’ was not declared in this scope 49 | uint32_t t = (x ^ (x << 11)); | ^~~~~~~~ main.cpp:49:5: note: ‘uint32_t’ is defined in header ‘<cstdint>’; did you forget to ‘#include <cstdint>’? main.cpp:50:5: error: ‘x’ was not declared in this scope; did you mean ‘dx’? 50 | x = y; | ^ | dx main.cpp:50:9: error: ‘y’ was not declared in this scope; did you mean ‘yn’? 50 | x = y; | ^ | yn main.cpp:51:9: error: ‘z’ was not declared in this scope 51 | y = z; | ^ main.cpp:52:9: error: ‘w’ was not declared in this scope 52 | z = w; | ^ main.cpp:53:28: error: ‘t’ was not declared in this scope; did you mean ‘tm’? 53 | w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)); | ^ | tm main.cpp: In function ‘bool f(ll)’: main.cpp:93:5: error: ‘x’ was not declared in this scope 93 | x = seed, y = 1, z = 2, w = 3; | ^ main.cpp:93:15: error: ‘y’ was not declared in this scope 93 | x = seed, y = 1, z = 2, w = 3; | ^ main.cpp:93:22: error: ‘z’ was not declared in this scope 93 | x = seed, y = 1, z = 2, w = 3; | ^ main.cpp:93:29: error: ‘w’ was not declared in this scope 93 | x = seed, y = 1, z = 2, w = 3; | ^
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <algorithm> #include <bitset> #include <climits> #include <cmath> #include <cstring> #include <deque> #include <forward_list> #include <functional> #include <iomanip> #include <iostream> #include <list> #include <map> #include <queue> #include <set> #include <string> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> using namespace std; typedef long long ll; typedef pair<int, int> PII; typedef pair<int, ll> PIL; typedef pair<ll, int> PLI; typedef pair<ll, ll> PLL; typedef bitset<16> BS; struct edge { int to, cost, id; }; const double PI = 3.14159265358979323846; const double EPS = 1E-09; const ll MOD = 1E+09 + 7; // =998244353; const ll INFL = 1E18; const int INFI = 1E09; const int MAX_N = 1E+05; ll dx[4] = { -1, 1, 0, 0 }, dy[4] = { 0, 0, -1, 1 }; int64_t seed; uint32_t x = 0, y = 1, z = 2, w = 3; ll generate() { uint32_t t = (x ^ (x << 11)); x = y; y = z; z = w; w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)); return (ll)w; } bool f(ll c); int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cin >> seed; /* for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << "i = " << i << ", j = " << j << ", dp = " << dp[i][j] << "\n"; } } */ ll low = 0, high = INFL; while (true) { ll mid = (low + high) / 2; if (mid == low || mid == high) break; if (f(mid)) { high = mid; } else { low = mid; } } cout << high << "\n"; return 0; } bool f(ll c) { x = seed, y = 1, z = 2, w = 3; int res = 0; for (int i = 0; i < 10000001; i++) { if (generate() <= c) res++; } return res > 10000001 / 2; }