oj.uz

Submission #957757

# Submission time Handle Problem Language Result Execution time Memory
957757 2024-04-04T09:20:32 Z I_am_Polish_Girl Bigger segments (IZhO19_segments) C++14
0 / 100
 1 ms 348 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <stack>
#include <queue>
#include <cmath>
#include <random>
#include <chrono>

using namespace std;

#define int long long

int log_ = 10;
int inf = 1000000000000000000;
int mod = 998244353;




signed main()
{
    ios_base::sync_with_stdio();
    cin.tie(0);
    cout.tie(0);

    int n;
    cin >> n;

    vector <int> a(n);

    vector <int> pref;

    int pr = 0;


    pref.push_back(0);

    for (int i = 0; i < n; i++)
    {
        cin >> a[i];

        pr += a[i];
        pref.push_back(pr);
    }


    int l = 0;
    int r = pref[1];

    int col = 1;

    while (true)
    {
        int x = r + r - l;

        if (x > pref[pref.size() - 1])
        {
            break;
        }

        col++;

        int ind = lower_bound(pref.begin(), pref.end(), x) - pref.begin();

        int lx = l;
        l = r;
        r = pref[ind];

        int m = (r + lx + 1) / 2;


        ind = lower_bound(pref.begin(), pref.end(), x) - pref.begin();

        ind--;

        l = pref[ind];
    }

    cout << col;

}

Compilation message

segments.cpp: In function 'int main()':
segments.cpp:74:13: warning: unused variable 'm' [-Wunused-variable]
   74 |         int m = (r + lx + 1) / 2;
      |             ^

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -