# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
857049 | 2023-10-05T10:16:58 Z | busamate | Floppy (RMI20_floppy) | C++14 | 59 ms | 7332 KB |
#include <stdlib.h> #include <string.h> #include <set> #include "floppy.h" using namespace std; void read_array(int subtask_id, const std::vector<int> &v) { int N = v.size(); string bits('0', 2 * N); int tart = 0; set<int> szet; szet.clear(); for (int i = 0; i < N; i++) { while (!szet.empty() && v[*szet.rbegin()] < v[i]) { //bits[tart++] = '1'; auto it = szet.end(); it--; szet.erase(it); } szet.insert(i); tart++; } save_to_floppy(bits); } std::vector<int> solve_queries(int subtask_id, int N, const std::string &bits, const std::vector<int> &aa, const std::vector<int> &bb) { int Q = aa.size(); std::vector<int> ans(Q); /*vector<int> kerd[40000]; for (int i = 0; i < N; i++) kerd[i].clear(); for (int i = 0; i < Q; i++) kerd[bb[i]].push_back(i); set<int> szet; szet.clear(); int tart = 0; for (int i = 0; i < N; i++) { while (bits[tart] == '1') { auto it = szet.end(); it--; szet.erase(it); tart++; } tart++; szet.insert(i); for (int j : kerd[i]) { ans[j] = (*szet.lower_bound(aa[j])); } }*/ return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 804 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 14 ms | 2336 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 59 ms | 7332 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |