oj.uz

답안 #496034

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
496034 2021-12-20T12:54:31 Z asandikci Sob (COCI19_sob) C++17
39 / 110
 69 ms 10000 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";
  if(log2(n)==ceil(log2(n))){
    int num;
    bitset<32> bt;
    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(num==n){num=0;}
      vec.push_back({num,i});
      // cout << num << "\n";
    }
    sort(vec.begin(),vec.end());
    for(auto it : vec){
      cout << it.first << " " << it.second << "\n";
    }
  }
  else if(log2(n+k)==ceil(log2(n+k))){
    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();
  }
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2124 KB Output is correct
2 Correct 1 ms 2124 KB Output is correct
3 Correct 1 ms 2124 KB Output is correct
4 Correct 67 ms 10000 KB Output is correct

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2372 KB Output is correct
2 Correct 1 ms 2252 KB Output is correct
3 Correct 1 ms 2252 KB Output is correct
4 Correct 1 ms 2124 KB Output is correct
5 Correct 1 ms 2252 KB Output is correct
6 Correct 69 ms 9956 KB Output is correct
7 Correct 38 ms 5936 KB Output is correct

Subtask #3
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2124 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2124 KB Output is correct
2 Correct 1 ms 2124 KB Output is correct
3 Correct 1 ms 2124 KB Output is correct
4 Correct 67 ms 10000 KB Output is correct
5 Correct 2 ms 2372 KB Output is correct
6 Correct 1 ms 2252 KB Output is correct
7 Correct 1 ms 2252 KB Output is correct
8 Correct 1 ms 2124 KB Output is correct
9 Correct 1 ms 2252 KB Output is correct
10 Correct 69 ms 9956 KB Output is correct
11 Correct 38 ms 5936 KB Output is correct
12 Incorrect 1 ms 2124 KB Unexpected end of file - int32 expected
13 Halted 0 ms 0 KB -