oj.uz

답안 #140374

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
140374 2019-08-02T16:41:18 Z SirCeness 팀들 (IOI15_teams) C++14
34 / 100
 4000 ms 46324 KB 
#include "teams.h"
#include <bits/stdc++.h>

#define pb push_back
#define mp make_pair
#define inside sl<=l&&r<=sr
#define outside r<sl||sr<l
#define orta ((l+r)>>1)
#define INF 1000000009
#define mod 1000000007
#define ppair(x); cerr << "(" << x.first << ", " << x.second << ")\n";
#define bas(x) #x << ": " << x << " "
#define prarr(x, n); cerr << #x << ": "; for(int qsd = 0; qsd < n; qsd++) cerr << x[qsd] << " "; cerr << "\n";
#define prarrv(x); cerr << #x << ": "; for(int qsd = 0; qsd < (int)x.size(); qsd++) cerr << x[qsd] << " "; cerr << "\n";
using namespace std;
typedef long long ll;

int n;
vector<list<int> > arr;

void init(int N, int A[], int B[]){
	n = N;
	arr.resize(n+1);
	for (int i = 0; i < n; i++){
		arr[A[i]].pb(B[i]);
	}
}

void prset(multiset<int> cur){
	for (int a: cur) cout << a << " "; cout << endl;
}

int can(int M, int K[]){
	multiset<int> cur;
	int ki = 0;
	sort(K, K+M);
	for (int i = 1; i <= n; i++){
		for (int a: arr[i]){
			cur.insert(a);
		}
		//prset(cur);
		while (ki != M && K[ki] == i){
			for (int q = 0; q < i; q++){
				if (cur.size() == 0) return 0;
				cur.erase(cur.begin());
			}
			ki++;
		}
		while (cur.size() > 0 && *cur.begin() <= i) cur.erase(cur.begin());
	}
	return 1;
}

Compilation message

teams.cpp: In function 'void prset(std::multiset<int>)':
teams.cpp:30:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  for (int a: cur) cout << a << " "; cout << endl;
  ^~~
teams.cpp:30:37: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  for (int a: cur) cout << a << " "; cout << endl;
                                     ^~~~

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 396 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 4 ms 376 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 2 ms 252 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 3 ms 376 KB Output is correct
21 Correct 2 ms 380 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 2 ms 256 KB Output is correct
24 Correct 2 ms 256 KB Output is correct
25 Correct 2 ms 256 KB Output is correct
26 Correct 2 ms 256 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 7128 KB Output is correct
2 Correct 22 ms 7672 KB Output is correct
3 Correct 77 ms 10104 KB Output is correct
4 Correct 26 ms 8300 KB Output is correct
5 Correct 31 ms 7416 KB Output is correct
6 Correct 34 ms 7672 KB Output is correct
7 Correct 19 ms 7416 KB Output is correct
8 Correct 17 ms 7416 KB Output is correct
9 Correct 46 ms 12280 KB Output is correct
10 Correct 44 ms 11896 KB Output is correct
11 Correct 43 ms 11892 KB Output is correct
12 Correct 37 ms 11640 KB Output is correct
13 Correct 40 ms 10232 KB Output is correct
14 Correct 54 ms 12024 KB Output is correct
15 Correct 69 ms 9720 KB Output is correct
16 Correct 21 ms 7800 KB Output is correct
17 Correct 33 ms 8696 KB Output is correct
18 Correct 37 ms 8952 KB Output is correct

Subtask #3
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 8312 KB Output is correct
2 Correct 31 ms 8600 KB Output is correct
3 Execution timed out 4089 ms 10408 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 205 ms 35060 KB Output is correct
2 Correct 195 ms 35576 KB Output is correct
3 Execution timed out 4033 ms 46324 KB Time limit exceeded
4 Halted 0 ms 0 KB -