oj.uz

답안 #629546

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
629546 2022-08-14T15:25:58 Z Elnady Vudu (COCI15_vudu) C++17
0 / 140
 153 ms 50800 KB 
#include <bits/stdc++.h>
#include <unordered_map>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;
#define     endl                '\n'
//#define     long long                 long long
#define     all(pr1)            pr1.begin(),pr1.end()
#define     alr(pr1)            pr1.rbegin(),pr1.rend()
#define     CEIL(pr1, pr2)      (pr1 + pr2 - 1) / pr2
#define     IOS                 std::ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define		RT(s)				return cout<<s,0
#define		sz(s)				(long long)(s.size())

const long long N = 1e6 + 9, M = 1e9 + 9, MOD = 1e9 + 7, OO = 0x3f3f3f3f, MAX = 2147483647, LOO = 0x3f3f3f3f3f3f3f3f;

int32_t main()
{
	IOS;
	long long n, x;
	cin >> n;
	vector<long long> a(N);
	unordered_map<long long, int> mp;
	for (int i = 0; i < n; i++)
		cin >> x;
	cin >> x;
	for (int i = 0; i < 1000000; i++)
		mp[i]++;

	/*for (auto ch : mp)
		b.push_back({ ch.first, ch.second });*/

	cout << 0 << "\n";
}

Subtask #1
0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 67 ms 50684 KB Output isn't correct
2 Incorrect 70 ms 50788 KB Output isn't correct
3 Incorrect 68 ms 50800 KB Output isn't correct
4 Incorrect 148 ms 50688 KB Output isn't correct
5 Incorrect 116 ms 50696 KB Output isn't correct
6 Incorrect 149 ms 50684 KB Output isn't correct
7 Incorrect 146 ms 50692 KB Output isn't correct
8 Incorrect 141 ms 50700 KB Output isn't correct
9 Incorrect 153 ms 50764 KB Output isn't correct
10 Incorrect 150 ms 50796 KB Output isn't correct