# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
640837 | 2022-09-15T10:45:53 Z | Vladth11 | Floppy (RMI20_floppy) | C++14 | 98 ms | 18644 KB |
#include <bits/stdc++.h> #include "floppy.h" #define debug(x) cerr << #x << " " << x << "\n" #define debugs(x) cerr << #x << " " << x << " " using namespace std; typedef long long ll; typedef pair <int, int> pii; typedef pair <long double, pii> muchie; const ll NMAX = 200001; const ll VMAX = 101; const ll INF = 2e9; const ll MOD = 1000000007; const ll BLOCK = 447; const ll base = 117; const ll nr_of_bits = 17; const ll inv2 = 500000004; int stiva[NMAX]; vector <pii> events[NMAX]; std::vector<int> solve_queries(int subtask_id, int N, const std::string &bits, const std::vector<int> &a, const std::vector<int> &b) { vector <int> answers(a.size()); for(int i = 0; i < a.size(); i++){ events[b[i]].push_back({a[i], i}); } int j = 0, vf = 0; for(int i = 0; i < N; i++){ while(bits[j] == '0'){ vf--; j++; } stiva[++vf] = i; j++; for(auto x : events[i]){ int r = vf, pas = (1 << nr_of_bits); while(pas){ if(r - pas >= 1 && stiva[r - pas] >= x.first){ r -= pas; } pas /= 2; } answers[x.second] = stiva[r]; } } return answers; } void read_array(int subtask_id, const std::vector<int> &v) { stack <int> st; string s = ""; int i = 0; for(auto x : v){ while(st.size() && v[st.top()] < x){ s += '0'; st.pop(); } st.push(i); i++; s += '1'; } save_to_floppy(s); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 10012 KB | Output is correct |
2 | Correct | 7 ms | 10092 KB | Output is correct |
3 | Correct | 6 ms | 10012 KB | Output is correct |
4 | Correct | 6 ms | 10020 KB | Output is correct |
5 | Correct | 7 ms | 10148 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 27 ms | 12024 KB | Output is correct |
2 | Correct | 35 ms | 11980 KB | Output is correct |
3 | Correct | 27 ms | 12080 KB | Output is correct |
4 | Correct | 31 ms | 11940 KB | Output is correct |
5 | Correct | 27 ms | 12076 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 89 ms | 18644 KB | Output is correct |
2 | Correct | 96 ms | 18496 KB | Output is correct |
3 | Correct | 98 ms | 18200 KB | Output is correct |
4 | Correct | 92 ms | 18444 KB | Output is correct |
5 | Correct | 89 ms | 18528 KB | Output is correct |