oj.uz

Submission #524326

# Submission time Handle Problem Language Result Execution time Memory
524326 2022-02-09T04:20:10 Z AzamatRustamov Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
8 / 100
 3000 ms 7936 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define endl '\n'

// pair - sort
//

void solve(int w[], int &n);

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n, m;
//  cin >> n >> m;
    scanf("%d %d", &n, &m);

    int w[n+1];
    w[0] = 0;

    for (int i=1; i<=n; i++) scanf("%d", &w[i]); //cin >> w[i];
    for (int i=0; i<m; i++) solve(w, n);

    return 0;
}

void solve(int w[], int &n)
{
    int l, r, k;
//  cin >> l >> r >> k;
    scanf("%d %d %d", &l, &r, &k);

    bool can = 1;
    for (int i = l; can && i < r; i++)
        for (int j = i+1; can && j <= r; j++)
            if (w[i]>w[j] && w[i]+w[j]>k)
                can = 0;

    printf("%d\n", can);
}

Compilation message

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:19:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |     scanf("%d %d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~
sortbooks.cpp:24:35: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |     for (int i=1; i<=n; i++) scanf("%d", &w[i]); //cin >> w[i];
      |                              ~~~~~^~~~~~~~~~~~~
sortbooks.cpp: In function 'void solve(int*, int&)':
sortbooks.cpp:34:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |     scanf("%d %d %d", &l, &r, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 316 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 2 ms 328 KB Output is correct
8 Correct 22 ms 204 KB Output is correct
9 Correct 10 ms 204 KB Output is correct
10 Correct 9 ms 324 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 316 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 2 ms 328 KB Output is correct
8 Correct 22 ms 204 KB Output is correct
9 Correct 10 ms 204 KB Output is correct
10 Correct 9 ms 324 KB Output is correct
11 Correct 18 ms 332 KB Output is correct
12 Correct 132 ms 428 KB Output is correct
13 Correct 87 ms 320 KB Output is correct
14 Correct 202 ms 460 KB Output is correct
15 Correct 123 ms 460 KB Output is correct
16 Execution timed out 3041 ms 332 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 703 ms 7744 KB Output is correct
2 Correct 575 ms 7900 KB Output is correct
3 Correct 624 ms 6220 KB Output is correct
4 Correct 661 ms 6308 KB Output is correct
5 Execution timed out 3050 ms 7936 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3047 ms 1228 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 316 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 2 ms 328 KB Output is correct
8 Correct 22 ms 204 KB Output is correct
9 Correct 10 ms 204 KB Output is correct
10 Correct 9 ms 324 KB Output is correct
11 Correct 18 ms 332 KB Output is correct
12 Correct 132 ms 428 KB Output is correct
13 Correct 87 ms 320 KB Output is correct
14 Correct 202 ms 460 KB Output is correct
15 Correct 123 ms 460 KB Output is correct
16 Execution timed out 3041 ms 332 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 316 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 2 ms 328 KB Output is correct
8 Correct 22 ms 204 KB Output is correct
9 Correct 10 ms 204 KB Output is correct
10 Correct 9 ms 324 KB Output is correct
11 Correct 18 ms 332 KB Output is correct
12 Correct 132 ms 428 KB Output is correct
13 Correct 87 ms 320 KB Output is correct
14 Correct 202 ms 460 KB Output is correct
15 Correct 123 ms 460 KB Output is correct
16 Execution timed out 3041 ms 332 KB Time limit exceeded
17 Halted 0 ms 0 KB -