oj.uz

Submission #770455

# Submission time Handle Problem Language Result Execution time Memory
770455 2023-07-01T08:54:08 Z mindiyak Teams (IOI15_teams) C++14
0 / 100
 94 ms 19100 KB 
#include "teams.h"
#include <vector>
#include <iostream>

using namespace std;

vector<int> arr(500001);

void init(int N, int A[], int B[]) {
	arr.clear();
	fill(arr.begin(), arr.end(), 0);
	for(int i = 0;i < N;i++){
		for(int j = A[i];j <= B[j];j++){
			arr[i] += 1;
		}
	}
	
	// for(int i = 0;i < 20;i++){
	// 	cout << arr[i] << " ";
	// }cout << endl;
}

int can(int M, int K[]) {
	vector<int> temp = arr;
	for(int i=0;i<M;i++){
		if(temp[K[i]] < K[i]){
			return 0;
		}
		temp[K[i]] -= K[i];
	}
	return 1;
}

Subtask #1
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 4 ms 4308 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 18 ms 7132 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Runtime error 18 ms 7244 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Runtime error 94 ms 19100 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -