# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
496033 |
2021-12-20T12:51:23 Z |
asandikci |
Sob (COCI19_sob) |
C++17 |
|
70 ms |
10012 KB |
#include"iostream"
#include"vector"
// #include"queue"
// #include"deque"
// #include"set"
// #include"map"
#include"algorithm"
// #include"iomanip"
#include"cstring"
#include"cmath"
#include"bitset"
#define int long long
using namespace std;
const int maxn=2*1e6+5;
void solve(){
int n,k;
cin >> n >> k;
int til = ceil(log2(n)); //+1 maybe
// cout << til << "\n";
int num;
bitset<32> bt;
bool isactive[maxn];
vector<pair<int,int>> vec;
for(int i=k;i<k+n;i++){
bt = i;
num=0;
for(int j=0;j<til;j++){
if(bt[j]==1){
num+=(1<<j);
if(isactive[num]==0){
isactive[num]=1;
break;
}
}
}
if(num==n){num=0;til--;}
vec.push_back({num,i});
// cout << num << "\n";
}
sort(vec.begin(),vec.end());
for(auto it : vec){
cout << it.first << " " << it.second << "\n";
}
}
signed main(){
// ios::sync_with_stdio(false); cin.tie(0);
// freopen("","r",stdin);freopen("","w",stdout);
int t=1;
// cin >> t;
for(int i=1;i<=t;i++){
// cout << "Case " << i << ":\n";
solve();
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
2124 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
2380 KB |
Output is correct |
2 |
Correct |
1 ms |
2256 KB |
Output is correct |
3 |
Correct |
1 ms |
2256 KB |
Output is correct |
4 |
Correct |
2 ms |
2128 KB |
Output is correct |
5 |
Correct |
2 ms |
2248 KB |
Output is correct |
6 |
Correct |
70 ms |
10012 KB |
Output is correct |
7 |
Correct |
38 ms |
5940 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
2124 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
2124 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |