#include"bits/stdc++.h"
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class x>
using ordered_set = tree<x, null_type,less<x>, rb_tree_tag,tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long a[2000005],up[2000005];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
long long n,t;
cin>>n>>t;
for(int i=0;i<n;i++)
{
cin>>a[i]>>a[i];
}
cout<<"NO";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
340 KB |
Contestant did not find solution |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
340 KB |
Contestant did not find solution |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
340 KB |
Contestant did not find solution |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
ans=NO N=1934 |
2 |
Correct |
1 ms |
340 KB |
ans=NO N=1965 |
3 |
Incorrect |
1 ms |
340 KB |
Contestant did not find solution |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
340 KB |
Contestant did not find solution |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
852 KB |
ans=NO N=66151 |
2 |
Correct |
11 ms |
724 KB |
ans=NO N=64333 |
3 |
Incorrect |
10 ms |
800 KB |
Contestant did not find solution |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
ans=NO N=1934 |
2 |
Correct |
1 ms |
340 KB |
ans=NO N=1965 |
3 |
Incorrect |
1 ms |
340 KB |
Contestant did not find solution |
4 |
Halted |
0 ms |
0 KB |
- |