oj.uz

답안 #684213

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
684213 2023-01-20T16:47:02 Z Urvuk3 메기 농장 (IOI22_fish) C++17
3 / 100
 84 ms 7280 KB 
#include "fish.h"

#include <bits/stdc++.h>

using namespace std;

#define ll long long
const int INF=1e9;
const ll LINF=1e18;
#define fi first
#define se second
#define pii pair<int,int>
#define mid ((l+r)/2)
#define sz(a) (int((a).size()))
#define all(a) a.begin(),a.end()
#define endl "\n"
#define PRINT(x) cerr<<#x<<'='<<x<<endl;
#define pb push_back
#define PRINTvec(niz) { cerr<<#niz<<"="; for(auto _i:niz) cerr<<_i<<" "; cerr<<endl; }

long long max_weights(int N,int M,vector<int> X,vector<int> Y,vector<int> W){
    bool subtask1=true;
    for(int i=0;i<M;i++) subtask1&=(X[i]%2==0);
    if(subtask1){
        ll res=0;
        for(int i=0;i<M;i++){
            res+=W[i];
        }
        return res;
    }
    bool subtask2=true;
    for(int i=0;i<M;i++) subtask2&=(X[i]<=1);
    if(subtask2){
        ll res=0;
        ll sum0=0,sum1=0;
        for(int i=0;i<M;i++){
            if(X[i]==0){
                sum0+=W[i];
            }
            else{
                sum1+=W[i];
            }
        }
        res=max(sum1,sum0);
        if(N>2){
            sum0=0;
            vector<vector<int>> we(2,vector<int>(N,0));
            for(int i=0;i<M;i++){
                we[X[i]][Y[i]]=W[i];
            }
            for(int k=0;k<N;k++){
                sum0+=we[0][k];
                sum1-=we[1][k];
                res=max(res,sum0+sum1);
            }
        }
    }
}

Compilation message

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:58:1: warning: control reaches end of non-void function [-Wreturn-type]
   58 | }
      | ^

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 2160 KB Output is correct
2 Correct 29 ms 2644 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 79 ms 7280 KB Output is correct
6 Correct 84 ms 7244 KB Output is correct

Subtask #2
0 / 6.0

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

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 2 ms 1924 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 17.0

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

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 2 ms 1924 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 2160 KB Output is correct
2 Correct 29 ms 2644 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 79 ms 7280 KB Output is correct
6 Correct 84 ms 7244 KB Output is correct
7 Runtime error 1 ms 340 KB Execution killed with signal 11
8 Halted 0 ms 0 KB -