oj.uz

Submission #511469

# Submission time Handle Problem Language Result Execution time Memory
511469 2022-01-15T23:02:08 Z Zhora_004 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
17 / 100
 3000 ms 4680 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <string>
#include <sstream>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <stack>
#include <cstdio>
#include <climits>
#include <tuple>
#include <ctime>
#include <cstring>
#include <numeric>
#include <functional>
#include <chrono>
#include <cassert>
#include <bitset>
//#include <bit>
//#include <ranges>
//#include <numbers>
#define itn int
#define sacnf scanf
#define sz(a) ((int)((a).size()))
// printf("%.10f\n", ans);
using ll = long long;
using namespace std;
const ll mod = 1e9 + 7;
const int N = 1e6 + 5;



int main()
{
    /*ios_base::sync_with_stdio(false);
    cin.tie(NULL);*/
    int n, m;
    scanf("%d%d", &n, &m);
    vector<int> v(n);
    for (int i = 0; i < n; i++) scanf("%d", &v[i]);
    for (int i = 0; i < m; i++)
    {
        int l, r, k;
        scanf("%d%d%d", &l, &r, &k);
        l--, r--;
        int mx_num = 0, mx = 0;
        for (int j = l; j <= r; j++)
        {
            if (mx_num > v[j]) mx = max(mx, v[j] + mx_num);
            mx_num = max(mx_num, v[j]);
        }
        if (mx <= k) printf("1\n");
        else printf("0\n");
    }

    return 0;
}


// https://codeforces.com/problemset/problem/1136/D?locale=ru

Compilation message

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:45:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |     scanf("%d%d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~
sortbooks.cpp:47:38: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |     for (int i = 0; i < n; i++) scanf("%d", &v[i]);
      |                                 ~~~~~^~~~~~~~~~~~~
sortbooks.cpp:51:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |         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 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 288 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 288 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 3 ms 308 KB Output is correct
12 Correct 6 ms 364 KB Output is correct
13 Correct 7 ms 332 KB Output is correct
14 Correct 11 ms 432 KB Output is correct
15 Correct 11 ms 460 KB Output is correct
16 Correct 20 ms 424 KB Output is correct
17 Correct 15 ms 332 KB Output is correct
18 Correct 18 ms 388 KB Output is correct

Subtask #3
0 / 13.0

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

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2477 ms 2392 KB Output is correct
2 Execution timed out 3062 ms 2004 KB Time limit exceeded
3 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 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 288 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 3 ms 308 KB Output is correct
12 Correct 6 ms 364 KB Output is correct
13 Correct 7 ms 332 KB Output is correct
14 Correct 11 ms 432 KB Output is correct
15 Correct 11 ms 460 KB Output is correct
16 Correct 20 ms 424 KB Output is correct
17 Correct 15 ms 332 KB Output is correct
18 Correct 18 ms 388 KB Output is correct
19 Execution timed out 3005 ms 4680 KB Time limit exceeded
20 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 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 288 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 3 ms 308 KB Output is correct
12 Correct 6 ms 364 KB Output is correct
13 Correct 7 ms 332 KB Output is correct
14 Correct 11 ms 432 KB Output is correct
15 Correct 11 ms 460 KB Output is correct
16 Correct 20 ms 424 KB Output is correct
17 Correct 15 ms 332 KB Output is correct
18 Correct 18 ms 388 KB Output is correct
19 Execution timed out 3010 ms 4280 KB Time limit exceeded
20 Halted 0 ms 0 KB -