#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +1000500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e9)
#define el '\n'
#define pii pair <int, int>
#define err ld(1e-9)
#define last(x) x.back()
#define all(x) (x).begin(), (x).end()
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;
int main()
{
srand(time(0));
ios_base::sync_with_stdio(0);
iostream::sync_with_stdio(0);
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
// in("D:/cpp/2/output.txt");
// out("output.txt");
cout << "-1";
}
//
//00000
//00110
//00111
//00011
//00000
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
5 ms |
384 KB |
Integer -1 violates the range [0, 1000000000] |
2 |
Incorrect |
5 ms |
256 KB |
Integer -1 violates the range [0, 1000000000] |
3 |
Incorrect |
5 ms |
384 KB |
Integer -1 violates the range [0, 1000000000] |
4 |
Incorrect |
5 ms |
384 KB |
Integer -1 violates the range [0, 1000000000] |
5 |
Incorrect |
4 ms |
384 KB |
Integer -1 violates the range [0, 1000000000] |
6 |
Incorrect |
5 ms |
384 KB |
Integer -1 violates the range [0, 1000000000] |
7 |
Incorrect |
5 ms |
384 KB |
Integer -1 violates the range [0, 1000000000] |
8 |
Incorrect |
5 ms |
384 KB |
Integer -1 violates the range [0, 1000000000] |
9 |
Incorrect |
5 ms |
256 KB |
Integer -1 violates the range [0, 1000000000] |
10 |
Incorrect |
5 ms |
384 KB |
Integer -1 violates the range [0, 1000000000] |