oj.uz

답안 #629524

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
629524 2022-08-14T15:15:05 Z Elnady Vudu (COCI15_vudu) C++17
0 / 140
 323 ms 63068 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 = 3e5 + 9, M = 1e9 + 9, MOD = 1e9 + 7, OO = 0x3f3f3f3f, MAX = 2147483647, LOO = 0x3f3f3f3f3f3f3f3f;

int32_t main()
{
	IOS;
	long long n, x;
	cin >> n;
	map<long long, int> mp;
	for (long long i = 0; i < n; i++)
		cin >> x;
	cin >> x;

	for (long long 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 242 ms 62872 KB Output isn't correct
2 Incorrect 239 ms 62900 KB Output isn't correct
3 Incorrect 247 ms 62952 KB Output isn't correct
4 Incorrect 323 ms 62904 KB Output isn't correct
5 Incorrect 290 ms 63068 KB Output isn't correct
6 Incorrect 308 ms 62888 KB Output isn't correct
7 Incorrect 313 ms 62928 KB Output isn't correct
8 Incorrect 296 ms 62992 KB Output isn't correct
9 Incorrect 318 ms 62844 KB Output isn't correct
10 Incorrect 312 ms 62904 KB Output isn't correct