oj.uz

답안 #329074

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
329074 2020-11-18T23:16:53 Z monus1042 Preokret (COCI18_preokret) C++17
6.8 / 50
 1 ms 492 KB 
// NK
#include <bits/stdc++.h>

//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
//using namespace __gnu_pbds;

typedef pair<int,int> ii;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ll> vll;
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define psf push_front
#define pof pop_front
#define mkp make_pair
#define mkt make_tuple
#define all(x) x.begin(), x.end()
#define Bolivia_is_nice ios::sync_with_stdio(false), cin.tie(nullptr)

//typedef tree<ii, null_type, less<ii>, rb_tree_tag, tree_order_statistics_node_update> ord_set;

void solve(){
	int tot = 4*12 * 60;
	int mid = tot/2;

	int n; cin >> n;
	map<int,int> data;
	for (int i=0; i<n; ++i){
		int x; cin >> x;
		data[x] = 1;
	}
	cin >> n;
	for (int i=0; i<n; ++i){
		int x; cin >> x;
		data[x] = 2;
	}

	int ans = 0, ho = 0;
	int a=0,b=0;
	for (auto i=data.begin(); i!= data.end(); i++){
		if (i->first <= mid) ++ans;
		if (i->second == 2){
			b++;
			if (b+1 == a) ho++;
		}else{
			a++;
			if (a+1 == b) ho++;
		}
	}
	cout << ans << '\n' << ho << '\n';
}

int main(){
	Bolivia_is_nice;
	int t = 1; //cin>>t;
	while(t--)
	solve();
	
	return 0;
}
/*
  ~/.emacs
*/

Subtask #1
6.8 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 364 KB Output is partially correct
2 Partially correct 1 ms 364 KB Output is partially correct
3 Partially correct 0 ms 364 KB Output is partially correct
4 Partially correct 1 ms 364 KB Output is partially correct
5 Partially correct 1 ms 364 KB Output is partially correct
6 Partially correct 1 ms 364 KB Output is partially correct
7 Partially correct 1 ms 364 KB Output is partially correct
8 Partially correct 1 ms 364 KB Output is partially correct
9 Partially correct 1 ms 492 KB Output is partially correct
10 Correct 1 ms 364 KB Output is correct