답안 #220257

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
220257 2020-04-07T12:50:50 Z Sho10 Subway (info1cup19_subway) C++14
93.0556 / 100
13 ms 1784 KB
/*
ID: Sho10
LANG: C++
*/
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long int
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define sz size
#define f first
#define s second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265359
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll n,a[205];
vector<pair<ll,ll>>v;
int32_t main(){
CODE_START;
cin>>n;
v.pb(mp(0,-1));
ll s1=1;
while(n>=1){
    ll val=sqrt(2*n);
    if(val*(val+1)/2>n){
        val--;
    }
    for(ll i=1;i<=val;i++)
    {
        if(i==1){
            v.pb(mp(s1,0));
        }else {
        v.pb(mp(s1,s1-1));
    }
    s1++;
}
n=n-val*(val+1)/2;
}
cout<<v.size()<<endl;
for(ll i=0;i<v.size();i++)
    cout<<v[i].f<<' '<<v[i].s<<endl;
}

Compilation message

subway.cpp: In function 'int32_t main()':
subway.cpp:48:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 for(ll i=0;i<v.size();i++)
            ~^~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Partially correct 6 ms 768 KB Partially correct
12 Partially correct 7 ms 768 KB Partially correct
13 Partially correct 6 ms 768 KB Partially correct
14 Partially correct 6 ms 768 KB Partially correct
15 Partially correct 7 ms 768 KB Partially correct
16 Partially correct 13 ms 1656 KB Partially correct
17 Partially correct 5 ms 384 KB Partially correct
18 Partially correct 13 ms 1784 KB Partially correct
19 Correct 11 ms 1404 KB Output is correct
20 Correct 10 ms 1276 KB Output is correct