Submission #629512

#TimeUsernameProblemLanguageResultExecution timeMemory
629512ElnadyVudu (COCI15_vudu)C++17
0 / 140
170 ms59000 KiB
#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<int, 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<int, int>::iterator it; for (it = mp.begin(); it != mp.end(); it++) { b.push_back({ 0, 0 }); } cout << 0 << "\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...