Submission #149401

#	Time	Username	Problem	Language	Result	Execution time	Memory
149401		usa1+samsung2 (#200)	King of Chairs (FXCUP4_chairs)	C++17	0 / 100	138 ms	39656 KiB

king

#include "king.h"
#include <algorithm>
#include <vector>
#include <utility>

using namespace std;

long long SendInfo(std::vector<int> W, std::vector<int> C) {
    return 0LL;
}

vassal

#include "vassal.h"
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <deque>
using namespace std;

//vector<pair<int,int>> C_rev;
//vector<pair<int,int>> C_;

map<int,deque<int>> s;
void Init(long long B, std::vector<int> C){
    for (int i = 0 ; i < (int)C.size();i++) {
        
        if(s.count(C[i]) == 0) {
            s[C[i]] = deque<int>();
        }
        s[C[i]].push_back(i);
    }
/*
    for(int i = 0 ; i < (int)C.size(); i++) {
        C_rev.emplace_back(C[i], i);
        C_.emplace_back(C[i], 0);
    }
    sort(C_.begin(), C_.end());
    sort(C_rev.begin(), C_rev.end());
    */
}

int Maid(int W){
    auto it = s.lower_bound(W);
    if(it!=s.end()) {
        if (!(it->second).empty()) {
            int x = (it->second).front();
            (it->second).pop_front();
            return x;
        }
    }
/*
    if (it == C_.end())
        it--;
    if(it!=C_.begin()){
        auto itt = it;
        itt--;
        if((itt->first) >= W && (itt->second)== 0) {
            it--;
        }
    }
    if ((it->first) >= W && (it->second) == 0) {
        int i = it-C_.begin();
        it->second = 1;
        return (C_rev[i].second);
    }
    */
    return -1;
}

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