# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
629504 | Elnady | Vudu (COCI15_vudu) | C++17 | 120 ms | 1348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
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;
map<long long, long long> mp;
for (int i = 0; i < n; i++)
cin >> x;
cin >> x;
for (int i = 0; i < 10000; 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;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |