oj.uz

답안 #938174

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
938174 2024-03-05T01:37:58 Z irmuun 메기 농장 (IOI22_fish) C++17
3 / 100
 67 ms 8348 KB 
#include<bits/stdc++.h>
 
using namespace std;
 
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

ll max_weights(int n,int m,vector<int>x,vector<int>y,vector<int>w){
    int even=0,X=0,Y=0;
    for(int i=0;i<m;i++){
        X=max(X,x[i]);
        Y=max(Y,y[i]);
        if(x[i]%2==0) even++;
    }
    if(even==m){
        ll ans=0;
        for(int i=0;i<m;i++){
            ans+=w[i];
        }
        return ans;
    }
    if(X<=1){
        ll ans=0,cur=0;
        for(int i=0;i<m;i++){
            if(x[i]==0){
                ans+=w[i];
            }
            else{
                cur+=w[i];
            }
        }
        if(n==2) return max(ans,cur);
        ll sum[n][2];
        memset(sum,0,sizeof sum);
        for(int i=0;i<m;i++){
            sum[y[i]][x[i]]+=w[i];
        }
        for(int i=1;i<n;i++){
            sum[i][0]+=sum[i-1][0];
            sum[i][1]+=sum[i-1][1];
        }
        ans=max(ans,cur);
        for(int i=1;i<n;i++){
            ans=max(ans,sum[i][0]+sum[n-1][1]-sum[i-1][1]);
        }
        return ans;
    }
    return 0ll;
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 2140 KB Output is correct
2 Correct 23 ms 2644 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 66 ms 7272 KB Output is correct
6 Correct 67 ms 7248 KB Output is correct

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 40 ms 8348 KB 1st lines differ - on the 1st token, expected: '40604614618209', found: '40604944491929'
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '882019', found: '0'
3 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '3', found: '0'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '3', found: '0'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '3', found: '0'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '882019', found: '0'
3 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 2140 KB Output is correct
2 Correct 23 ms 2644 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 66 ms 7272 KB Output is correct
6 Correct 67 ms 7248 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 40 ms 8348 KB 1st lines differ - on the 1st token, expected: '40604614618209', found: '40604944491929'
9 Halted 0 ms 0 KB -