oj.uz

Submission #40996

# Submission time Handle Problem Language Result Execution time Memory
40996 2018-02-10T23:26:30 Z yusufake Taxis (POI13_tak) C++
20 / 100
 222 ms 4596 KB 
#include<bits/stdc++.h>

using namespace std;

#define _   int v, int tl, int tr, int l, int r, int h
#define tm  (tl+tr >> 1)
#define sol v+v,tl,tm,l,r,h
#define sag v+v+1,tm+1,tr,l,r,h

#define mp make_pair
#define pb push_back
#define st first
#define nd second

typedef long long ll;
typedef pair < int , int > pp;

const int mod = 1e9 + 7;
const int N   = 5e5 + 5;

ll A[N],m,d,n,i,j,x;

void fail() { cout << 0; exit(0); }

int main(){
	cin >> m >> d >> n;
	for(i=1;i<=n;i++) scanf("%lld", &A[i]);
	sort(A+1 , A+n+1);
	reverse(A+1 , A+n+1);
    if(A[1] < m-d) fail();
	for(i=1;i<=n && A[i] >= m-d;i++){
        if(A[i] < d-x) fail();
		x += A[i] - max(0LL , d - x);
		if(x >= m) { cout << i; return 0; }	
    }
    
    i--;
	x = 0;
    m -= A[i];
	for(j=1;j<i;j++){
		x += A[j] - max(0LL , d - x);
	}
	for(j=i+1;j<=n;j++){
		if(A[j] < d-x) fail();
        x += A[j] - max(0LL , d - x);
        if(x >= m) { cout << j; return 0; }
	}
	
	cout << 0;	
	return 0;
}

Compilation message

tak.cpp: In function 'int main()':
tak.cpp:27:40: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(i=1;i<=n;i++) scanf("%lld", &A[i]);
                                        ^

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 248 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Incorrect 2 ms 424 KB Output isn't correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 568 KB Output is correct
2 Correct 2 ms 568 KB Output is correct
3 Correct 2 ms 568 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 568 KB Output is correct
2 Correct 2 ms 568 KB Output is correct
3 Incorrect 2 ms 580 KB Output isn't correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 580 KB Output is correct
2 Incorrect 3 ms 580 KB Output isn't correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 960 KB Output is correct
2 Correct 5 ms 960 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 1160 KB Output is correct
2 Incorrect 23 ms 1160 KB Output isn't correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 1516 KB Output is correct
2 Incorrect 73 ms 2248 KB Output isn't correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 109 ms 2956 KB Output is correct
2 Incorrect 117 ms 3180 KB Output isn't correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 169 ms 4596 KB Output is correct
2 Incorrect 147 ms 4596 KB Output isn't correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 4596 KB Output is correct
2 Incorrect 222 ms 4596 KB Output isn't correct