#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> v;
typedef vector<v> vv;
typedef vector<vv> vvv;
typedef pair<ll,ll> p;
typedef vector<p> vp;
typedef vector<vp> vvp;
typedef vector<vvp> vvvp;
typedef pair<ll, p> tri;
typedef vector<tri> vtri;
typedef vector<vtri> vvtri;
typedef vector<vvtri> vvvtri;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
#define f first
#define s second
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()
const ll INF = 1e18;
const ll mod = 1e9 + 7;
int main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
cout << "YES\n1\n1\n";
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 3 |
Partially correct |
0 ms |
344 KB |
Failed to provide a successful strategy. |
| 4 |
Partially correct |
1 ms |
344 KB |
Failed to provide a successful strategy. |
| 5 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| 6 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 7 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 3 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 4 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 5 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 6 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| 7 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| 8 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 9 |
Partially correct |
0 ms |
344 KB |
Failed to provide a successful strategy. |
| 10 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 11 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 12 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| 13 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 14 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 15 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 16 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 17 |
Partially correct |
0 ms |
344 KB |
Failed to provide a successful strategy. |
| 18 |
Partially correct |
1 ms |
600 KB |
Failed to provide a successful strategy. |
| 19 |
Partially correct |
1 ms |
600 KB |
Failed to provide a successful strategy. |
| 20 |
Partially correct |
1 ms |
344 KB |
Failed to provide a successful strategy. |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 3 |
Partially correct |
0 ms |
344 KB |
Failed to provide a successful strategy. |
| 4 |
Partially correct |
1 ms |
344 KB |
Failed to provide a successful strategy. |
| 5 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| 6 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 7 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
