oj.uz

답안 #655132

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
655132 2022-11-03T08:16:27 Z snpmrnhlol Meteors (POI11_met) C++17
74 / 100
 1065 ms 50448 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll v[300000],v2[300000],l[300000],r[300000];
ll v3[300000],v4[300000],v5[300000];
vector <ll> v6[300000];
vector <ll> v7[300000];
class fenwick{
    ll fen[300001];
public:
    ll query(ll pos){
        pos++;
        ll r = 0;
        for(ll i = pos;i > 0;i-=(i&-i))r+=fen[i];
        //cout<<"query:"<<pos - 1<<",result:"<<r<<'\n';
        return r;
    }
    void add(ll pos,ll nr){
        //cout<<"added:"<<pos<<','<<nr<<'\n';
        pos++;
        for(ll i = pos;i <= 300000;i+=(i&-i))fen[i]+=nr;
    }
    void empt(){
        for(ll i = 0;i <= 300000;i++)fen[i] = 0;
        //cout<<"emptied\n";
    }
};
fenwick fen;
ll calc(int nr){
    ll r = 0;
    for(auto i:v7[nr]){
        //cout<<i<<' '<<fen.query(i)<<'\n';
        r+=fen.query(i);
    }
    return r;
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll n,m,i,q,j;
    cin>>n>>m;
    for(i = 0;i < m;i++)cin>>v[i],v[i]--,v7[v[i]].push_back(i);;
    for(i = 0;i < n;i++){
        cin>>v2[i];
    }
    cin>>q;
    for(i = 0;i < q;i++){
        cin>>v3[i]>>v4[i]>>v5[i];
        v3[i]--;
        v4[i]--;
    }
    for(i = 0;i < n;i++)l[i] = 0,r[i] = q;
    for(i = 0;i < 20;i++){
        for(j = 0;j < q;j++)v6[j].clear();
        fen.empt();
        for(j = 0;j < n;j++){
            if(l[j] != r[j]){
                v6[(l[j] + r[j])/2].push_back(j);
            }
        }
        ///simulate
        for(j = 0;j < q;j++){
            //cout<<"adding query:"<<j<<',';
            if(v3[j] <= v4[j]){
                fen.add(v3[j],v5[j]);
                fen.add(v4[j] + 1,-v5[j]);
            }else{
                swap(v3[j],v4[j]);
                fen.add(0,v5[j]);
                fen.add(v3[j] + 1,-v5[j]);
                fen.add(v4[j],v5[j]);
                swap(v3[j],v4[j]);
            }
            //cout<<'\n';
            for(auto p:v6[j]){
                //cout<<calc(p)<<' '<<j<<' '<<p<<'\n';
                if(calc(p) >= v2[p]){
                    r[p] = j;
                }else{
                    l[p] = j + 1;
                }
            }
        }
    }
    for(i = 0;i < n;i++){
        if(l[i] == q)cout<<"NIE";
        else cout<<l[i] + 1;
        cout<<'\n';
    }
    return 0;
}
/**
3 5
1 3 2 1 3
8 1 8
3
4 2 4
1 3 1
3 5 2
**/

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 16852 KB Output is correct
2 Correct 12 ms 16852 KB Output is correct
3 Correct 12 ms 16860 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 16848 KB Output is correct
2 Correct 13 ms 16868 KB Output is correct
3 Correct 12 ms 16996 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 108 ms 20100 KB Output is correct
2 Correct 172 ms 24264 KB Output is correct
3 Correct 122 ms 23080 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 143 ms 21492 KB Output is correct
2 Correct 142 ms 22316 KB Output is correct
3 Correct 178 ms 24728 KB Output is correct
4 Correct 37 ms 20684 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 128 ms 20544 KB Output is correct
2 Correct 208 ms 24704 KB Output is correct
3 Correct 129 ms 18612 KB Output is correct
4 Correct 127 ms 23760 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 158 ms 19152 KB Output is correct
2 Correct 159 ms 22344 KB Output is correct
3 Correct 100 ms 20496 KB Output is correct
4 Correct 162 ms 25864 KB Output is correct

Subtask #7
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1065 ms 50448 KB Output is correct
2 Incorrect 738 ms 36536 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1042 ms 48164 KB Output is correct
2 Incorrect 806 ms 35108 KB Output isn't correct
3 Halted 0 ms 0 KB -