oj.uz

답안 #249492

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
249492 2020-07-15T06:54:05 Z Vimmer Uzastopni (COCI17_uzastopni) C++14
48 / 80
 1000 ms 504 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define pf push_front
#define N 100010
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 6> a6;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

int main()
{
    //freopen("input.txt", "r", stdin); freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    ll n;

    cin >> n;

    ll sg = sqrt(n);

    for (ll i = 2; i <= 5 * sg; i++)
     for (ll start = max(1ll, n / i - 100); start <= min(n, n / i + 100); start++)
     {
         ll l = 2, r = n;

         while (l < r)
         {
             ll md = (l + r) / 2;

             if (start * md + (md * (md - 1)) / 2 < n) l = md + 1; else r = md;
         }

         if (l == 1) continue;

         if (start * l + (l * (l - 1)) / 2 == n) cout << start << " " << start + l - 1 << '\n';
     }
}

Subtask #1
48.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 20 ms 384 KB Output is correct
5 Correct 26 ms 384 KB Output is correct
6 Correct 96 ms 384 KB Output is correct
7 Incorrect 233 ms 384 KB Output isn't correct
8 Incorrect 919 ms 504 KB Output isn't correct
9 Execution timed out 1091 ms 256 KB Time limit exceeded
10 Execution timed out 1095 ms 384 KB Time limit exceeded