QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#519770#4362. Balanced DietPetroTarnavskyiWA 0ms3876kbC++23986b2024-08-15 01:26:452024-08-15 01:26:45

Judging History

This is the latest submission verdict.

  • [2024-08-15 01:26:45]
  • Judged
  • Verdict: WA
  • Time: 0ms
  • Memory: 3876kb
  • [2024-08-15 01:26:45]
  • Submitted

answer

#include <bits/stdc++.h>
using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int INF = 1e9 + 7;

int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);
	
	int n, k;
	cin >> n >> k;
	
	LL A = 0;
	VI a(n);
	FOR(i, 0, n)
	{
		cin >> a[i];
		A += a[i];
	}
	
	VI cnt(n);
	FOR(i, 0, k)
	{
		int x;
		cin >> x;
		cnt[x - 1]++;
	}
	VI when(n);
	FOR(i, 0, n)
	{
		//(cnt[i] + 1) * A / a[i] <= N
		when[i] = ((cnt[i] + 1) * A + a[i] - 1) / a[i];	
	}
	sort(ALL(when));
	int sz = k;
	FOR(i, 0, n)
	{
		if(when[i] <= sz)
		{
			cout << i - 1 << "\n";
			return 0;
		}
		sz++;
	}
	cout << "forever\n";


	
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3612kb

input:

6 5
2 1 6 3 5 3
1 2 5 3 5

output:

1

result:

ok single line: '1'

Test #2:

score: 0
Accepted
time: 0ms
memory: 3648kb

input:

6 4
2 1 6 3 5 3
1 2 5 3

output:

forever

result:

ok single line: 'forever'

Test #3:

score: 0
Accepted
time: 0ms
memory: 3536kb

input:

6 5
2 1 3 5 3 6
1 2 4 6 4

output:

1

result:

ok single line: '1'

Test #4:

score: 0
Accepted
time: 0ms
memory: 3580kb

input:

4 2
2 2 1 1
4 3

output:

0

result:

ok single line: '0'

Test #5:

score: 0
Accepted
time: 0ms
memory: 3840kb

input:

6 2
1 3 1 3 1 3
3 5

output:

1

result:

ok single line: '1'

Test #6:

score: 0
Accepted
time: 0ms
memory: 3576kb

input:

7 2
1 3 1 1 3 1 3
3 1

output:

forever

result:

ok single line: 'forever'

Test #7:

score: 0
Accepted
time: 0ms
memory: 3576kb

input:

5 4
1 7 3 1 7
5 2 1 4

output:

forever

result:

ok single line: 'forever'

Test #8:

score: 0
Accepted
time: 0ms
memory: 3876kb

input:

1 0
1


output:

forever

result:

ok single line: 'forever'

Test #9:

score: 0
Accepted
time: 0ms
memory: 3648kb

input:

10 0
1 1 1 1 1 1 1 1 1 1


output:

forever

result:

ok single line: 'forever'

Test #10:

score: 0
Accepted
time: 0ms
memory: 3872kb

input:

15 5
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
15 5 4 13 12

output:

forever

result:

ok single line: 'forever'

Test #11:

score: 0
Accepted
time: 0ms
memory: 3872kb

input:

21 100
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
18 9 13 15 14 4 10 8 2 1 12 21 20 19 3 11 6 16 7 5 17 18 9 13 15 14 4 10 8 2 1 12 21 20 19 3 11 6 16 7 5 17 18 9 13 15 14 4 10 8 2 1 12 21 20 19 3 11 6 16 7 5 17 18 9 13 15 14 4 10 8 2 1 12 21 20 19 3 11 6 16 7 5 17 18 9 13 15 14 4 10 8 2 1 12 21 20 1...

output:

forever

result:

ok single line: 'forever'

Test #12:

score: 0
Accepted
time: 0ms
memory: 3584kb

input:

11 121
1 1 1 1 1 1 1 1 1 1 1
1 10 5 8 9 2 3 4 7 6 11 1 10 5 8 9 2 3 4 7 6 11 1 10 5 8 9 2 3 4 7 6 11 1 10 5 8 9 2 3 4 7 6 11 1 10 5 8 9 2 3 4 7 6 11 1 10 5 8 9 2 3 4 7 6 11 1 10 5 8 9 2 3 4 7 6 11 1 10 5 8 9 2 3 4 7 6 11 1 10 5 8 9 2 3 4 7 6 11 1 10 5 8 9 2 3 4 7 6 11 1 10 5 8 9 2 3 4 7 6 11

