# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
497252 |
2021-12-22T20:54:26 Z |
inksamurai |
Sob (COCI19_sob) |
C++17 |
|
1000 ms |
4736 KB |
#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;
vi a,b;
rep(i,n){
a.pb(i);
b.pb(i+m);
}
auto affine=[&](vi a,vi b)->bool{
bool pok=1;
rep(i,n){
int x=a[i],y=b[i];
int z=x&y;
if(z!=x){
pok=0;
break;
}
}
return pok;
};
rep(_,n){
if(affine(a,b)){
rep(i,n){
cout<<a[i]<<" "<<b[i]<<"\n";
}
exit(0);
}
rotate(b.begin(),b.begin()+1,b.end());
}
//
return 0;
}
# |
Verdict |
Execution time |
Memory |
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 |
Execution timed out |
1090 ms |
4736 KB |
Time limit exceeded |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
288 KB |
Unexpected end of file - int32 expected |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
316 KB |
Output is correct |
2 |
Incorrect |
0 ms |
204 KB |
Unexpected end of file - int32 expected |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
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 |
Execution timed out |
1090 ms |
4736 KB |
Time limit exceeded |