oj.uz

Submission #516025

# Submission time Handle Problem Language Result Execution time Memory
516025 2022-01-20T10:08:23 Z Theo830 Subway (info1cup19_subway) C++17
0 / 100
 1 ms 296 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ll,ii>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
int main(void){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll k;
    cin>>k;
    if(k == 0){
        cout<<"1\n";
        cout<<"0 -1\n";
    }
    else{
        ll ans = k + 1;
        f(i,1,(ll)1e5){
            ll siz = i * (i + 1) / 2;
            if(siz <= k){
                ans = min(ans,i + 1 + (k - siz) / i + ((k - siz) % i != 0));
            }
        }
        cout<<ans<<"\n";
        if(ans == k+1){
            cout<<0<<" "<<-1<<"\n";
            f(i,1,k+1){
                cout<<i<<" "<<0<<"\n";
            }
            return 0;
        }
        f(i,1,(ll)1e5){
            ll siz = i * (i + 1) / 2;
            if(ans == (i + 1 + (k - siz) / i + ((k - siz) % i != 0))){
                f(j,0,i+1){
                    cout<<j<<" "<<j-1<<"\n";
                }
                ll posoi = (k - siz) / i;
                ll cur = i+1;
                while(posoi--){
                    cout<<cur<<" "<<i<<"\n";
                    cur++;
                }
                if((k - siz) % i != 0){
                    cout<<cur<<" "<<(((k - siz) % i) - 1)<<"\n";
                }
                return 0;
            }
        }
    }
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 296 KB Output is correct
3 Incorrect 1 ms 204 KB wrong number of pairs
4 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 296 KB Output is correct
3 Incorrect 1 ms 204 KB wrong number of pairs
4 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 296 KB Output is correct
3 Incorrect 1 ms 204 KB wrong number of pairs
4 Halted 0 ms 0 KB -