| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 561890 | Joshi503 | 팀들 (IOI15_teams) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
// #include <teams.h>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = long double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
#define f first
#define s second
#define tcT template<class T
#define tcTU tcT, class U
tcT> using V = vector<T>;
tcT, size_t SZ > using AR = array<T, SZ>;
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pi>;
using vpl = V<pl>;
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sor(x) sort(all(x))
#define pb push_back
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = ((b)-1); i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
const ll MOD = 1e9 + 7;
const ll MX = 1e9;
const ll INF = 1e18;
const db PI = acos((db)-1);
const int ddef[4]{ 1,0,-1,0 }, dataq[4]{ 0,1,0,-1 };
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
void setIO(string name = "") {
ios_base::sync_with_stdio(0); cin.tie(0);
if (sz(name)) {
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
}
void _print(char i) { cerr << i; }
void _print(string i) { cerr << i; }
void _print(float i) { cerr << i; }
void _print(int i) { cerr << i; }
void _print(double i) { cerr << i; }
void _print() { cerr << "\n"; };
template<typename x, typename y> void _print(pair<x, y>& t) { cerr << "{";_print(t.first);cerr << ", ";_print(t.second);cerr << "},"; }
template<typename x> void _print(x& t) { cerr << "{"; for (int i = 0;i < (int)t.size();i++) { _print(t[i]); if (i < (int)t.size() - 1) cerr << ", "; } cerr << "}"; }
template<typename x, typename... y> void _print(x a, y... b) { _print(a);if (sizeof...(b)) cerr << ", ";_print(b...); }
#define dbg(x...) cerr<<"["<<#x<<"] = [";_print(x);cerr<<"]\n";
int n;
const int MXN = 500001;
vector<pi> alfa(MXN);
bool cmp(const pi& x, const pi& y){
return x.s < y.s;
}
void init(int N, int A[], int B[]) {
n = N;
F0R(i, n){
alfa[i].f = A[i];
}
F0R(i, n){
alfa[i].s = B[i];
}
sort(alfa.begin(), alfa.begin() + n, cmp);
F0R(i, n){
cout << alfa[i].f << " ";
}
cout << "\n";
F0R(i, n){
cout << alfa[i].s << " ";
}
cout << "\n";
}
int can(int M, int K[]) {
vi a(M);
multiset<int> k;
F0R(i, M){
a[i] = K[i];
}
sor(a);
F0R(i, M){
F0R(j, a[i]){
k.insert(a[i]);
}
}
for(auto it = k.begin(); it != k.end(); ++it){
cout << *it << " ";
}
cout << "\n";
F0R(i, n){
auto it1 = k.lower_bound(alfa[i].f);
auto it2 = k.upper_bound(alfa[i].f);
cout << (*it1) << " " << (*it2) << " " << alfa[i].f << "\n";
if(it1 == it2 || it1 == k.end()) continue;
cout << "aaa\n";
k.erase(*it1);
}
return sz(k) == 0;
}
int main(){
int N; cin >> N;
int A[N], B[N];
F0R(i, N) cin >> A[i];
F0R(i, N) cin >> B[i];
init(N, A, B);
int M; cin >> M;
int K[M];
F0R(i, M) cin >> K[i];
cout << can(M, K) << "\n";
return 0;
}