Submission #977450

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
977450	2024-05-08T02:21:37 Z	shoryu386	Money (IZhO17_money)	C++17	0 / 100	20 ms	24152 KB

money

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

#define int long long

main(){ ios_base::sync_with_stdio(0); cin.tie(0);
	
	int n; cin >> n;
	//attempt greedy
	
	int arr[n]; for (int x = 0; x < n; x++) cin >> arr[x];
	
	vector<int> dc[1000007];
	for (int x = 0; x < n; x++){
		dc[arr[x]].push_back(x);
	}
	
	for (int x = 0; x < n; x++){
		
		}
	
	bitset<1000007> taken;
	
	set<int> valuesTaken;
	
	for (int zzz = 1; zzz <= n; zzz++){
		
		int smIndex = -1; 
		for (int x = 0; x < n; x++){
			if (!taken[x]){
				smIndex = x;
				break;
			}
		}
		
		int lastVal = arr[smIndex];
		taken[smIndex] = 1; vector<int> newval; newval.push_back(arr[smIndex]);
		for (int z = smIndex+1; z < n; z++){
			if (taken[z] || lastVal > arr[z]) break;
			
			bool die = false;
			for (auto y : valuesTaken){
				if (lastVal < y && y < arr[z]){
					die = true;
					break;
				}
			}
			if (die) break;
			
			taken[z] = 1;
			lastVal = arr[z];
			newval.push_back(arr[z]);
		} 
		
		for (auto y : newval){
			valuesTaken.insert(y);
		}
		
		bool allTaken = true;
		for (int x = 0; x < n; x++) if (!taken[x]) allTaken = false;
		
		if (allTaken){
			cout << zzz;
			return 0;
		}
	}
	
	
}

Compilation message

money.cpp:6:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
    6 | main(){ ios_base::sync_with_stdio(0); cin.tie(0);
      | ^~~~

Subtask #1

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	16 ms	23900 KB	Output is correct
2	Correct	15 ms	24152 KB	Output is correct
3	Correct	16 ms	23900 KB	Output is correct
4	Correct	20 ms	24052 KB	Output is correct
5	Correct	16 ms	24048 KB	Output is correct
6	Correct	15 ms	23900 KB	Output is correct
7	Correct	17 ms	23900 KB	Output is correct
8	Correct	19 ms	23900 KB	Output is correct
9	Correct	15 ms	23900 KB	Output is correct
10	Correct	15 ms	23896 KB	Output is correct
11	Correct	15 ms	23896 KB	Output is correct
12	Incorrect	14 ms	23900 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #2

0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	16 ms	23900 KB	Output is correct
2	Correct	15 ms	24152 KB	Output is correct
3	Correct	16 ms	23900 KB	Output is correct
4	Correct	20 ms	24052 KB	Output is correct
5	Correct	16 ms	24048 KB	Output is correct
6	Correct	15 ms	23900 KB	Output is correct
7	Correct	17 ms	23900 KB	Output is correct
8	Correct	19 ms	23900 KB	Output is correct
9	Correct	15 ms	23900 KB	Output is correct
10	Correct	15 ms	23896 KB	Output is correct
11	Correct	15 ms	23896 KB	Output is correct
12	Incorrect	14 ms	23900 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #3

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	16 ms	23900 KB	Output is correct
2	Correct	15 ms	24152 KB	Output is correct
3	Correct	16 ms	23900 KB	Output is correct
4	Correct	20 ms	24052 KB	Output is correct
5	Correct	16 ms	24048 KB	Output is correct
6	Correct	15 ms	23900 KB	Output is correct
7	Correct	17 ms	23900 KB	Output is correct
8	Correct	19 ms	23900 KB	Output is correct
9	Correct	15 ms	23900 KB	Output is correct
10	Correct	15 ms	23896 KB	Output is correct
11	Correct	15 ms	23896 KB	Output is correct
12	Incorrect	14 ms	23900 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #4

0 / 55.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	16 ms	23900 KB	Output is correct
2	Correct	15 ms	24152 KB	Output is correct
3	Correct	16 ms	23900 KB	Output is correct
4	Correct	20 ms	24052 KB	Output is correct
5	Correct	16 ms	24048 KB	Output is correct
6	Correct	15 ms	23900 KB	Output is correct
7	Correct	17 ms	23900 KB	Output is correct
8	Correct	19 ms	23900 KB	Output is correct
9	Correct	15 ms	23900 KB	Output is correct
10	Correct	15 ms	23896 KB	Output is correct
11	Correct	15 ms	23896 KB	Output is correct
12	Incorrect	14 ms	23900 KB	Output isn't correct
13	Halted	0 ms	0 KB	-