# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
629560 |
2022-08-14T15:32:39 Z |
Elnady |
Vudu (COCI15_vudu) |
C++17 |
|
442 ms |
65536 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;
int n;
long long m;
cin >> n;
vector<long long> a(N);
vector<pair<long long, int>> b;
unordered_map<long long, int> mp;
for (int i = 0; i < n; i++)
cin >> a[i];
cin >> m;
for (int i = 0; i < n; i++)
a[i] -= m;
for (int i = 1; i < n; i++)
a[i] += a[i - 1];
for (int i = 0; i < n; i++)
mp[a[i]]++;
unordered_map<long long, int>::iterator it;
for (it = mp.begin(); it != mp.end(); it++)
{
b.push_back({ 0, 0 });
}
/*for (auto ch : mp)
b.push_back({ ch.first, ch.second });*/
cout << 0 << "\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
8660 KB |
Output isn't correct |
2 |
Incorrect |
5 ms |
8532 KB |
Output isn't correct |
3 |
Incorrect |
5 ms |
8544 KB |
Output isn't correct |
4 |
Runtime error |
437 ms |
65536 KB |
Execution killed with signal 9 |
5 |
Incorrect |
288 ms |
51340 KB |
Output isn't correct |
6 |
Runtime error |
415 ms |
65536 KB |
Execution killed with signal 9 |
7 |
Runtime error |
422 ms |
65536 KB |
Execution killed with signal 9 |
8 |
Runtime error |
383 ms |
65536 KB |
Execution killed with signal 9 |
9 |
Runtime error |
442 ms |
65536 KB |
Execution killed with signal 9 |
10 |
Runtime error |
405 ms |
65536 KB |
Execution killed with signal 9 |