oj.uz

Submission #685828

# Submission time Handle Problem Language Result Execution time Memory
685828 2023-01-25T01:49:27 Z QwertyPi Present (RMI21_present) C++14
8 / 100
 4000 ms 316 KB 
#include <bits/stdc++.h>

using namespace std;

int g[65][65];
int B = 1;
bool ok(uint64_t b){
    for(int i = 1; i < B; i++){
        for(int j = i; j < B; j++){
            if((b & (1ULL << i)) && (b & (1ULL << j)) && !(b & (1ULL << g[i][j]))) return false;
        }
    }
    return true;
}

void out(uint64_t b){
    vector<int> v;
    for(int i = 0; i < 64; i++){
        if(b & (1ULL << i)) v.push_back(i + 1);
    }
    cout << v.size() << ' ';
    for(auto i : v) cout << i << ' ';
    cout << endl;
}

int main(){
    for(int i = 1; i <= 64; i++) for(int j = 1; j <= 64; j++) g[i - 1][j - 1] = __gcd(i, j) - 1;
    int cnt = 0;

    /*
    for(int i = 0; ; i++){
        while(i >= (1ULL << B)) B++;
        if(ok(i)) { if(cnt % 1000000 == 0) cout << i << ' ' << cnt << endl; cnt++; }
    }
    */

    int L; cin >> L;
    for(int i = 0; i < L; i++){
        int x; cin >> x;
        B = 0;
        for(int i = 0; ; i++){
            while(i >= (1ULL << B)) B++;
            if(ok(i)) { if(x == 0) { out(i); break; } x--; }
        }
    }
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:42:21: warning: comparison of integer expressions of different signedness: 'int' and 'long long unsigned int' [-Wsign-compare]
   42 |             while(i >= (1ULL << B)) B++;
      |                   ~~^~~~~~~~~~~~~~
Main.cpp:28:9: warning: unused variable 'cnt' [-Wunused-variable]
   28 |     int cnt = 0;
      |         ^~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Execution timed out 4066 ms 292 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #3
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Execution timed out 4066 ms 292 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Execution timed out 4066 ms 292 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Execution timed out 4066 ms 292 KB Time limit exceeded
8 Halted 0 ms 0 KB -