oj.uz

답안 #228881

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
228881 2020-05-03T02:01:04 Z blacktulip Subway (info1cup19_subway) C++17
100 / 100
 16 ms 1652 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,b[li],a[li],k,flag,t,sira;
int cev;
string s;
vector<PII> v;

int main(void){
	scanf("%d",&n);
	v.pb(mp(0,-1));
	while(n>0){
		if(sira+1<=n){sira++;v.pb(mp(sira,sira-1));n-=sira;}
		else{sira++;v.pb(mp(sira,n-1));n=0;}
	}
	printf("%d\n",(int)v.size());
	for(int i=0;i<(int)v.size();i++){
		printf("%lld %lld\n",v[i].fi,v[i].se);
	}
	return 0;
}

Compilation message

subway.cpp: In function 'int main()':
subway.cpp:31:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 4 ms 256 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 4 ms 256 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 4 ms 256 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 4 ms 256 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 4 ms 256 KB Output is correct
11 Correct 7 ms 768 KB Output is correct
12 Correct 7 ms 768 KB Output is correct
13 Correct 7 ms 768 KB Output is correct
14 Correct 8 ms 672 KB Output is correct
15 Correct 7 ms 768 KB Output is correct
16 Correct 16 ms 1652 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 13 ms 1652 KB Output is correct
19 Correct 11 ms 1272 KB Output is correct
20 Correct 11 ms 1272 KB Output is correct