oj.uz

답안 #1052984

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1052984 2024-08-11T07:14:14 Z mychecksedad 사탕 분배 (IOI21_candies) C++17
0 / 100
 2514 ms 2097152 KB 
#include "candies.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long int
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define pii pair<int,int>
#define ff first
#define ss second
const int N = 3e5+100;

std::vector<int> distribute_candies(std::vector<int> cc, std::vector<int> l, std::vector<int> r, std::vector<int> v) {
  vector<ll> c(all(cc));
  int n = c.size();
  int q = l.size();
  std::vector<int> s(n);

  vector<vector<int>> Q(n);
  for(int i = 0; i < q; ++i){
    for(int j = l[i]; j <= r[i]; ++j){
      Q[j].pb(v[i]);
    }
  }
  for(int i = 0; i < n; ++i){
    if(Q[i].size() == 0) continue;
    ll sum = 0;
    int x = 0;
    for(int j = Q[i].size() - 1; j >= 0; --j){
      // cout << Q[i][j] << ' ';
      ll v = Q[i][j];
      if(v >= c[i]){
        x = -1;
        s[i] = c[i] + sum;
        break;
      }else if(v <= -c[i]){
        // x = j;
        x = -1;
        s[i] = sum;
        break;
      }
      if(sum + v <= -c[i]){
        x = j;
        break;
      }else if(sum + v >= c[i]){
        x = j;
        break;
      }else{
        sum += v;
      }
    }
    if(x==-1) continue;
    sum = 0;
    for(int j = x; j < Q[i].size(); ++j){
      sum += Q[i][j];
      sum = max(0ll, min(sum, c[i]));
    }
    s[i] = sum;
  }


  return s;
}

Compilation message

candies.cpp: In function 'std::vector<int> distribute_candies(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
candies.cpp:54:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |     for(int j = x; j < Q[i].size(); ++j){
      |                    ~~^~~~~~~~~~~~~

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2514 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1159 ms 572420 KB Output is correct
3 Correct 1139 ms 652840 KB Output is correct
4 Runtime error 2436 ms 2097152 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -