oj.uz

Submission #231405

# Submission time Handle Problem Language Result Execution time Memory
231405 2020-05-13T13:55:37 Z kym King of Chairs (FXCUP4_chairs) C++17
100 / 100
 147 ms 14696 KB 
#include "king.h"
#include <bits/stdc++.h>
using namespace std;
 
 
 
long long SendInfo(std::vector<int> W, std::vector<int> C) {
	return 0;
}

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
#define FOR(i,s,e) for(ll i = s; i <= (ll)e; ++i)
#define DEC(i,s,e) for(ll i = s; i >= (ll)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#define db(x) cerr << #x << "=" << x << "\n"
#define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n"
#define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n"
#define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n"
#define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{"  << ite.f << ',' << ite.s << "} "; cerr << "\n"
#define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n"
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define ll long long 
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define f first
#define s second
#define reach cerr << "LINE: " << __LINE__ << "\n";
typedef pair <ll, ll> pi;
typedef tuple<ll,ll,ll> ti3;
string cts(char x) {string t(1,x); return t;}
ll rand(ll a, ll b) { return a + rng() % (b-a+1); }
const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 500;
const long long oo = (ll)1e18 + 500;
template <typename T> void chmax(T& a, T b) { a = max(a, b); }
template <typename T> void chmin(T& a, T b) { a = min(a, b); }
const int MAXN = -1;
#ifndef LOCAL
#define cerr if(0)cout
#endif
#ifndef LOCAL
#include "vassal.h"
#endif
set<pi> v;
void Init(ll zero, vector<int> C){
	FOR(i,0,C.size()-1) {
		v.insert(pi(C[i],i));
	}
	return;
}

int Maid(int W){
	auto it = v.lower_bound(pi(W,-inf));
	if(it==v.end())return -1;
	v.erase(it);
	return it->s;
}



/* DEBUG
** Array bounds
** Overflow
** Edge cases
** do something instead of nothing
** write stuff down
*/

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 788 KB Correct
2 Correct 8 ms 780 KB Correct
3 Correct 10 ms 1020 KB Correct
4 Correct 9 ms 792 KB Correct
5 Correct 10 ms 904 KB Correct

Subtask #2
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 6468 KB Correct
2 Correct 107 ms 13332 KB Correct
3 Correct 112 ms 14696 KB Correct
4 Correct 114 ms 14328 KB Correct
5 Correct 117 ms 14532 KB Correct
6 Correct 114 ms 14640 KB Correct
7 Correct 111 ms 14524 KB Correct

Subtask #3
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 6712 KB Correct
2 Correct 134 ms 13336 KB Correct
3 Correct 136 ms 14516 KB Correct
4 Correct 147 ms 14524 KB Correct
5 Correct 147 ms 14520 KB Correct
6 Correct 146 ms 14524 KB Correct
7 Correct 126 ms 14524 KB Correct
8 Correct 121 ms 14532 KB Correct