oj.uz

Submission #198968

# Submission time Handle Problem Language Result Execution time Memory
198968 2020-01-28T13:02:03 Z virchau13 Spiderman (COCI20_spiderman) C++17
56 / 70
 890 ms 7432 KB 
#include <iostream>
#include <algorithm>
#include <set>
#include <deque>
using namespace std;

const int SIZE = 1000007;

bool v[1000007] = {};
int ans[1000007] = {};

int main(){
    int n, k;
    cin >> n >> k;
    int arr[n];
    for(int i = 0; i < n; i++){
        cin >> arr[i];
        v[arr[i]] = 1;
    }
    if(k > 0){
        for(int i = 0; i < n; i++){
            if(arr[i] > k) for(int j = k; j < SIZE; j += arr[i]) ans[j]++;
        }
    } else {
        for(int i = 0; i < n; i++){
            for(int j = 0; j < SIZE; j += arr[i]) ans[j]++;
        }
    }
    for(int i = 0; i < n; i++){
        cout << ans[arr[i]] << ' ';
    }
    cout << '\n';
}

Subtask #1
56.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 5112 KB Output is correct
2 Correct 16 ms 4984 KB Output is correct
3 Correct 394 ms 5880 KB Output is correct
4 Correct 890 ms 7432 KB Output is correct
5 Incorrect 82 ms 5880 KB Output isn't correct
6 Incorrect 252 ms 7288 KB Output isn't correct
7 Correct 82 ms 5880 KB Output is correct
8 Correct 88 ms 5752 KB Output is correct
9 Correct 240 ms 7160 KB Output is correct
10 Correct 230 ms 7160 KB Output is correct