oj.uz

답안 #98513

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
98513 2019-02-23T19:54:22 Z pamaj Zoltan (COCI16_zoltan) C++14
14 / 140
 529 ms 19832 KB 
#include <bits/stdc++.h>
using namespace std;

int v[200010];
int n;
map<int, int> mp;
set<int> st;
int main()
{

	cin >> n;

	for(int i = 0; i < n; i++)
	{
		cin >> v[i];
		mp[v[i]]++;
		st.insert(v[i]);
	}

	long long ans = 1;

	for(auto u : st)
	{
		if(mp[u] == 1) continue;
		ans *= pow(2, mp[u]);
		ans %= (1000000007);
	}

	cout << st.size() << " " << ans << "\n";
}

Subtask #1
14.0 / 140.0

# 결과 실행 시간 메모리 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 3 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Incorrect 2 ms 384 KB Output isn't correct
7 Incorrect 4 ms 384 KB Output isn't correct
8 Incorrect 3 ms 384 KB Output isn't correct
9 Incorrect 4 ms 384 KB Output isn't correct
10 Incorrect 4 ms 384 KB Output isn't correct
11 Incorrect 354 ms 15864 KB Output isn't correct
12 Incorrect 262 ms 13772 KB Output isn't correct
13 Incorrect 251 ms 12920 KB Output isn't correct
14 Incorrect 378 ms 13912 KB Output isn't correct
15 Incorrect 435 ms 17076 KB Output isn't correct
16 Incorrect 529 ms 19832 KB Output isn't correct
17 Incorrect 313 ms 16748 KB Output isn't correct
18 Incorrect 293 ms 16888 KB Output isn't correct
19 Incorrect 306 ms 16908 KB Output isn't correct
20 Incorrect 354 ms 16888 KB Output isn't correct