oj.uz

Submission #1086136

# Submission time Handle Problem Language Result Execution time Memory
1086136 2024-09-09T15:50:07 Z urd05 Closing Time (IOI23_closing) C++17
9 / 100
 40 ms 13048 KB 
#include "closing.h"

#include <bits/stdc++.h>
using namespace std;

int n;
long long pos[3005];
long long save[3005];
vector<long long> v1;
vector<long long> v2;
int x,y;
long long k;

int max_score(int N, int X, int Y, long long K,
              std::vector<int> U, std::vector<int> V, std::vector<int> W)
{
    n=N;
    x=X;
    y=Y;
    k=K;
    for(int i=0;i<n-1;i++) {
        pos[i+1]=pos[i]+W[i];
    }
    int l=x;
    int r=y;
    while (1) {
        if (l==0&&r==n-1) {
            break;
        }
        if (l!=0&&(r==n-1||pos[x]-pos[l-1]<=pos[r+1]-pos[y])) {
            l--;
            v2.push_back(pos[x]-pos[l]);
        }
        else {
            r++;
            v2.push_back(pos[r]-pos[y]);
        }
    }
    l=x;
    r=y;
    while (1) {
        if (l==y&&r==x) {
            break;
        }
        if (l!=y&&(r==x||pos[l+1]-pos[x]-save[l+1]<=pos[y]-pos[r-1]-save[r-1])) {
            l++;
            v1.push_back(pos[l]-pos[x]-save[l]);
            save[l]=pos[l]-pos[x];
        }
        else {
            r--;
            v1.push_back(pos[y]-pos[r]-save[r]);
            save[r]=pos[y]-pos[r];
        }
    }
    int ret=0;
    for(int i=0;i<=v2.size();i++) {
        long long sum=0;
        for(int j=0;j<i;j++) {
            sum+=v2[j];
        }
        if (sum>k) {
            break;
        }
        int cnt=i;
        for(int j=0;j<v1.size();j++) {
            if (sum+v1[j]<=k) {
                sum+=v1[j];
                cnt++;
            }
            else {
                break;
            }
        }
        for(int j=0;j<i;j++) {
            if (sum+pos[y]-pos[x]<=k) {
                sum+=pos[y]-pos[x];
                cnt++;
            }
        }
        ret=max(ret,cnt);
    }
    return ret+2;
}

Compilation message

closing.cpp: In function 'int max_score(int, int, int, long long int, std::vector<int>, std::vector<int>, std::vector<int>)':
closing.cpp:57:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |     for(int i=0;i<=v2.size();i++) {
      |                 ~^~~~~~~~~~~
closing.cpp:66:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |         for(int j=0;j<v1.size();j++) {
      |                     ~^~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 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 Runtime error 40 ms 13048 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 440 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #3
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 440 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Incorrect 1 ms 440 KB 2nd lines differ - on the 1st token, expected: '25', found: '36'
19 Halted 0 ms 0 KB -

Subtask #4
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 440 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Incorrect 1 ms 440 KB 2nd lines differ - on the 1st token, expected: '25', found: '36'
19 Halted 0 ms 0 KB -

Subtask #5
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 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 0 ms 344 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 0 ms 344 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 0 ms 344 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 0 ms 344 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -