oj.uz

Submission #924655

# Submission time Handle Problem Language Result Execution time Memory
924655 2024-02-09T11:23:23 Z sleepntsheep Global Warming (NOI13_gw) C++17
23 / 40
 195 ms 20940 KB 
#include <bits/stdc++.h>
using namespace std;

#define N 1000005

int n, f[N], z;
pair<int, int> a[N];

int main()
{
    scanf("%d", &n);
    for (int i = 0; i < n; i++) scanf("%d", &a[i].first), a[i].second = i + 2;
    sort(a, a+n);

    for (int distinct = 0, i = n; i--;)
    {
        int x = a[i].second;
        if (!f[x-1] && !f[x+1])
            distinct++;
        else if (f[x-1] ^ f[x+1])
            ;
        else
            distinct--;
        f[x] = 1;
        z = max(z, distinct);
    }
    printf("%d\n", z);

    return 0;
}

Compilation message

gw.cpp: In function 'int main()':
gw.cpp:11:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
gw.cpp:12:38: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     for (int i = 0; i < n; i++) scanf("%d", &a[i].first), a[i].second = i + 2;
      |                                 ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 17 ms 2908 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 2908 KB Output is correct
2 Correct 11 ms 2908 KB Output is correct
3 Correct 17 ms 2920 KB Output is correct
4 Correct 16 ms 2908 KB Output is correct
5 Correct 15 ms 2908 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 177 ms 12132 KB Output is correct
2 Correct 175 ms 12116 KB Output is correct
3 Correct 176 ms 12132 KB Output is correct
4 Correct 177 ms 12128 KB Output is correct
5 Correct 161 ms 12128 KB Output is correct

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 168 ms 12136 KB Output is correct
2 Correct 195 ms 20816 KB Output is correct
3 Correct 177 ms 20940 KB Output is correct
4 Incorrect 183 ms 15004 KB Output isn't correct
5 Halted 0 ms 0 KB -