Submission #231401

#	Time	Username	Problem	Language	Result	Execution time	Memory
231401		kym	King of Chairs (FXCUP4_chairs)	C++17	0 / 100	61 ms	4640 KiB

king

#include "king.h"
#include <bits/stdc++.h>
using namespace std;
 
 
 
long long SendInfo(std::vector<int> W, std::vector<int> C) {
	return 0;
}

vassal

#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
vector<pi> v;
void Init(ll zero, vector<int> C){
	FOR(i,0,C.size()-1) {
		v.pb(pi(C[i],i));
	}
	reverse(all(v));
	return;
}

int Maid(int W){
	auto it = lower_bound(all(v),pi(W,-1));
	if(it==v.end())return -1;
	else return it->s;
}
//int main(){}


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

• Subtask 1: 0 / 17
• Subtask 2: 0 / 38
• Subtask 3: 0 / 45