답안 #497800

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
497800	2021-12-23T21:06:22 Z	inksamurai	Sob (COCI19_sob)	C++17	110 / 110	80 ms	7160 KB

sob

#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define crep(i,x,n) for(int i=x;i<n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define vec(...) vector<__VA_ARGS__>
#define _32bB6rn ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
using pii=pair<int,int>;
using vi=vector<int>;

int main(){
_32bB6rn;
	int n,m;
	cin>>n>>m;
	vec(pii) pans;
	while(n){
		int i=n-1;
		int nej=0;
		rep(j,n){
			if((i&(j+m))==i){
				nej=j;
				break;
			}
		}
		drep(j,nej+1)
			printf("%d %d\n", n-(nej-j)-1,m+j);
		n-=(nej+1);
		m+=(nej+1);
	}
//	
	return 0;
}

Subtask #1

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	40 ms	3832 KB	Output is correct

Subtask #2

29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	40 ms	3756 KB	Output is correct
7	Correct	19 ms	1884 KB	Output is correct

Subtask #3

39.0 / 39.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct

Subtask #4

32.0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	40 ms	3832 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	40 ms	3756 KB	Output is correct
11	Correct	19 ms	1884 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	0 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	9 ms	1004 KB	Output is correct
20	Correct	31 ms	2884 KB	Output is correct
21	Correct	2 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	43 ms	4052 KB	Output is correct
24	Correct	78 ms	7160 KB	Output is correct
25	Correct	80 ms	7000 KB	Output is correct