oj.uz

답안 #711809

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
711809 2023-03-17T14:31:00 Z Thienu Progression (NOI20_progression) C++17
0 / 100
 3000 ms 5476 KB 
#include <bits/stdc++.h>

using namespace std;

#define u_map unordered_map
#define u_set unordered_set
#define u_multiset unordered_multiset

using ll = long long;
using vvi = vector<vector<int>>;
using vi = vector<int>;
using vvll = vector<vector<long long>>;
using vll = vector<long long>;
using vd = vector<double>;
using vvd = vector<vector<double>>;
using pii = pair<int, int>;
using vpii = vector<pair<int, int>>;

template<typename C> struct rge{C l, r;};
template<typename C> rge<C> range(C i, C j) { return rge<C>{i, j}; }
template<typename C> ostream& operator<<(ostream &os, rge<C> &r) { os << '{'; for(auto it = r.l; it != r.r; it++) os << "," + (it == r.l) << *it; os << '}'; return os; }
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '{' << p.first << "," << p.second << '}'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ","; return os << '}'; }
void dbg_out() { cerr << ']' << endl; }
template<typename A> void dbg_out(A H) { cerr << H; dbg_out(); }
template<typename A, typename B, typename... C> void dbg_out(A H, B G, C... T) { cerr << H << ","; dbg_out(G, T...); }
#ifdef DEBUG
#define debug(...) cerr << "[" << #__VA_ARGS__ << "] = [", dbg_out(__VA_ARGS__)
#else
#define debug(...)
#endif

void solve(){
    int n, q;
    cin >> n >> q;
    vll v(n);
    for(int i = 0; i < n; i++) cin >> v[i];
    while(q--){
        int t;
        cin >> t;
        if(t == 1){
            int l, r; ll s, c;
            cin >> l >> r >> s >> c;
            l--;
            ll add_by = s;
            for(int i = l; i < r; i++){
                v[i] += add_by;
                add_by += s;
            }
        }else if(t == 2){
            int l, r; ll s, c;
            cin >> l >> r >> s >> c;
            l--;
            ll add_by = s;
            for(int i = l; i < r; i++){
                v[i] = add_by;
                add_by += s;
            }
        }else{
            int l, r;
            cin >> l >> r;
            l--;
            int run = 0;
            ll last = -1e18;
            int ans = 0;
            for(int i = l; i+1 < r; i++){
                ll dif = v[i+1] - v[i];
                if(dif == last){
                    run++;
                    ans = max(ans, run);
                } else {
                    last = dif;
                    ans = max(ans, 1);
                    run = 1;
                }
            }
            cout << ans + 1 << endl;
        }
    }
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    solve();
    return 0;
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3028 ms 5476 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 519 ms 5400 KB Output is correct
2 Correct 431 ms 2508 KB Output is correct
3 Correct 405 ms 2488 KB Output is correct
4 Correct 408 ms 2584 KB Output is correct
5 Correct 418 ms 2596 KB Output is correct
6 Correct 412 ms 2676 KB Output is correct
7 Correct 406 ms 2580 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 3 ms 324 KB Output is correct
10 Correct 3 ms 212 KB Output is correct
11 Execution timed out 3048 ms 3984 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 367 ms 4072 KB Output is correct
2 Correct 223 ms 1628 KB Output is correct
3 Correct 191 ms 1620 KB Output is correct
4 Correct 194 ms 1620 KB Output is correct
5 Correct 208 ms 1544 KB Output is correct
6 Correct 188 ms 1580 KB Output is correct
7 Correct 197 ms 1608 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Execution timed out 3064 ms 4876 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 519 ms 5400 KB Output is correct
2 Correct 431 ms 2508 KB Output is correct
3 Correct 405 ms 2488 KB Output is correct
4 Correct 408 ms 2584 KB Output is correct
5 Correct 418 ms 2596 KB Output is correct
6 Correct 412 ms 2676 KB Output is correct
7 Correct 406 ms 2580 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 3 ms 324 KB Output is correct
10 Correct 3 ms 212 KB Output is correct
11 Execution timed out 3048 ms 3984 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3028 ms 5476 KB Time limit exceeded
2 Halted 0 ms 0 KB -