97982024-03-06 23:58:07SleepyOverlordMaximális szorzat (50 pont)cpp17Időlimit túllépés 38/50600ms14924 KiB
#include <vector>
#include <string> 
#include <set> 
#include <map> 
#include <unordered_set>
#include <unordered_map>
#include <queue> 
#include <bitset> 
#include <stack>
#include <list>

#include <numeric> 
#include <algorithm> 
#include <random>
#include <chrono>

#include <cstdio>
#include <fstream>
#include <iostream> 
#include <sstream> 
#include <iomanip>
#include <climits>

#include <cctype>
#include <cmath> 
#include <ctime>
#include <cassert>

using namespace std;

#define ULL unsigned long long
#define LL long long
#define PII pair <int, int>
#define VB vector <bool>
#define VI vector <int>
#define VLL vector <LL>
#define VD vector <double>
#define VS vector <string>
#define VPII vector <pair <int, int> >
#define VVI vector < VI >
#define VVB vector < VB >
#define SI set < int >
#define USI unordered_set <int>
#define MII map <int, int>
#define UMII unordered_map <int, int>
#define MS multiset
#define US unordered_set
#define UM unordered_map
#define UMS unordered_multiset
#define UMM unordered_multimap

#define FORN(i, n) for(int i = 0; i < (n); ++i)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define MX(x, y) x = max(x, y);
#define MN(x, y) x = min(x, y);

#define SZ size()
#define BG begin() 
#define EN end() 
#define CL clear()
#define X first
#define Y second
#define RS resize
#define PB push_back
#define MP make_pair
#define ALL(x) x.begin(), x.end()
#define INS insert
#define ER erase
#define CNT count

template <class T> ostream& operator <<(ostream & os, const vector<T> &vec)
{
	for (int i = 0; i < vec.size() - 1; ++i) os << vec[i] << ' ';
	return os << vec[vec.size() - 1];
}

template <class T1, class T2> ostream& operator <<(ostream & os, const pair<T1, T2> &p)
{
	return os << p.X << " " << p.Y;
}

template <typename T>
void pr(T var1)
{
	cout << var1 << '\n';
}
template <typename T, typename... Types>
void pr(T var1, Types... var2)
{
	cout << var1;
	pr(var2...);
}

void in(int &n, VI &a) //array of ints
{
	cin >> n;
	a.CL, a.RS(n + 1);
	FOR(i, 1, n) cin >> a[i];
}

void in(int &n, VS &a) //array of strings
{
	cin >> n;
	a.CL, a.RS(n + 1);
	FOR(i, 1, n) cin >> a[i];
}

void in(int &n, VPII &a) //array of pairs
{
	cin >> n;
	a.CL, a.RS(n + 1);
	FOR(i, 1, n) cin >> a[i].X >> a[i].Y;
}

void in(int &n, int &m, VVI &g) //unweighted graph
{
	cin >> n >> m;
	g.CL, g.RS(n + 1);
	FOR(i, 1, n)
	{
		int x, y;
		cin >> x >> y;
		g[x].PB(y);
		g[y].PB(x);
	}
}

void in(int &n, VVI &g) //unweighted tree
{
	cin >> n;
	g.CL, g.RS(n + 1);
	FOR(i, 1, n - 1)
	{
		int x, y;
		cin >> x >> y;
		g[x].PB(y);
		g[y].PB(x);
	}
}

void in(int &n, int &m, vector <VPII> &g) //weighted graph
{
	cin >> n >> m;
	g.CL, g.RS(n + 1);
	FOR(i, 1, n)
	{
		int x, y, z;
		cin >> x >> y >> z;
		g[x].PB({y, z});
		g[y].PB({x, z});
	}
}

void in(int &n, vector <VPII> &g) //weighted tree
{
	cin >> n;
	g.CL, g.RS(n + 1);
	FOR(i, 1, n - 1)
	{
		int x, y, z;
		cin >> x >> y >> z;
		g[x].PB({y, z});
		g[y].PB({x, z});
	}
}

const int MOD = 1e9 + 7;

int n, m, k;
VI a;
multiset<int> neg, poz;

int main()
{
	#ifdef AT_HOME
	freopen("a.in", "r", stdin);
	freopen("a.out", "w", stdout);
	#endif

	ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);

	cin >> n >> m >> k;
	a.RS(n + 1);
	FOR(i, 1, n)
	{
		cin >> a[i];
		if (a[i] < 0) neg.INS(-a[i]);
		else poz.INS(a[i]);
	}
	while (neg.SZ > k)
	{
		int mn = *neg.begin();
		m -= mn;
		neg.erase(neg.begin());
		poz.INS(0);
	}
	while (m)
	{
		--m;
		int mn = *poz.begin();
		poz.ER(poz.begin());
		poz.INS(mn + 1);
	}
	int sol = 1;
	for (int x : neg) sol = (LL)sol * x % MOD;
	for (int x : poz) sol = (LL)sol * x % MOD;
	pr(sol);

	return 0;
}
RészfeladatÖsszpontTesztVerdiktIdőMemória
base38/50
1Elfogadva0/03ms1832 KiB
2Elfogadva0/03ms2060 KiB
3Elfogadva0/03ms2272 KiB
4Elfogadva0/03ms2440 KiB
5Elfogadva0/06ms3544 KiB
6Elfogadva2/23ms2756 KiB
7Elfogadva2/23ms2860 KiB
8Elfogadva2/23ms2848 KiB
9Elfogadva2/23ms2892 KiB
10Elfogadva2/28ms3988 KiB
11Elfogadva2/271ms13088 KiB
12Elfogadva1/171ms13200 KiB
13Elfogadva1/13ms3716 KiB
14Elfogadva1/110ms4836 KiB
15Időlimit túllépés0/1565ms5856 KiB
16Elfogadva1/152ms9364 KiB
17Időlimit túllépés0/1551ms6140 KiB
18Elfogadva1/119ms9440 KiB
19Időlimit túllépés0/1555ms8756 KiB
20Időlimit túllépés0/1569ms8928 KiB
21Időlimit túllépés0/1565ms8828 KiB
22Időlimit túllépés0/1514ms8944 KiB
23Elfogadva1/172ms14368 KiB
24Elfogadva1/170ms14252 KiB
25Elfogadva2/24ms4536 KiB
26Elfogadva2/27ms5660 KiB
27Időlimit túllépés0/2600ms6564 KiB
28Időlimit túllépés0/1573ms6504 KiB
29Hibás válasz0/248ms9760 KiB
30Elfogadva1/164ms14560 KiB
31Időlimit túllépés0/1547ms9044 KiB
32Elfogadva2/210ms4844 KiB
33Elfogadva2/265ms14668 KiB
34Elfogadva1/167ms14668 KiB
35Elfogadva2/265ms14668 KiB
36Elfogadva2/264ms14796 KiB
37Elfogadva2/264ms14924 KiB
38Elfogadva2/265ms14888 KiB
39Elfogadva1/110ms4968 KiB