| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 629532 |
2022-08-14T15:19:25 Z |
Elnady |
Vudu (COCI15_vudu) |
C++17 |
|
3 ms |
4180 KB |
#include <bits/stdc++.h>
#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 long long 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 = 1e6 + 9, M = 1e9 + 9, MOD = 1e9 + 7, OO = 0x3f3f3f3f, MAX = 2147483647, LOO = 0x3f3f3f3f3f3f3f3f;
int32_t main()
{
IOS;
vector<int> a(N);
/*for (auto ch : mp)
b.push_back({ ch.first, ch.second });*/
cout << 0 << "\n";
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
3 ms |
4180 KB |
Output isn't correct |
| 2 |
Incorrect |
3 ms |
4180 KB |
Output isn't correct |
| 3 |
Incorrect |
3 ms |
4180 KB |
Output isn't correct |
| 4 |
Incorrect |
3 ms |
4180 KB |
Output isn't correct |
| 5 |
Incorrect |
3 ms |
4180 KB |
Output isn't correct |
| 6 |
Incorrect |
3 ms |
4180 KB |
Output isn't correct |
| 7 |
Incorrect |
2 ms |
4180 KB |
Output isn't correct |
| 8 |
Incorrect |
2 ms |
4180 KB |
Output isn't correct |
| 9 |
Incorrect |
2 ms |
4180 KB |
Output isn't correct |
| 10 |
Incorrect |
3 ms |
4180 KB |
Output isn't correct |
