oj.uz

답안 #629514

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
629514 2022-08-14T15:08:22 Z Elnady Vudu (COCI15_vudu) C++17
0 / 140
 168 ms 59084 KB 
#include <bits/stdc++.h>
#include <unordered_map>
 
using namespace std;
#define     endl                '\n'
//#define     int                 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;
	int n, x;
	cin >> n;
	vector<pair<int, int>> b;
	vector<int> xx;
	unordered_map<long long, int> mp;
	
	for (int i = 0; i < n; i++)
		cin >> x;
	cin >> x;
 
	for (int i = 0; i < 1000000; i++)
	{
		//xx.push_back(i);
		mp[i] = 2;
	}
 
	unordered_map<long long, int>::iterator it;
	for (it = mp.begin(); it != mp.end(); it++)
	{
		b.push_back({ 0, 0 });
	}
 
	cout << 0 << "\n";
	return 0;
}

Subtask #1
0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 86 ms 59000 KB Output isn't correct
2 Incorrect 79 ms 58916 KB Output isn't correct
3 Incorrect 77 ms 58940 KB Output isn't correct
4 Incorrect 159 ms 58872 KB Output isn't correct
5 Incorrect 132 ms 58952 KB Output isn't correct
6 Incorrect 165 ms 58980 KB Output isn't correct
7 Incorrect 153 ms 58952 KB Output isn't correct
8 Incorrect 143 ms 58980 KB Output isn't correct
9 Incorrect 168 ms 58976 KB Output isn't correct
10 Incorrect 151 ms 59084 KB Output isn't correct