oj.uz

Submission #149513

# Submission time Handle Problem Language Result Execution time Memory
149513 2019-09-01T06:39:01 Z 욱방켜!! (twitch.tv/wookje)(#3584, kig9981, cheetose, jh05013) King of Chairs (FXCUP4_chairs) C++17
95 / 100
 204 ms 15968 KB 
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };

ll SendInfo(Vi W, Vi C){
	int N=W.size();
	multiset<int> S;
	fup(i,0,N-1,1)
	{
		S.insert(-W[i]);
		C[i]*=-1;
	}
	sort(ALL(C));
	ll t=0;
	fup(i,0,N-1,1)
	{
		auto it=S.lower_bound(C[i]);
		if(it==S.end())return t;
		t++;
		S.erase(it);
	}
	return t;
}
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };

ll BB;
VPi CC;
set<Pi> S;
int mn;
void Init(ll B, Vi C)
{
	BB=B;
	int N=C.size();
	fup(i,0,N-1,1)
	{
		CC.pb(mp(C[i],i));
	}
	fup(i,0,N-1,1)CC[i].X*=-1;
	sort(ALL(CC));
	fup(i,0,BB-1,1)S.insert(mp(-CC[i].X,CC[i].Y));
}

int Maid(int W){
	auto it=S.lower_bound(mp(W,-1));
	if(it==S.end()) return -1;
	int ret=it->second;
	S.erase(it);
	return ret;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1044 KB Correct
2 Correct 10 ms 1048 KB Correct
3 Correct 11 ms 1044 KB Correct
4 Correct 10 ms 1048 KB Correct
5 Correct 10 ms 536 KB Correct

Subtask #2
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 8516 KB Correct
2 Correct 131 ms 14528 KB Correct
3 Correct 131 ms 14544 KB Correct
4 Correct 141 ms 15720 KB Correct
5 Correct 143 ms 15804 KB Correct
6 Correct 145 ms 15456 KB Correct
7 Correct 128 ms 14288 KB Correct

Subtask #3
40.0 / 45.0

# Verdict Execution time Memory Grader output
1 Partially correct 106 ms 8764 KB B = 50991
2 Partially correct 185 ms 14788 KB B = 91406
3 Partially correct 176 ms 14544 KB B = 49847
4 Partially correct 203 ms 15720 KB B = 99850
5 Partially correct 204 ms 15968 KB B = 99598
6 Partially correct 198 ms 15724 KB B = 99746
7 Partially correct 170 ms 14544 KB B = 49910
8 Correct 151 ms 14288 KB Correct