oj.uz

답안 #584474

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
584474 2022-06-27T12:38:26 Z FatihSolak OGLEDALA (COI15_ogledala) C++17
19 / 100
 2864 ms 404092 KB 
#include <bits/stdc++.h>
#define N 100005
#define K 105
using namespace std;
long long a[N],b[N];
long long len[N];
map<pair<long long,long long>,long long> rem;
long long val(long long curlen,long long target){
    if(curlen <= target)return curlen == target;
    if(rem.count({curlen,target}))
        return rem[{curlen,target}];
    return rem[{curlen,target}] = val((curlen-1)/2,target) + val(curlen/2,target);
    
}
long long get(long long st,long long curlen,long long target,long long idx){
    if(curlen == target)return st + (target - 1)/2;
    long long nwlen = (curlen - 1)/2;
    if(val(nwlen,target) >= idx){
        return get(st,nwlen,target,idx);
    }
    idx -= val(nwlen,target);
    nwlen = (curlen)/2;
    return get(st + (curlen + 1)/2,nwlen,target,idx);
}
vector<pair<long long,long long>> get_proper(vector<pair<long long,long long>> a){
    vector<pair<long long,long long>> ret;
    if(!is_sorted(a.begin(),a.end()))
        sort(a.begin(),a.end());
    for(int i = 0;i<a.size();i++){
        if(i + 1 != a.size() && a[i].first == a[i+1].first){
            a[i+1].second += a[i].second;
            continue;
        }
        ret.push_back(a[i]);
    }
    return ret;
}
vector<pair<long long,long long>> mp[N * K]; 
void solve(){
    long long m,n,q;
    cin >> m >> n >> q;
    for(int i = 1;i<=n;i++){
        cin >> a[i];
    }
    a[n+1] = m + 1;
    vector<long long> compress;
    for(int i = 0;i<=n;i++){
        len[i] = a[i+1] - a[i] - 1;
        vector<pair<long long,long long>> nums = {{len[i],1}};
        while(nums.back().first > 0){
            vector<pair<long long,long long>> nw;
            for(auto u:nums){ 
                compress.push_back({u.first});
                nw.push_back({(u.first-1)/2,u.second});
                nw.push_back({u.first/2,u.second});
            }
            nums = get_proper(nw);
        }
    }
    sort(compress.begin(),compress.end());
    compress.resize(unique(compress.begin(),compress.end()) - compress.begin());
    for(int i = 0;i<=n;i++){
        vector<pair<long long,long long>> nums = {{len[i],1}};
        while(nums.back().first > 0){
            vector<pair<long long,long long>> nw;
            for(auto u:nums){ 
                mp[lower_bound(compress.begin(),compress.end(),u.first) - compress.begin()].push_back({i,u.second});
                nw.push_back({(u.first-1)/2,u.second});
                nw.push_back({u.first/2,u.second});
            }
            nums = get_proper(nw);
        }
    }
    if(m > 1e10)return;
    for(int i = 0;i<compress.size();i++){
        mp[i] = get_proper(mp[i]);
        reverse(mp[i].begin(),mp[i].end());
    }
    int point = compress.size() -1;
    long long nowgo = n;
    for(int i = 1;i<=q;i++){
        cin >> b[i];
        if(b[i] <= n){
            cout << a[b[i]] << "\n";
            continue;
        }
        while(nowgo + mp[point].back().second < b[i]){
            nowgo += mp[point].back().second;
            mp[point].pop_back();
            if(mp[point].empty()){
                point--;
            }
        }   
        b[i] -= nowgo;
        cout << get( a[mp[point].back().first] + 1,len[mp[point].back().first],compress[point],b[i]) << "\n";
    }

}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    #ifdef Local
        freopen("in.txt","r",stdin);
        freopen("out.txt","w",stdout);
    #endif
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    #ifdef Local
        cout << endl << fixed << setprecision(2) << 1000.0*clock()/CLOCKS_PER_SEC << " milliseconds.";
    #endif
}

Compilation message

ogledala.cpp: In function 'std::vector<std::pair<long long int, long long int> > get_proper(std::vector<std::pair<long long int, long long int> >)':
ogledala.cpp:29:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |     for(int i = 0;i<a.size();i++){
      |                   ~^~~~~~~~~
ogledala.cpp:30:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |         if(i + 1 != a.size() && a[i].first == a[i+1].first){
      |            ~~~~~~^~~~~~~~~~~
ogledala.cpp: In function 'void solve()':
ogledala.cpp:75:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |     for(int i = 0;i<compress.size();i++){
      |                   ~^~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 128 ms 246940 KB Output is correct
2 Correct 113 ms 246932 KB Output is correct
3 Correct 144 ms 250088 KB Output is correct
4 Correct 141 ms 250316 KB Output is correct
5 Correct 194 ms 258600 KB Output is correct
6 Correct 203 ms 259980 KB Output is correct

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 125 ms 247744 KB Output is correct
2 Correct 127 ms 247892 KB Output is correct
3 Incorrect 2864 ms 404092 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 59.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2045 ms 359212 KB Output is correct
2 Correct 2177 ms 362848 KB Output is correct
3 Incorrect 2401 ms 379192 KB Output isn't correct
4 Halted 0 ms 0 KB -