oj.uz

Submission #198966

# Submission time Handle Problem Language Result Execution time Memory
198966 2020-01-28T12:55:56 Z virchau13 Spiderman (COCI20_spiderman) C++17
56 / 70
 819 ms 7416 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;
    }
    for(int i = 0; i < n; i++){
        if(arr[i] > k) for(int j = k; 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 405 ms 5880 KB Output is correct
4 Correct 819 ms 7416 KB Output is correct
5 Incorrect 83 ms 5880 KB Output isn't correct
6 Incorrect 231 ms 7312 KB Output isn't correct
7 Correct 81 ms 5880 KB Output is correct
8 Correct 96 ms 5880 KB Output is correct
9 Correct 239 ms 7160 KB Output is correct
10 Correct 221 ms 7160 KB Output is correct