Submission #745677

# Submission time Handle Problem Language Result Execution time Memory
745677 2023-05-21T00:50:22 Z 반딧불(#9962) Alternating Heights (CCO22_day1problem1) C++17
4 / 25
240 ms 5208 KB
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int n, k, q;
int arr[3002];
int sum[3002];

int main(){
    scanf("%d %d %d", &n, &k, &q);
    for(int i=1; i<=n; i++){
        scanf("%d", &arr[i]);
        sum[i] = (arr[i-1] != arr[i]);
        sum[i] += sum[i-1];
    }
    for(int i=1; i<=q; i++){
        int l, r;
        scanf("%d %d", &l, &r);
        if(sum[r] - sum[l] == (r - l)) printf("YES\n");
        else printf("NO\n");
    }
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:12:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     scanf("%d %d %d", &n, &k, &q);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:14:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |         scanf("%d", &arr[i]);
      |         ~~~~~^~~~~~~~~~~~~~~
Main.cpp:20:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |         scanf("%d %d", &l, &r);
      |         ~~~~~^~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 199 ms 4128 KB Output is correct
2 Correct 207 ms 4204 KB Output is correct
3 Correct 211 ms 4216 KB Output is correct
4 Correct 184 ms 4116 KB Output is correct
5 Correct 181 ms 4308 KB Output is correct
6 Correct 240 ms 4232 KB Output is correct
7 Correct 200 ms 4172 KB Output is correct
8 Correct 197 ms 4172 KB Output is correct
9 Correct 213 ms 4316 KB Output is correct
10 Correct 208 ms 4568 KB Output is correct
11 Correct 220 ms 5208 KB Output is correct
12 Correct 181 ms 5104 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 198 ms 4372 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 304 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 199 ms 4128 KB Output is correct
2 Correct 207 ms 4204 KB Output is correct
3 Correct 211 ms 4216 KB Output is correct
4 Correct 184 ms 4116 KB Output is correct
5 Correct 181 ms 4308 KB Output is correct
6 Correct 240 ms 4232 KB Output is correct
7 Correct 200 ms 4172 KB Output is correct
8 Correct 197 ms 4172 KB Output is correct
9 Correct 213 ms 4316 KB Output is correct
10 Correct 208 ms 4568 KB Output is correct
11 Correct 220 ms 5208 KB Output is correct
12 Correct 181 ms 5104 KB Output is correct
13 Incorrect 198 ms 4372 KB Output isn't correct
14 Halted 0 ms 0 KB -