oj.uz

답안 #345650

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
345650 2021-01-07T18:43:42 Z Pichon5 Spiderman (COCI20_spiderman) C++17
49 / 70
 2000 ms 14912 KB 
#include<bits/stdc++.h>
#define lcm(a,b) (a/__gcd(a,b))*b
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define F first
#define S second
#define mp make_pair
//salida rapida "\n"
//DECIMALES fixed<<sp(n)<<x<<endl;
//gcd(a,b)= ax + by
//lCB x&-x
//set.erase(it) - ersases the element present at the required index//auto it = s.find(element)
//set.find(element) - iterator pointing to the given element if it is present else return pointer pointing to set.end()
//set.lower_bound(element) - iterator pointing to element greater than or equal to the given element
//set.upper_bound(element) - iterator pointing to element greater than the given element
// | ^
using namespace std;

int main()
{
    int n,k,x;
    cin>>n>>k;
    vi v;
    map<int,int>m;
    int mayores=0;
    for(int i=0;i<n;i++){
        cin>>x;
        if(x>k){
            mayores++;
            m[x]++;
        }
        v.pb(x);
    }
    vi res;
    for(int i=0;i<n;i++){
        int c=0;
        int num=v[i]-k;
        if(v[i]==k){
            res.pb(mayores);
            continue;
        }
        if(v[i]<k){
            res.pb(0);
            continue;
        }
        for(int l=1;l*l<=num;l++){
            if(num%l==0){
                c+=m[l];
                if(l!=(num/l)){
                    c+=m[num/l];
                }
            }
        }
        if(k==0){
            c--;
        }
        res.pb(c);
    }
    for(int i=0;i<n;i++){
        cout<<res[i]<<" ";
    }
    
    

    return 0;
}

Subtask #1
49.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 748 KB Output is correct
2 Correct 10 ms 620 KB Output is correct
3 Correct 453 ms 2276 KB Output is correct
4 Correct 1330 ms 6108 KB Output is correct
5 Correct 824 ms 8676 KB Output is correct
6 Execution timed out 2081 ms 10412 KB Time limit exceeded
7 Correct 932 ms 13084 KB Output is correct
8 Correct 944 ms 13156 KB Output is correct
9 Execution timed out 2080 ms 14820 KB Time limit exceeded
10 Execution timed out 2073 ms 14912 KB Time limit exceeded