oj.uz

Submission #646661

# Submission time Handle Problem Language Result Execution time Memory
646661 2022-09-30T11:31:58 Z ksu2009en Present (RMI21_present) C++14
8 / 100
 217 ms 39452 KB 
#pragma GCC optimize("O3")

#include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <bitset>
#include <cstring>
#define endl '\n'

#include <unordered_map>

using namespace std;
typedef long long ll;

ll used[10001];

ll step = 0;

bool check(vector<ll>a){
    step++;
    
    for(auto i: a){
        used[i] = step;
        
        for(auto j: a){
            if(used[__gcd(i, j)] != step)
                return false;
        }
    }
    return true;
}

int main(){
    vector<vector<ll>>d(1000009);
    
    int pos = 1;
    
    for(int num = 1; num <= 1000; num++){
        d[pos++] = {num};
        
        ll last = pos - 1;
        
        for(int j = 1; j < last; j++){
            d[pos] = d[j];
            d[pos].push_back(num);
            
            if(!check(d[pos]))
                continue;
            pos++;
            
            if(pos >= 100011)
                break;
        }
        if(pos >= 100011)
            break;
    }
    
    ll t;
    cin >> t;
    
    while(t--){
        ll n;
        cin >> n;
        
        cout << d[n].size() << ' ';
        for(auto i: d[n])
            cout << i << ' ';
        cout << endl;
    }
    
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 207 ms 39388 KB Output is correct
2 Correct 215 ms 39452 KB Output is correct
3 Correct 212 ms 39360 KB Output is correct
4 Correct 212 ms 39388 KB Output is correct
5 Correct 217 ms 39384 KB Output is correct
6 Correct 211 ms 39380 KB Output is correct

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 207 ms 39388 KB Output is correct
2 Correct 215 ms 39452 KB Output is correct
3 Correct 212 ms 39360 KB Output is correct
4 Correct 212 ms 39388 KB Output is correct
5 Correct 217 ms 39384 KB Output is correct
6 Correct 211 ms 39380 KB Output is correct
7 Incorrect 209 ms 39352 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 207 ms 39388 KB Output is correct
2 Correct 215 ms 39452 KB Output is correct
3 Correct 212 ms 39360 KB Output is correct
4 Correct 212 ms 39388 KB Output is correct
5 Correct 217 ms 39384 KB Output is correct
6 Correct 211 ms 39380 KB Output is correct
7 Incorrect 209 ms 39352 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 207 ms 39388 KB Output is correct
2 Correct 215 ms 39452 KB Output is correct
3 Correct 212 ms 39360 KB Output is correct
4 Correct 212 ms 39388 KB Output is correct
5 Correct 217 ms 39384 KB Output is correct
6 Correct 211 ms 39380 KB Output is correct
7 Incorrect 209 ms 39352 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 207 ms 39388 KB Output is correct
2 Correct 215 ms 39452 KB Output is correct
3 Correct 212 ms 39360 KB Output is correct
4 Correct 212 ms 39388 KB Output is correct
5 Correct 217 ms 39384 KB Output is correct
6 Correct 211 ms 39380 KB Output is correct
7 Incorrect 209 ms 39352 KB Output isn't correct
8 Halted 0 ms 0 KB -