Submission #1283635

#	Time	Username	Problem	Language	Result	Execution time	Memory
1283635		vahagng	Spiderman (COCI20_spiderman)	C++20	14 / 70	69 ms	19424 KiB

spiderman

//----------vahagng----------//
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;

// template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif

void print(long long t) { cerr << t; }
void print(int t) { cerr << t; }
void print(string t) { cerr << t; }
void print(char t) { cerr << t; }
void print(double t) { cerr << t; }
void print(long double t) { cerr << t; }
void print(unsigned long long t) { cerr << t; }

template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[], V n) { cerr << "["; for (int i = 0; i < n; i++) { cerr << v[i] << " "; } cerr << "]"; }
template <class T, class V> void print(pair <T, V> p) { cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}"; }
template <class T> void print(vector <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(set <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(multiset <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T, class V> void print(map <T, V> v) { cerr << "[ "; for (auto i : v) { print(i); cerr << " "; } cerr << "]"; }

#define ll long long
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define ld long double
#define sz(v) v.size()
#define endl '\n'

const ll inf = 2e18, mod = 1e9 + 7, mod2 = 998244353;

void SetIO(string str = "") {
    if (str != "") {
        freopen((str + ".in").c_str(), "r", stdin);
        freopen((str + ".out").c_str(), "w", stdout);
    }
    else {
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    }
}

void FastIO() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
}

const int N = 3e5 + 10, M = 1e6 + 10;

mt19937 rnd(chrono::system_clock::now().time_since_epoch().count());

ll binpow(ll a, ll b, ll m) {
    ll res = 1;
    while (b) {
        if (b & 1) {
            res = (res * a) % m;
        }
        b >>= 1;
        a = (a * a) % m;
    }
    return res;
}

const double eps = 1e-7;

ll n, k, a[N], cnt[M], ans[M];
bool ka[N];

//0 1 1 2 1 3 1 3 2 3 1 5 1 3 3 4 1 5 1 5 3 3 1 7 2 3 3 5 1 7 1 5 3 3 3 8 1 3 3 7 1

void solve(int tc) {
    cin >> n >> k;
    ll mx = 0, answ = 0;
    map<ll,ll>mp;
    for(int i = 1; i <= n; i++) { cin >> a[i]; cnt[a[i]]++; mx = max(mx, a[i]);}
    // dbg(mp);
    if(n <= 2000){
        for(int i = 1; i <= n; i++){
            answ = 0;
            for(int j = 1; j <= n; j++){
                if(i == j) continue;
                if(a[i]%a[j] == k){
                    answ++;
                }
            }
            cout << answ << ' ';
        }
        return;
    }
    ans[1] = (cnt[1] - 1);
    for(int i = 2; i <= mx; i++){
        ans[i] += cnt[1];
    }
    for(int i = 2; i <= mx; i++){
        cnt[i] += (cnt[i] - 1);
        for(int j = 2*i; j <= mx; j += i){
            ans[j] += cnt[i];
        }
    }
    // for(auto i : mp){
    //     for(auto j : mp){
    //         if(i == j && k == 0){
    //             ans[i.first] += i.second * (i.second - 1);
    //             continue;
    //         }
    //         if(i.first % j.first == k){
    //             ans[i.first] += j.second * i.second;
    //         }
    //     }
    // }
    for(int i = 1; i <= n ;i++){
        cout << ans[a[i]] << ' ';
    }
    cout << endl;
}


void precalc() {

}

int main() {
    // SetIO("teamwork");
    FastIO();
    int test_case = 1;
    // cin >> test_case;
    precalc();
    int cnt = 1;
    while (test_case--) {
        solve(cnt++);
    }
    return 0;
}

Compilation message (stderr)

spiderman.cpp: In function 'void SetIO(std::string)':
spiderman.cpp:47:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |         freopen((str + ".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
spiderman.cpp:48:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |         freopen((str + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
spiderman.cpp:51:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |         freopen("input.txt", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
spiderman.cpp:52:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |         freopen("output.txt", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 14 / 70