oj.uz

Submission #859963

# Submission time Handle Problem Language Result Execution time Memory
859963 2023-10-11T08:57:43 Z aykhn Odd-even (IZhO11_oddeven) C++14
0 / 100
 1 ms 860 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

// author : aykhn

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;

#define pb push_back
#define ins insert
#define mpr make_pair
#define all(v) v.begin(), v.end()
#define bpc __builtin_popcount
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define int ll
#define infll 0x3F3F3F3F3F3F3F3F
#define inf 0x3F3F3F3F
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const int MXN = 1e6 + 5;
const int B = 800;

int n;
string s;
deque<char> dq[B];

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr);
    int n;
    cin >> n;
    int l = 1; 
    int r = 1e9;
    while (l < r)
    {
        int mid = (l + r) >> 1;
        if ((mid + 1) >= (2*n + mid - 1)/mid || mid * (mid + 1) / 2 >= n) r = mid;
        else l = mid + 1;
    }
    int x = l - 1;
    int y = n - 1;
    cout << (y - x) * 2 + x + 1 << '\n';
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 1 ms 860 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 1 ms 860 KB Output is correct
6 Correct 0 ms 860 KB Output is correct
7 Correct 0 ms 860 KB Output is correct
8 Correct 0 ms 860 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 0 ms 860 KB Output is correct
12 Correct 1 ms 860 KB Output is correct
13 Incorrect 1 ms 860 KB Output isn't correct
14 Halted 0 ms 0 KB -