제출 #626448

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
626448		Sasha008	메기 농장 (IOI22_fish)	C++17	3 / 100	87 ms	14312 KiB

fish

#include<bits/stdc++.h>
//#include "prison.h"
#pragma GCC optimize ("O3")
using namespace std;
#define el "\n"
#define se " "
#define ll long long
#define ld long double
#define ff first
#define ss second
#define pb push_back
const ll INF=1e18,ch=1e18;
ll a,b,c,d,n,COST,t,last,ab,ba,n1,n2,fl1,fl2,o1,o2,flag,flag1,flag2,g,m,m1,m2,i,j,lr,f,k,l,r,y,o,p,mx=-ch,mx1=-ch,mx2=-ch,q,q1,q2,q3,q4,mn=ch,mn1=ch,mn2=ch,f1,f2,f3,pos,ans,sum,sz=1,MOD=1e9+7,zero=0,a1,b1,c1,val,sum1,cur,res,ans1,res1,kk,kkk,cnt,cnt1,fl;
pair < ll , pair < ll , ll > > A[300005];
pair < ll, ll > B[300005];
ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W)
{
    n=N;m=M;k=X.size();
    for(i=1;i<=k;i++)
    {
        A[i].ff=X[i-1]+1;
        A[i].ss.ff=Y[i-1]+1;
        A[i].ss.ss=W[i-1];
        if (A[i].ff%2!=0) q1++;
        if (A[i].ff<=2) q2++;
    }
    if (q1==k)
    {
        for(i=1;i<=k;i++)
        {
            f+=A[i].ss.ss;
        }
        return f;
    }
    else if (q2==k)
    {
        for(i=1;i<=k;i++)
        {
            if (B[A[i].ss.ff].ff==0)
            {
                B[A[i].ss.ff].ff=A[i].ss.ss;
                f+=A[i].ss.ss;
            }
            else
            {
                B[A[i].ss.ff].ss=A[i].ss.ss;
                f-=B[A[i].ss.ff].ff;
                f+=max(B[A[i].ss.ff].ff,B[A[i].ss.ff].ss);
            }
        }
        return f;
    }
    else
    {

        return f;
    }
}

//int main()
//{
//    ios_base::sync_with_stdio(0);
//    cin.tie(0);
//    cout.tie(0);
//    cin>>n>>a>>b;
//    vector < vector < int > > v=devise_strategy(a,b);
//}

• Subtask 1: 3 / 3
• Subtask 2: 0 / 6
• Subtask 3: 0 / 9
• Subtask 4: 0 / 14
• Subtask 5: 0 / 21
• Subtask 6: 0 / 17
• Subtask 7: 0 / 14
• Subtask 8: 0 / 16