oj.uz

답안 #831751

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
831751 2023-08-20T13:14:57 Z Chal1shkan Sob (COCI19_sob) C++14
110 / 110
 61 ms 7164 KB 
# include <bits/stdc++.h>

# define pb push_back
# define ff first
# define ss second
# define nl'\n'
# define pii pair <int, int>
# define pll pair <ll, ll>

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
  
const ll maxn = 2e5 + 25;
const ll maxl = 18 + 0;
const ll inf = 2e9 + 0;
const ll mod = 998244353;

using namespace std;

void ma1n ()
{
	int n, m;
	cin >> n >> m;
	int i = n - 1, j = m;
	while (i >= 0)
	{
		int prev1 = i, prev2 = j;
		while (j < n + m)
		{
			if ((i & j) == i)
			{
				break;
			}
			++j;
		}
		int copy = j, copy1 = i;
		while (copy >= prev2)
		{
			cout << i << ' ' << copy << nl;
			--i, --copy;
		}
		j++;
	}
}

int main ()
{  
	ios::sync_with_stdio(false);
    cin.tie(0); 
	int zxc = 1;
//	cin >> zxc;
    while (zxc--)	
    {
        ma1n ();
    }
    return 0;
}

Compilation message

sob.cpp:6:10: warning: ISO C++11 requires whitespace after the macro name
    6 | # define nl'\n'
      |          ^~
sob.cpp: In function 'void ma1n()':
sob.cpp:28:7: warning: unused variable 'prev1' [-Wunused-variable]
   28 |   int prev1 = i, prev2 = j;
      |       ^~~~~
sob.cpp:37:17: warning: unused variable 'copy1' [-Wunused-variable]
   37 |   int copy = j, copy1 = i;
      |                 ^~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 33 ms 3768 KB Output is correct

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Correct 1 ms 368 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 33 ms 3756 KB Output is correct
7 Correct 15 ms 1868 KB Output is correct

Subtask #3
39.0 / 39.0

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

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 33 ms 3768 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 324 KB Output is correct
8 Correct 1 ms 368 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 33 ms 3756 KB Output is correct
11 Correct 15 ms 1868 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 7 ms 952 KB Output is correct
20 Correct 24 ms 2908 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 34 ms 4164 KB Output is correct
24 Correct 61 ms 7164 KB Output is correct
25 Correct 60 ms 7048 KB Output is correct