oj.uz

답안 #596645

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
596645 2022-07-14T23:22:28 Z definitelynotmee Floppy (RMI20_floppy) C++17
100 / 100
 92 ms 11396 KB 
#include <stdlib.h>
#include <string.h>

#include "floppy.h"
#include<bits/stdc++.h>
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
template<typename T>
using matrix = vector<vector<T>>;

void read_array(int subtask_id, const std::vector<int> &v) {
    int n = v.size();

    vector<int> jmp(n,-1);
    string bits;

    for(int i = 1; i < n; i++){
        jmp[i] = i-1;
        while(jmp[i]!=-1 && v[jmp[i]] < v[i])
            jmp[i] = jmp[jmp[i]], bits.push_back('0');
        bits.push_back('1');
    }

    save_to_floppy(bits);
}

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(b.size());
    
    vector<int> jmp(n+1);
    int ptr = 0;

    for(int i = 2; i <= n; i++){
        jmp[i] = i-1;
        while(true){
            if(bits[ptr++] == '0'){
                jmp[i] = jmp[jmp[i]];
            } else break;
        }
    }
    matrix<int> lift(20,vector<int>(n+1));
    for(int i = 0; i <= n; i++){
        lift[0][i] = jmp[i];
    }

    for(int i = 1; i < 20; i++){
        for(int j = 0; j <= n; j++){
            lift[i][j] = lift[i-1][lift[i-1][j]];
        }
    }
    for(int i = 0; i < a.size(); i++){
        int l = a[i]+1, r = b[i]+1;
        int id = r;
        for(int j = 19; j >= 0; j--){
            if(lift[j][id] >= l)
                id = lift[j][id];
        }
        answers[i] = id-1;
    }

    return answers;
}

Compilation message

floppy.cpp: In function 'std::vector<int> solve_queries(int, int, const string&, const std::vector<int>&, const std::vector<int>&)':
floppy.cpp:58:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |     for(int i = 0; i < a.size(); i++){
      |                    ~~^~~~~~~~~~
stub.cpp: In function 'void run2()':
stub.cpp:101:30: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  101 |     if (query_answers.size() != M) {
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 784 KB Output is correct
2 Correct 2 ms 784 KB Output is correct
3 Correct 2 ms 792 KB Output is correct
4 Correct 2 ms 784 KB Output is correct
5 Correct 2 ms 792 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 3136 KB Output is correct
2 Correct 24 ms 3220 KB Output is correct
3 Correct 20 ms 3112 KB Output is correct
4 Correct 20 ms 3240 KB Output is correct
5 Correct 20 ms 3212 KB Output is correct

Subtask #3
72.0 / 72.0

# 결과 실행 시간 메모리 Grader output
1 Correct 87 ms 11324 KB Output is correct
2 Correct 90 ms 11396 KB Output is correct
3 Correct 84 ms 11176 KB Output is correct
4 Correct 92 ms 11324 KB Output is correct
5 Correct 89 ms 11388 KB Output is correct