oj.uz

답안 #433655

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
433655 2021-06-20T09:16:49 Z kiennguyen246 Progression (NOI20_progression) C++14
9 / 100
 194 ms 17648 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, a[maxn], Q;
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";
            }
        }
    }
}

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:68:10: warning: variable 'all_1_n' set but not used [-Wunused-but-set-variable]
   68 |     bool all_1_n = 1;
      |          ^~~~~~~
Progression.cpp:69:10: warning: variable 'no_change' set but not used [-Wunused-but-set-variable]
   69 |     bool no_change = 1;
      |          ^~~~~~~~~
Progression.cpp:62:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   62 |         freopen(TASK".INP", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 164 ms 15940 KB Output is correct
2 Correct 115 ms 9316 KB Output is correct
3 Correct 118 ms 9496 KB Output is correct
4 Correct 110 ms 9360 KB Output is correct
5 Correct 138 ms 9408 KB Output is correct
6 Correct 136 ms 9448 KB Output is correct
7 Correct 121 ms 9404 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 165 ms 15880 KB Output is correct
12 Correct 164 ms 15796 KB Output is correct
13 Correct 176 ms 16132 KB Output is correct
14 Correct 164 ms 16260 KB Output is correct
15 Correct 194 ms 16064 KB Output is correct
16 Correct 194 ms 15796 KB Output is correct
17 Correct 175 ms 15848 KB Output is correct
18 Correct 167 ms 15892 KB Output is correct

Subtask #2
0 / 15.0

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

Subtask #3
0 / 35.0

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

Subtask #4
0 / 11.0

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

Subtask #5
0 / 13.0

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

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 164 ms 15940 KB Output is correct
2 Correct 115 ms 9316 KB Output is correct
3 Correct 118 ms 9496 KB Output is correct
4 Correct 110 ms 9360 KB Output is correct
5 Correct 138 ms 9408 KB Output is correct
6 Correct 136 ms 9448 KB Output is correct
7 Correct 121 ms 9404 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 165 ms 15880 KB Output is correct
12 Correct 164 ms 15796 KB Output is correct
13 Correct 176 ms 16132 KB Output is correct
14 Correct 164 ms 16260 KB Output is correct
15 Correct 194 ms 16064 KB Output is correct
16 Correct 194 ms 15796 KB Output is correct
17 Correct 175 ms 15848 KB Output is correct
18 Correct 167 ms 15892 KB Output is correct
19 Incorrect 2 ms 332 KB Output isn't correct
20 Halted 0 ms 0 KB -