結果
問題 | No.3048 Swing |
ユーザー |
|
提出日時 | 2025-03-07 21:31:59 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 2,551 bytes |
コンパイル時間 | 2,276 ms |
コンパイル使用メモリ | 214,296 KB |
実行使用メモリ | 7,844 KB |
最終ジャッジ日時 | 2025-06-20 02:24:13 |
合計ジャッジ時間 | 3,767 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 62 |
ソースコード
// (◕ᴗ◕✿) // #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> #define rep(i, n) for (ll i = 0; i < (n); i++) #define srep(i, s, n) for (ll i = s; i < (n); i++) #define len(x) ((int)(x).size()) #define all(x) (x).begin(), (x).end() using namespace std; template<typename T> using vc = vector<T>; template<typename T> using vv = vc<vc<T>>; template<typename T> using vvv = vv<vc<T>>; using vi = vc<int>;using vvi = vv<int>; using vvvi = vv<vi>; using ll = long long;using vl = vc<ll>;using vvl = vv<ll>; using vvvl = vv<vl>; using ld = long double; using vld = vc<ld>; using vvld = vc<vld>; using vvvld = vc<vvld>; using uint = unsigned int; using ull = unsigned long long; const ld pi = acos(-1.0); const int inf = 0x3f3f3f3f; const ll INF = 0x3f3f3f3f3f3f3f3f; // const ll mod = 1000000007; const ll mod = 998244353; inline bool inside(ll y, ll x, ll H, ll W) {return 0 <= (y) and (y) < (H) and 0 <= (x) and (x) < (W); } #define debug(var) do{std::cout << #var << " : \n";view(var);}while(0) template<typename T> void view(T e){cout << e << endl;} template<typename T> void view(const vc<T>& v){for(const auto& e : v){ cout << e << " "; } cout << endl;} template<typename T> void view(const vv<T>& vv){ for(const auto& v : vv){ view(v); } } ll greedy(ll x, ll n){ srep(i, 1, n + 1){ if (x <= 0) x += i; else x -= i; } return x; } ll solve(ll x, ll n){ auto f = [&](ll p){ if (INF / p < (p + 1) / 2) return INF; return p * (p + 1) / 2; }; ll top = n + 1, bottom = 0; while (top - bottom > 1){ ll mid = (top + bottom) / 2; if (f(mid) < (x >= 0 ? x : -x + 1)) bottom = mid; else top = mid; } if (bottom == n){ if (x > 0) x -= bottom * (bottom + 1) / 2; else x += bottom * (bottom + 1) / 2; return x; } if (x > 0){ x -= bottom * (bottom + 1) / 2; }else{ bottom++; x += bottom * (bottom + 1) / 2; } if ((n - bottom) % 2){ x -= (bottom + 1); x -= (n - bottom) / 2; return x; }else{ x += (n - bottom) / 2; return x; } } int main(){ ll x, n; cin >> x >> n; cout << solve(x, n) << endl; // srep(n, 1, 100) for (int x = -100; x <= 100; x++){ // if (greedy(x, n) != solve(x, n)){ // cout << "(x, n) = (" << x << " " << n << ")" << endl; // cout << greedy(x, n) << " " << solve(x, n) << endl; // } // } }