oj.uz

답안 #629563

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
629563 2022-08-14T15:33:20 Z Elnady Vudu (COCI15_vudu) C++17
0 / 140
 640 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<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);
	}
	/*for (auto ch : mp)
		b.push_back({ ch.first, ch.second });*/

	cout << 0 << "\n";
}

Subtask #1
0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 8404 KB Output isn't correct
2 Incorrect 5 ms 8364 KB Output isn't correct
3 Incorrect 6 ms 8404 KB Output isn't correct
4 Incorrect 636 ms 65536 KB Output isn't correct
5 Incorrect 260 ms 37052 KB Output isn't correct
6 Incorrect 612 ms 61768 KB Output isn't correct
7 Incorrect 587 ms 62916 KB Output isn't correct
8 Incorrect 562 ms 57852 KB Output isn't correct
9 Incorrect 640 ms 65536 KB Output isn't correct
10 Incorrect 567 ms 62372 KB Output isn't correct