oj.uz

답안 #359244

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
359244 2021-01-26T13:29:10 Z AmineWeslati Exhibition (JOI19_ho_t2) C++14
100 / 100
 159 ms 6940 KB 
//Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 2e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up


template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}
#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin); 
    freopen("output.txt", "w", stdout);
#endif
}
/////////////////////////ONLY CLEAN CODES ALLOWED/////////////////////////

int N,M;
vi S,V,C;
vpi vec;

bool cmp(int i, int j){
	if(V[i]!=V[j]) return V[i] > V[j];
	return S[i] > S[j];
}

bool cmp2(int i, int j){
	return S[i] < S[j];
}

int main() {
    boost; IO();

    cin>>N>>M; 
    S.resize(N); V.resize(N); C.resize(M); 
    FOR(i,0,N) cin>>S[i]>>V[i];
    FOR(i,0,M) cin>>C[i];
    sort(all(C));
    
    vi vec;
    multiset<int,bool(*)(int,int)>s(cmp); 
    FOR(i,0,N){
    	vec.pb(i);
    	s.insert(i);
	}
	sort(all(vec),cmp2);

	int ans=0;
	ROF(i,0,M){
		while(sz(vec) && S[vec.back()]>C[i]){
			s.erase(vec.back());
			vec.pop_back();
		}
		if(!sz(s)) break;
		s.erase(s.begin());
		ans++;
	}
	cout << ans << endl;

    return 0;
}
//Change your approach

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 492 KB Output is correct
24 Correct 1 ms 492 KB Output is correct
25 Correct 1 ms 492 KB Output is correct
26 Correct 1 ms 492 KB Output is correct
27 Correct 1 ms 492 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 1 ms 492 KB Output is correct
31 Correct 1 ms 492 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 492 KB Output is correct
37 Correct 2 ms 492 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 492 KB Output is correct
24 Correct 1 ms 492 KB Output is correct
25 Correct 1 ms 492 KB Output is correct
26 Correct 1 ms 492 KB Output is correct
27 Correct 1 ms 492 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 1 ms 492 KB Output is correct
31 Correct 1 ms 492 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 492 KB Output is correct
37 Correct 2 ms 492 KB Output is correct
38 Correct 114 ms 6756 KB Output is correct
39 Correct 107 ms 6756 KB Output is correct
40 Correct 99 ms 6756 KB Output is correct
41 Correct 123 ms 6884 KB Output is correct
42 Correct 121 ms 6756 KB Output is correct
43 Correct 119 ms 6776 KB Output is correct
44 Correct 113 ms 6684 KB Output is correct
45 Correct 114 ms 6756 KB Output is correct
46 Correct 112 ms 6712 KB Output is correct
47 Correct 120 ms 6628 KB Output is correct
48 Correct 128 ms 6776 KB Output is correct
49 Correct 78 ms 4968 KB Output is correct
50 Correct 76 ms 4968 KB Output is correct
51 Correct 155 ms 6756 KB Output is correct
52 Correct 158 ms 6940 KB Output is correct
53 Correct 159 ms 6756 KB Output is correct
54 Correct 86 ms 6756 KB Output is correct
55 Correct 121 ms 6756 KB Output is correct
56 Correct 115 ms 6372 KB Output is correct
57 Correct 19 ms 876 KB Output is correct
58 Correct 99 ms 6372 KB Output is correct
59 Correct 136 ms 6372 KB Output is correct
60 Correct 20 ms 876 KB Output is correct
61 Correct 50 ms 3052 KB Output is correct
62 Correct 130 ms 6756 KB Output is correct
63 Correct 141 ms 6756 KB Output is correct
64 Correct 130 ms 6756 KB Output is correct
65 Correct 129 ms 6884 KB Output is correct
66 Correct 129 ms 6756 KB Output is correct
67 Correct 129 ms 6756 KB Output is correct
68 Correct 130 ms 6756 KB Output is correct
69 Correct 147 ms 6756 KB Output is correct
70 Correct 138 ms 6756 KB Output is correct
71 Correct 127 ms 6756 KB Output is correct
72 Correct 120 ms 6756 KB Output is correct
73 Correct 123 ms 6756 KB Output is correct