답안 #833137

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
833137 2023-08-22T02:11:23 Z veehj Feast (NOI19_feast) C++17
4 / 100
1000 ms 5044 KB
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
#define F first
#define S second
#define pb push_back
#define sz(a) (int)a.size()
#define all(x) (x).begin(), (x).end()
int n, k; vector<ll> a={0};

void f(){
    vector<ll> p=a;
    for(int i=1; i<p.size(); i++) p[i]+=p[i-1];
    ll ans=0;
    for(int i=0; i<p.size(); i++){
        for(int j=0; j<i; j++){
            ans=max(ans, p[i]-p[j]);
        }
    }
    cout << ans << endl;
    return;
}

int main(){
    cin >> n >> k;
    for(int i=0; i<n; i++){
        ll x; cin >> x;
        a.pb(x);
    }
    if(k==1) f();
    else{
        ll cnt=0;
        for(auto& u : a) if(u>0) cnt+=u;
        cout << cnt << endl;
    }
}

Compilation message

feast.cpp: In function 'void f()':
feast.cpp:15:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |     for(int i=1; i<p.size(); i++) p[i]+=p[i-1];
      |                  ~^~~~~~~~~
feast.cpp:17:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |     for(int i=0; i<p.size(); i++){
      |                  ~^~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 80 ms 4408 KB Output is correct
2 Correct 82 ms 4496 KB Output is correct
3 Correct 83 ms 4668 KB Output is correct
4 Correct 91 ms 4508 KB Output is correct
5 Correct 83 ms 4476 KB Output is correct
6 Correct 83 ms 4520 KB Output is correct
7 Correct 85 ms 4408 KB Output is correct
8 Correct 84 ms 4472 KB Output is correct
9 Correct 82 ms 4528 KB Output is correct
10 Correct 81 ms 4516 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1074 ms 4916 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1081 ms 5044 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 80 ms 4408 KB Output is correct
2 Correct 82 ms 4496 KB Output is correct
3 Correct 83 ms 4668 KB Output is correct
4 Correct 91 ms 4508 KB Output is correct
5 Correct 83 ms 4476 KB Output is correct
6 Correct 83 ms 4520 KB Output is correct
7 Correct 85 ms 4408 KB Output is correct
8 Correct 84 ms 4472 KB Output is correct
9 Correct 82 ms 4528 KB Output is correct
10 Correct 81 ms 4516 KB Output is correct
11 Execution timed out 1074 ms 4916 KB Time limit exceeded
12 Halted 0 ms 0 KB -