oj.uz

Submission #94463

# Submission time Handle Problem Language Result Execution time Memory
94463 2019-01-18T23:27:21 Z AntonioDaki Baloni (COCI15_baloni) C++14
40 / 100
 2000 ms 10872 KB 
#include<bits/stdc++.h>

using namespace std;

long long h[1000002];

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
    long long n, h1, x = 0;
    cin >> n;
    for(long long i = 0; i < n; ++i) cin >> h[i];
    for(long long i = 0; i < n; ++i){
        h1 = h[i];
        if(h1 != -1){
        	++x;
            for(long long j = 0; j < n; ++j){
                if(h1 == h[j]){
            	    h[j] = -1;
            	    --h1;
			    }
			    if(!h1) j = n;
		    }
		}
		if(*max_element(h, h + n) == -1){
		    cout << x;
		    return 0;
		}
	}

	return 0;
}

Subtask #1
40.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 6 ms 376 KB Output is correct
3 Correct 21 ms 376 KB Output is correct
4 Correct 29 ms 504 KB Output is correct
5 Execution timed out 2057 ms 10104 KB Time limit exceeded
6 Execution timed out 2062 ms 10872 KB Time limit exceeded
7 Execution timed out 2060 ms 8952 KB Time limit exceeded
8 Execution timed out 2073 ms 8824 KB Time limit exceeded
9 Execution timed out 2054 ms 9464 KB Time limit exceeded
10 Execution timed out 2070 ms 9684 KB Time limit exceeded