oj.uz

Submission #149215

# Submission time Handle Problem Language Result Execution time Memory
149215 2019-09-01T05:58:59 Z usa1+samsung2(#3703, adman, nona1314, wowoto9772) King of Chairs (FXCUP4_chairs) C++17
0 / 100
 65 ms 4548 KB 
#include "king.h"
#include <algorithm>
#include <vector>
#include <utility>

using namespace std;

long long SendInfo(std::vector<int> W, std::vector<int> C) {
    /*
    long long ret = 0;
    vector<pair<int,int>> C_;
    for(const auto &i : C) {
        C_.emplace_back(i, 0);
    }
    for(const auto& w : W) {
        auto it = upper_bound(C_.begin(), C_.end(), pair<int,int>(w,0));
        if (it == C_.begin()) continue;
        it--;
        if ((it->first) >= w && (it->second) == 0) {
            it->second = 1;
            ret++;
        }
    }*/
    return 0;
}

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

using namespace std;

vector<pair<int,int>> C_rev;
vector<pair<int,int>> C_;
vector<bool> x;
void Init(long long B, std::vector<int> C){
    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 = upper_bound(C_.begin(), C_.end(), pair<int,int>(W,0));
    if (it!=C_.begin()) {
        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.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 1056 KB Wrong
2 Halted 0 ms 0 KB -

Subtask #2
0 / 38.0

# Verdict Execution time Memory Grader output
1 Incorrect 56 ms 4544 KB Wrong
2 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Incorrect 65 ms 4548 KB Wrong
2 Halted 0 ms 0 KB -