Submission #629445

#	Time	Username	Problem	Language	Result	Execution time	Memory
629445		Elnady	Vudu (COCI15_vudu)	C++17	0 / 140	369 ms	65536 KiB

vudu

#include <vector>
#include <deque>
#include <queue>
#include <array>
#include <set>
#include <string>
#include <iostream>
#include <map>
#include <algorithm>
#include <stack>
#include <iomanip>
#include <numeric>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <bitset>
#include <climits>
#include <unordered_set>
#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     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)				(int)(s.size())

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

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

	for (int i = 0; i < n; i++)
		mp[i] = 2;
	
	map<long long, long long>::iterator it;
	for (it = mp.begin(); it != mp.end(); it++)
	{
		b.push_back({ 0, 0 });
	}
	
	cout << 0 << "\n";
	return 0;
}

• Subtask 1: 0 / 140