oj.uz

답안 #638145

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
638145 2022-09-04T18:49:05 Z Mr_Ph Spiderman (COCI20_spiderman) C++14
56 / 70
 78 ms 10304 KB 
///Never gonna give you up.
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
typedef long long int lli;
typedef unsigned long long ull;
using namespace std;
using namespace __gnu_pbds;
template<class x>
using ordered_set = tree<x, null_type,less<x>, rb_tree_tag,tree_order_statistics_node_update>;
const ll mod=(ll)1e9+7;
const ll mod1=998244353;
///the defines :)
#define endl '\n'
#define vi vector<int>
#define vll vector<ll>
#define ent(arr) for(int i=0;i<arr.size();i++)cin>>arr[i];
#define all(arr) arr.begin(),arr.end()
#define allr(arr) arr.rbegin(),arr.rend()
#define sz size()
///the end of the defines ;)
void bla()
{
#ifndef ONLINE_JUDGE
    freopen("input.txt","r",stdin);
    freopen("notsus.txt","w",stdout);
#endif
}
ll power(ll x,ll y)
{
    if(y==0)
        return 1;
    if(y==1)
        return x%mod;
    ll r=power(x%mod,(y%mod)/2)%mod;
    if(y%2)
        return ((r%mod)*(r%mod)*(x%mod));
    else
        return ((r%mod)*(r%mod));
}
ll lcm(ll a,ll b)
{
    return max(a,b)/__gcd(a,b)*min(a,b);
}
void preprocess(){}
void solve()
{
    int n,k;
    cin>>n>>k;
    vi mp(1e6+2);
    vi arr(n);
    ent(arr);
    vi mp1(1e6+2);
    int x=*max_element(all(arr));
    for(int i=0;i<n;i++)mp[arr[i]]++;
    for(int i=k+1;i<=1e6;i++)
    {
      for(int j=k;j<=1e6;j+=i)
        mp1[j]+=mp[i];
    }
    for(int i=0;i<n;i++)
      cout<<mp1[arr[i]]<<" "; 
}
int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    preprocess();
    //bla();
    int t=1;
    //cin>>t;
    while(t--)
        solve();
}

Compilation message

spiderman.cpp: In function 'void solve()':
spiderman.cpp:18:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 | #define ent(arr) for(int i=0;i<arr.size();i++)cin>>arr[i];
      |                              ~^~~~~~~~~~~
spiderman.cpp:53:5: note: in expansion of macro 'ent'
   53 |     ent(arr);
      |     ^~~
spiderman.cpp:55:9: warning: unused variable 'x' [-Wunused-variable]
   55 |     int x=*max_element(all(arr));
      |         ^
spiderman.cpp: In function 'void bla()':
spiderman.cpp:26:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |     freopen("input.txt","r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
spiderman.cpp:27:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |     freopen("notsus.txt","w",stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
56.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 8176 KB Output is correct
2 Correct 19 ms 8168 KB Output is correct
3 Correct 36 ms 8860 KB Output is correct
4 Correct 76 ms 10304 KB Output is correct
5 Incorrect 45 ms 8680 KB Output isn't correct
6 Incorrect 64 ms 10192 KB Output isn't correct
7 Correct 31 ms 8728 KB Output is correct
8 Correct 32 ms 8676 KB Output is correct
9 Correct 67 ms 9964 KB Output is correct
10 Correct 78 ms 10012 KB Output is correct