output:

forever

result:

ok single line: 'forever'

Test #13:

score: 0
Accepted
time: 0ms
memory: 3576kb

input:

4 0
1 2 4 3


output:

forever

result:

ok single line: 'forever'

Test #14:

score: 0
Accepted
time: 0ms
memory: 3836kb

input:

5 6
7 1 5 1 1
3 1 1 3 1 4

output:

forever

result:

ok single line: 'forever'

Test #15:

score: 0
Accepted
time: 0ms
memory: 3608kb

input:

58 6
1 7 3 2 3 2 2 1 3 6 7 6 2 1 5 4 1 1 2 6 1 7 5 7 6 1 5 2 4 2 2 2 6 5 4 1 4 2 5 7 4 7 3 2 1 1 3 3 3 1 1 1 1 7 7 3 3 6
38 17 3 13 26 42

output:

forever

result:

ok single line: 'forever'

Test #16:

score: 0
Accepted
time: 0ms
memory: 3608kb

input:

48 12
1 1 7 4 2 2 2 5 2 7 4 6 5 6 6 6 5 7 5 6 5 7 1 7 1 1 6 6 7 2 5 2 3 1 6 6 4 3 1 2 3 7 2 5 4 6 4 5
10 42 24 22 3 18 28 11 33 27 25 21

output:

forever

result:

ok single line: 'forever'

Test #17:

score: 0
Accepted
time: 0ms
memory: 3648kb

input:

6 31
4 3 2 6 5 1
4 5 1 4 2 5 3 4 1 5 4 2 1 5 4 6 3 4 5 2 1 4 6 2 5 4 1 5 2 3 5

output:

0

result:

ok single line: '0'

Test #18:

score: 0
Accepted
time: 0ms
memory: 3576kb

input:

13 44
1 2 5 2 1 1 6 2 2 1 5 1 1
7 3 12 8 2 11 3 11 1 7 7 10 4 11 9 4 2 3 3 7 11 8 7 6 3 5 11 7 13 9 8 3 10 5 7 11 2 3 4 7 12 11 6 1

output:

0

result:

ok single line: '0'

Test #19:

score: 0
Accepted
time: 0ms
memory: 3804kb

input:

29 13
3 1 3 5 5 5 3 2 2 6 5 2 6 4 7 4 7 1 5 3 1 1 2 2 1 7 1 4 2
26 15 17 6 24 7 11 16 21 27 8 2 20

output:

forever

result:

ok single line: 'forever'

Test #20:

score: 0
Accepted
time: 0ms
memory: 3632kb

input:

6 5
1 1 3 1 3 1
5 3 6 5 3

output:

forever

result:

ok single line: 'forever'

Test #21:

score: 0
Accepted
time: 0ms
memory: 3876kb

input:

3 3
1 7 5
2 3 2

output:

forever

result:

ok single line: 'forever'

Test #22:

score: 0
Accepted
time: 0ms
memory: 3572kb

input:

6 62
10 4 1 1 10 24
6 5 1 6 6 5 6 1 6 2 6 5 1 6 6 5 6 1 6 2 6 5 1 6 4 6 5 1 6 6 5 6 1 6 2 6 5 1 6 6 5 1 3 6 2 6 5 6 1 6 5 4 6 1 6 5 6 1 6 3 6 5

output:

0

result:

ok single line: '0'

Test #23:

score: 0
Accepted
time: 0ms
memory: 3528kb

input:

7 10
1 1 2 1 1 1 3
2 6 1 7 3 7 5 7 4 3

output:

forever

result:

ok single line: 'forever'

Test #24:

score: 0
Accepted
time: 0ms
memory: 3572kb

input:

11 3
2 3 2 2 1 1 2 1 1 4 1
10 2 3

output:

forever

result:

ok single line: 'forever'

Test #25:

score: 0
Accepted
time: 0ms
memory: 3672kb

input:

