oj.uz

Submission #629427

# Submission time Handle Problem Language Result Execution time Memory
629427 2022-08-14T13:36:00 Z Elnady Vudu (COCI15_vudu) C++17
0 / 140
 105 ms 8148 KB 
#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, m;
	cin >> n;
	vector<int> a(n);
	map<int, int> mp;
	for (int i = 0; i < n; i++)
		cin >> a[i];
	cin >> m;


	/*for (int i = 0; i < n; i++)
		mp[a[i]]++;*/
	mp[0] = 4;
	/*for (auto ch : mp)
		b.push_back({ ch.first, ch.second });*/
	
	cout << 0 << "\n";
	return 0;
}

Subtask #1
0 / 140.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Incorrect 1 ms 340 KB Output isn't correct
4 Incorrect 86 ms 7764 KB Output isn't correct
5 Incorrect 58 ms 4564 KB Output isn't correct
6 Incorrect 83 ms 6996 KB Output isn't correct
7 Incorrect 105 ms 7252 KB Output isn't correct
8 Incorrect 68 ms 6356 KB Output isn't correct
9 Incorrect 95 ms 8148 KB Output isn't correct
10 Incorrect 84 ms 6996 KB Output isn't correct