oj.uz

Submission #1081838

# Submission time Handle Problem Language Result Execution time Memory
1081838 2024-08-30T11:52:08 Z Boas Closing Time (IOI23_closing) C++17
0 / 100
 1000 ms 15072 KB 
#include "closing.h"

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T1, typename T2>
using indexed_map = tree<T1, T2, less<T1>, rb_tree_tag, tree_order_statistics_node_update>;

#define int long long
#define pb push_back
#define loop(x, i) for (int i = 0; i < x; i++)
#define rev(x, i) for (int i = (int)(x) - 1; i >= 0; i--)
#define ALL(x) begin(x), end(x)
typedef pair<int, int> ii;
typedef signed i32;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<i32> vi32;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<vii> vvii;

i32 max_score(i32 N, i32 X, i32 Y, int K, vi32 U, vi32 V, vi32 W)
{
    vi pSum = {0}, sufSum(N);
    vi pSum2 = {0}, sufSum2(N);
    loop(N - 1, i)
    {
        pSum.pb(pSum.back() + W[i]);
        pSum2.pb(pSum2.back() + pSum.back());
    }
    rev(N - 1, i)
    {
        sufSum[i] = sufSum[i + 1] + W[i];
        sufSum2[i] = sufSum2[i + 1] + sufSum[i];
    }
    int mid = X; // last node for which X is closest
    for (int i = X; i <= Y; i++)
    {
        if (pSum[i] - pSum[X] <= pSum[Y] - pSum[i])
        {
            mid = i;
        }
    }
    auto sumDis = [&](int l, int r)
    {
        if (r < l)
        {
            // gebruk sufSum
            throw;
        }
        int minCount = (r * (r - 1)) / 2 - (l * (l - 1)) / 2;
        int dis = pSum2[r] - pSum2[l] - minCount * pSum[l];
        return dis;
    };
    int res = 0;
    int lxDis = 0;
    for (int lx = X; lx >= 0; lx--)
    {
        lxDis += pSum[X] - pSum[lx];
        int rxDis = 0;
        for (int rx = X; rx < N; rx++)
        {
            rxDis += pSum[rx] - pSum[X];
            int lyDis = 0;
            for (int ly = Y; ly >= 0; ly--)
            {
                lyDis += pSum[Y] - pSum[ly];
                int ryDis = 0;
                for (int ry = Y; ry < N; ry++)
                {
                    ryDis += pSum[ry] - pSum[Y];
                    int dis = rxDis + lxDis + ryDis + lyDis;
                    if (dis <= K)
                    {
                        int cnt = (rx - lx + 1) + (ry - ly + 1);
                        res = max(res, cnt);
                    }
                }
            }
        }
    }
    /*for (int both = 0; both < N; both++)
    {
        int best = 0, bestDis = INT_MAX;
        for (int i = X; i <= Y; i++)
        {
            int dis = sumDis(X, i) + sumDis(i, Y);
            if (dis < bestDis)
            {
                best = i;
                bestDis = dis;
            }
        }
    }*/
    return res;
}

Compilation message

closing.cpp: In function 'i32 max_score(i32, i32, i32, long long int, vi32, vi32, vi32)':
closing.cpp:38:9: warning: variable 'mid' set but not used [-Wunused-but-set-variable]
   38 |     int mid = X; // last node for which X is closest
      |         ^~~
closing.cpp:46:10: warning: variable 'sumDis' set but not used [-Wunused-but-set-variable]
   46 |     auto sumDis = [&](int l, int r)
      |          ^~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #1
0.0 / 8.0

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

Subtask #2
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '30', found: '24'
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '30', found: '24'
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '30', found: '24'
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -