oj.uz

답안 #721283

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
721283 2023-04-10T15:40:05 Z vjudge1 Uzastopni (COCI17_uzastopni) C++17
48 / 80
 60 ms 65536 KB 
#include <bits/stdc++.h>

using namespace std;

using ll = long long;

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);

    ll n; cin >> n;

    ll k = n/2+1;

    if(k > 7*1e7){
        return 0;
    }
    vector<ll> table;
    table.push_back(1);
    for(ll i = 2; i <= k; i++){
        if(table.back() == n){
           cout << 1 <<" "<< i-1 <<"\n";
        }
        table.push_back((i*(i+1))/2);
    }
    ll pos = upper_bound(table.begin(), table.end(), n) - table.begin();

    for(ll i = pos; i < table.size(); i++){
        if(binary_search(table.begin(), table.end(), table[i]-n)){
            cout << lower_bound(table.begin(), table.end(), table[i]-n)-table.begin()+2 <<" "<< i+1 <<"\n";
        }
    }


}

Compilation message

uzastopni.cpp: In function 'int main()':
uzastopni.cpp:28:23: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |     for(ll i = pos; i < table.size(); i++){
      |                     ~~^~~~~~~~~~~~~~

Subtask #1
48.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 3 ms 856 KB Output is correct
5 Correct 8 ms 1492 KB Output is correct
6 Correct 60 ms 8648 KB Output is correct
7 Runtime error 55 ms 65536 KB Execution killed with signal 9
8 Runtime error 53 ms 65536 KB Execution killed with signal 9
9 Incorrect 0 ms 212 KB Output isn't correct
10 Incorrect 0 ms 212 KB Output isn't correct