oj.uz

Submission #889423

# Submission time Handle Problem Language Result Execution time Memory
889423 2023-12-19T16:13:17 Z htphong0909 Global Warming (NOI13_gw) C++17
40 / 40
 250 ms 17144 KB 
#include<bits/stdc++.h>
using namespace std;

void File() {
#define file "test"
    freopen(file".in", "r", stdin);
    freopen(file".out", "w", stdout);
}

int arr[1000001];

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    vector <int> ed;
    //File();
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> arr[i];
        if (i > 1) ed.emplace_back(min(arr[i], arr[i - 1]));
    }
    sort(arr + 1, arr + 1 + n);
    sort(ed.begin(), ed.end());
    int p = 0;
    int ans = 0;
    for (int i = 0; i < n - 1; i++)
    {
        while (p + 1 < n && arr[p + 1] <= ed[i]) p++;
        ans = max(ans, 2 + i - p);
    }
    cout << ans;
    return 0;
}

Compilation message

gw.cpp: In function 'void File()':
gw.cpp:6:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    6 |     freopen(file".in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
gw.cpp:7:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    7 |     freopen(file".out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 3548 KB Output is correct
2 Correct 11 ms 3552 KB Output is correct
3 Correct 10 ms 3452 KB Output is correct
4 Correct 10 ms 3548 KB Output is correct
5 Correct 12 ms 3552 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 4064 KB Output is correct
2 Correct 10 ms 3808 KB Output is correct
3 Correct 20 ms 4060 KB Output is correct
4 Correct 20 ms 4064 KB Output is correct
5 Correct 21 ms 4060 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 250 ms 17044 KB Output is correct
2 Correct 223 ms 17144 KB Output is correct
3 Correct 228 ms 17068 KB Output is correct
4 Correct 229 ms 17084 KB Output is correct
5 Correct 243 ms 16384 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 218 ms 16332 KB Output is correct
2 Correct 218 ms 16336 KB Output is correct
3 Correct 222 ms 16260 KB Output is correct
4 Correct 113 ms 11200 KB Output is correct
5 Correct 117 ms 11200 KB Output is correct