29 24
2 1 2 4 1 1 1 1 1 2 1 3 1 3 1 4 3 1 1 1 1 1 1 2 5 1 1 1 2
25 4 16 17 12 14 1 10 24 3 11 25 20 23 6 7 13 21 28 5 8 22 17 4

output:

0

result:

ok single line: '0'

Test #26:

score: 0
Accepted
time: 0ms
memory: 3844kb

input:

22 68
2 3 1 1 1 3 1 5 3 3 2 1 1 6 3 3 1 4 2 3 1 3
14 8 18 10 16 15 6 9 14 20 2 22 8 18 11 19 1 14 10 16 15 8 6 9 20 2 14 22 18 11 5 8 12 17 4 14 10 16 15 18 6 19 8 7 14 9 20 21 2 1 3 13 22 14 2 13 15 20 5 4 8 17 19 6 21 9 18 7

output:

2

result:

ok single line: '2'

Test #27:

score: 0
Accepted
time: 0ms
memory: 3800kb

input:

2 1
1 99
1

output:

forever

result:

ok single line: 'forever'

Test #28:

score: 0
Accepted
time: 0ms
memory: 3876kb

input:

20 1
5 2 3 1 7 8 2 6 3 9 7 10 10 4 9 5 6 8 1 4
6

output:

forever

result:

ok single line: 'forever'

Test #29:

score: 0
Accepted
time: 0ms
memory: 3588kb

input:

10 31
1 2 4 3 4 2 5 1 3 5
10 7 5 3 4 9 10 7 5 3 6 2 10 7 4 9 5 3 10 7 4 9 5 3 10 7 6 2 1 8 10

output:

forever

result:

ok single line: 'forever'

Test #30:

score: 0
Accepted
time: 0ms
memory: 3844kb

input:

8 52
3 4 2 2 1 1 3 4
8 2 1 7 4 8 2 3 1 7 8 2 4 1 7 8 2 3 5 6 8 2 4 7 5 3 1 2 7 8 3 2 8 1 4 7 1 2 8 6 2 1 7 8 5 2 8 3 4 7 1 4

output:

forever

result:

ok single line: 'forever'

Test #31:

score: 0
Accepted
time: 0ms
memory: 3632kb

input:

10 22
1 2 2 2 1 2 1 1 1 2
2 6 10 9 3 1 8 4 5 4 3 10 6 2 7 2 1 5 6 8 9 4

output:

0

result:

ok single line: '0'

Test #32:

score: 0
Accepted
time: 0ms
memory: 3532kb

input:

12 60
1 2 2 2 1 2 2 2 2 2 2 2
10 3 11 4 9 7 2 12 6 8 5 10 3 11 4 9 7 2 12 6 8 1 10 3 11 4 9 7 2 12 6 5 8 6 12 2 3 9 7 4 10 11 8 1 9 11 3 6 4 10 8 5 12 2 7 8 12 10 2 11

output:

forever

result:

ok single line: 'forever'

Test #33:

score: 0
Accepted
time: 0ms
memory: 3636kb

input:

11 50
1 1 1 2 1 1 1 1 1 1 1
6 11 5 4 3 9 7 8 2 1 4 10 8 3 4 11 2 6 1 7 4 5 9 10 6 5 8 7 1 4 9 2 4 3 11 10 7 5 8 6 9 4 2 3 11 1 4 10 3 7

output:

forever

result:

ok single line: 'forever'

Test #34:

score: 0
Accepted
time: 0ms
memory: 3636kb

input:

1 0
100000


output:

forever

result:

ok single line: 'forever'

Test #35:

score: 0
Accepted
time: 0ms
memory: 3580kb

input:

1 1
100000
1

output:

forever

result:

ok single line: 'forever'

Test #36:

score: 0
Accepted
time: 0ms
memory: 3632kb

input:

1 500
100000
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1...

output:

forever

result:

ok single line: 'forever'

Test #37:

score: 0
Accepted
time: 0ms
memory: 3616kb

input:

26 2
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 1 2 2 2 1 2
21 25

output:

22

result:

ok single line: '22'

Test #38:

score: -100
Wrong Answer
time: 0ms
memory: 3800kb

input:

12 2
6 6 8 1 4 1 2 10 4 4 10 4
6 4

output:

forever

result:

wrong answer 1st lines differ - expected: '27', found: 'forever'