oj.uz

답안 #975362

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
975362 2024-05-05T03:13:36 Z vjudge1 Fountain (eJOI20_fountain) C++17
30 / 100
 1500 ms 3664 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main(){
	int n, q; cin >> n >> q;
	int questions[n][2];  // n[0] = rating, n[1] = imple
	for(int i = 0 ; i < n ; i++) cin >> questions[i][0] >> questions[i][1];
	int ans[q];	
	
	for(int i = 0 ;i < q ; i++){
		int analysis = 0;
		int awal, imple; cin >> awal >> imple;
		for(int j = awal - 1 ; j < n ; j++){
			if(analysis < questions[j][0]){
				imple -= questions[j][1];
				analysis = questions[j][0];
				if(imple <= 0){
					ans[i] = j + 1;
					break;
				}
			}
		}
		if(imple > 0) ans[i] = 0;
	}
	
	for(int i = 0 ; i < q ; i++) cout << ans[i] << endl;
	
	return 0;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 452 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 4 ms 452 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 3 ms 348 KB Output is correct

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1524 ms 3664 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 452 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 4 ms 452 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Execution timed out 1524 ms 3664 KB Time limit exceeded
9 Halted 0 ms 0 KB -