oj.uz

Submission #98446

# Submission time Handle Problem Language Result Execution time Memory
98446 2019-02-23T17:30:59 Z Leonardo_Paes Zoltan (COCI16_zoltan) C++11
14 / 140
 138 ms 3064 KB 
#include <bits/stdc++.h>

using namespace std;

int vet[200100];

int power(int x, int y, int p){
    int res = 1;
    x = x % p;
    while (y > 0)
    {
        if (y & 1)
        res = (res*x) % p;
        y = y>>1;
        x = (x*x) % p;
    }
    return res;
}

int main(){

    int n;

    cin >> n;

    for(int i=1; i<=n; i++){
        cin >> vet[i];
    }

    sort(vet+1, vet+n+1);

    int resp=1, atual=1;

    int mod = 1e9 + 7;

    int length=0;
    for(int i=1; i<=n; i++){
        if(vet[i+1]==vet[i]){
            atual++;
        }
        else{
            length++;
        if(atual==1)atual=0;
            resp=(resp*power(2,atual,mod))%mod;
            atual=0;
        }
    }
    cout << length << " " << resp << endl;

    return 0;

}

Subtask #1
14.0 / 140.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Incorrect 2 ms 384 KB Output isn't correct
3 Incorrect 2 ms 384 KB Output isn't correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Incorrect 2 ms 256 KB Output isn't correct
7 Incorrect 3 ms 384 KB Output isn't correct
8 Incorrect 3 ms 384 KB Output isn't correct
9 Incorrect 3 ms 384 KB Output isn't correct
10 Incorrect 3 ms 256 KB Output isn't correct
11 Incorrect 81 ms 2152 KB Output isn't correct
12 Incorrect 85 ms 1912 KB Output isn't correct
13 Incorrect 74 ms 1776 KB Output isn't correct
14 Incorrect 113 ms 2184 KB Output isn't correct
15 Incorrect 101 ms 2688 KB Output isn't correct
16 Incorrect 138 ms 3064 KB Output isn't correct
17 Incorrect 93 ms 2296 KB Output isn't correct
18 Incorrect 111 ms 2408 KB Output isn't correct
19 Incorrect 84 ms 2296 KB Output isn't correct
20 Incorrect 98 ms 2340 KB Output isn't correct