제출 #1355490

#제출 시각아이디문제언어결과실행 시간메모리
1355490m0rtu_us0512Snacks (NOI25_snacks)C++20
17 / 100
2094 ms6896 KiB
#include<bits/stdc++.h>
using namespace std;

int64_t N, Q;
vector<int64_t> A;
deque< tuple <int64_t, int64_t, int64_t> > query;
int64_t sum = 0;

int main(){
    cin >> N >> Q;

    A.assign( N , 0 );
    query.assign( Q , {0,0,0} );

    for( auto &a : A ){
        cin >> a;
        sum += a;
    }
    for( auto &[l,r,x] : query ){
        cin >> l >> r >> x;
    }

    cout << sum << endl;
    sort( A.begin() , A.end() );
    while( query.size() ){
        sum = 0;
        auto [l,r,x] = query[0] ;
        query.pop_front();

        for( int n = 0 ; n < N ; n++ ){
            if ( A[n] >= l and A[n] <= r ){
                A[n] = x;
            }
            sum += A[n];
            // cout << " " << A[n] << endl;
        }
        cout << sum << endl;
    }

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...