oj.uz

답안 #437752

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
437752 2021-06-27T02:54:37 Z kiennguyen246 Progression (NOI20_progression) C++14
9 / 100
 198 ms 18000 KB 
/**
 * \author Nguyen Duc Kien
 * \date 20/06/2021
 */

///Task name
#define TASK ""

///-------------------------------------------///

#include <bits/stdc++.h>

using namespace std;

const int maxn = 3e5 + 5;

int n, Q;
long long a[maxn];
struct query
{
    int req, L, R, S, C;

    void inp()
    {
        cin >> req >> L >> R;
        if (req != 3) cin >> S >> C;
    }

}q[maxn];

namespace Sub1
{
    void Main()
    {
        int res = 1;
        int d = 2;
        a[n + 1] = 1e9 + 69;
        for (int i = 2; i <= n; i ++)
        {
            if (a[i + 1] - a[i] == a[i] - a[i - 1]) d ++;
            else res = max(res, d), d = 2;
        }
        bool f2 = 0;
        for (int i = 1; i <= Q; i ++)
        {
            if (q[i].req == 2) f2 = 1;
            else if (q[i].req == 3)
            {
                if (f2 == 0) cout << res << "\n";
                else cout << n << "\n";
            }
        }
    }
}

namespace Sub2
{
    void Main()
    {
        for (int t = 1; t <= Q; t ++)
        {
            int L = q[t].L;
            int R = q[t].R;
            int S = q[t].S;
            int C = q[t].C;
            if (q[t].req == 1)
            {
                for (int i = L; i <= R; i ++)
                    a[i] = a[i] + S + 1ll * (i - L) * C;
            }
            else if (q[t].req == 2)
            {
                for (int i = L; i <= R; i ++)
                    a[i] = S + 1ll * (i - L) * C;
            }
            else
            {
                int res = 1, cur = 2;
                long long d = a[L + 1] - a[L];
                for (int i = L + 1; i < R; i ++)
                {
                    if (a[i + 1] - a[i] == d) cur ++;
                    else
                    {
                        res = max(res, cur);
                        cur = 2;
                        d = a[i + 1] - a[i];
                    }
                }
                res = max(res, cur);
                if (L == R) res = 1;
                cout << res << "\n";

            }
        }
    }
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cerr << "Processing...\n\n";
    if (fopen(TASK".INP", "r"))
    {
        freopen(TASK".INP", "r", stdin);
//        freopen(TASK".OUT", "w", stdout);
    }

    cin >> n >> Q;
    for (int i = 1; i <= n; i ++) cin >> a[i];
    bool all_1_n = 1;
    bool no_change = 1;
    for (int i = 1; i <= Q; i ++)
    {
        q[i].inp();
        if (q[i].L != 1 || q[i].R != n) all_1_n = 0;
        if (q[i].req != 3) no_change = 0;
    }
    if (n <= 500) Sub2::Main();
    else if (all_1_n) Sub1::Main();
//    else if (no_change) Sub3::Main();
//    Sub1::Main();
    cerr << "\n\n-----------------\n";
    return 0;
}

Compilation message

Progression.cpp: In function 'int main()':
Progression.cpp:113:10: warning: variable 'no_change' set but not used [-Wunused-but-set-variable]
  113 |     bool no_change = 1;
      |          ^~~~~~~~~
Progression.cpp:106:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  106 |         freopen(TASK".INP", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 176 ms 17236 KB Output is correct
2 Correct 129 ms 9496 KB Output is correct
3 Correct 122 ms 9412 KB Output is correct
4 Correct 122 ms 9348 KB Output is correct
5 Correct 121 ms 9480 KB Output is correct
6 Correct 121 ms 9540 KB Output is correct
7 Correct 119 ms 9396 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 188 ms 17104 KB Output is correct
12 Correct 172 ms 16976 KB Output is correct
13 Correct 185 ms 17368 KB Output is correct
14 Correct 184 ms 17424 KB Output is correct
15 Correct 170 ms 17352 KB Output is correct
16 Correct 198 ms 17084 KB Output is correct
17 Correct 187 ms 17096 KB Output is correct
18 Correct 171 ms 16972 KB Output is correct

Subtask #2
0 / 15.0

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

Subtask #3
0 / 35.0

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

Subtask #4
0 / 11.0

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

Subtask #5
0 / 13.0

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

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 176 ms 17236 KB Output is correct
2 Correct 129 ms 9496 KB Output is correct
3 Correct 122 ms 9412 KB Output is correct
4 Correct 122 ms 9348 KB Output is correct
5 Correct 121 ms 9480 KB Output is correct
6 Correct 121 ms 9540 KB Output is correct
7 Correct 119 ms 9396 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 188 ms 17104 KB Output is correct
12 Correct 172 ms 16976 KB Output is correct
13 Correct 185 ms 17368 KB Output is correct
14 Correct 184 ms 17424 KB Output is correct
15 Correct 170 ms 17352 KB Output is correct
16 Correct 198 ms 17084 KB Output is correct
17 Correct 187 ms 17096 KB Output is correct
18 Correct 171 ms 16972 KB Output is correct
19 Incorrect 1 ms 332 KB Output isn't correct
20 Halted 0 ms 0 KB -