| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 151177 | dongwon0427 | King of Chairs (FXCUP4_chairs) | C++17 | 60 ms | 7224 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "king.h"
#include <bits/stdc++.h>
using namespace std;
long long SendInfo(std::vector<int> W, std::vector<int> C) {
int n = W.size();
sort(C.begin(), C.end());
sort(W.begin(), W.end());
int cidx = n-1;
long long ans = 0;
for(int i=n-1;i>=0;i--) {
if(C[cidx] >= W[i]) {
cidx--;
ans++;
}
}
return ans;
}
#include "vassal.h"
#include <bits/stdc++.h>
using namespace std;
int sz;
vector<pair<int,int>> C;
set<pair<int,int>> S;
void Init(long long B, std::vector<int> C2){
for(int i=0;i<C2.size();i++) {
C.push_back(pair<int,int>(C2[i],i));
}
sz = B;
sort(C.begin(), C.end());
for(int i=C.size()-1;i>=C.size()-sz;i--) {
S.insert(C[i]);
}
//cout<<sz;
// ToDo
}
int Maid(int W){
set<pair<int,int>>::iterator it = S.lower_bound(pair<int,int>(W,-1));
if(it == S.end()) {
return -1;
}
//cout<<W<<' '<<(*it).second<<'\n';
return (*it).second;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
