제출 #1079402

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1079402		modwwe	친구 (IOI14_friend)	C++17	100 / 100	24 ms	4576 KiB

friend

#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
//#define int long long
//#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".ans","w",stdout)
#define pb push_back
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
#define getchar_unlocked getchar

inline int scan(){
    char c = getchar_unlocked();
    int x = 0;
    while(c<'0'||c>'9'){
        c=getchar_unlocked();
    }
    while(c>='0'&&c<='9'){
        x=(x<<1)+(x<<3)+c-'0';
        c=getchar_unlocked();
    }
    return x;
}

void phongbeo();
const int inf=1e9;
const int mod2=1e9+7;
const int  mod1=998244353;
struct icd
{
    long double a;
    int b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    int a,b,c;
};
struct id
{
    int a,b,c,d;
};
struct ie
{
    int a,b,c,d,e;

};

int n,m,s1,s2,s4,s3,sf,k,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,s33,dem3,dem4,l,r,mid;
int  i,s10,s12;
int kk;
int el=29;

int dp1[100001];
int dp2[100001];
int a[100001];
ib b[100001];
int findSample(int N, int confidence[], int host[], int protocol[])
{
 n=N;
  for(int i=1;i<=n;i++)
     a[i]=confidence[i-1],s4=max(s4,a[i]);
  for(int i=2;i<=n;i++)
     b[i].a=host[i-1],b[i].b=protocol[i-1],b[i].a++;
     for(int i=1;i<=n;i++)
        dp1[i]=a[i];
        s2=0;
     for(int i=n;i>=1;--i)
     {
     /// dp1 la diem dat cuoi la con i
     /// dp2 la bo con i
     dp1[i]=max(dp1[i],dp2[i]);
     s2=max(s2,dp1[i]);
     if(i==1) break;
    if(b[i].b==0)
    {
         dp1[b[i].a]+=dp2[i];
         dp2[b[i].a]+=dp1[i];
    }
    else if(b[i].b==1)
    {
      dp1[b[i].a]+=dp1[i];
      dp1[b[i].a]=max(dp1[b[i].a],dp2[b[i].a]+dp1[i]);
      dp2[b[i].a]+=dp2[i];
    }
    else if(b[i].b==2)
    {
      dp1[b[i].a]=max({dp1[b[i].a]+dp2[i],dp2[b[i].a]+dp1[i]});
    dp2[b[i].a]+=dp2[i];
    }

     }
 return s2;
}

컴파일 시 표준 에러 (stderr) 메시지

friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:74:3: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   74 |   for(int i=2;i<=n;i++)
      |   ^~~
friend.cpp:76:6: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   76 |      for(int i=1;i<=n;i++)
      |      ^~~
friend.cpp:76:6: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
friend.cpp:78:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   78 |         s2=0;
      |         ^~

• Subtask 1: 11 / 11
• Subtask 2: 8 / 8
• Subtask 3: 8 / 8
• Subtask 4: 19 / 19
• Subtask 5: 23 / 23
• Subtask 6: 31 / 31