제출 #581563

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
581563		Omar_Elgedawy	Miners (IOI07_miners)	C++14	0 / 100	161 ms	208708 KiB

miners

#include <bits/stdc++.h>
using namespace std;
#define cin(vec)        for(auto& i : vec) cin >> i
#define cout(vec)       for(auto& i : vec) cout << i << " "; cout << "\n";
#define fast            ios::sync_with_stdio(0);cin.tie(0);
#define loop(i,a,b)     for (int i = a; i < b; i++)
#define F               first
#define S               second
#define pb(n)           push_back(n)
#define pf(n)           push_front(n)
#define dci(d)          fixed<<setprecision(d)
#define sp              ' '
#define el              '\n'
#define all(v)          v.begin(),v.end()
#define int             long long
int dx[8]= {0,0,1,-1,-1,1,1,-1};
int dy[8]= {-1,1,0,0,-1,1,-1,1};
int const N=1e5+1,M=1e3+1,Mod=1e9+7;
string s;
int n;
int dp[N][4][4][4][4];
int value(int a,int b,int c){
  set<int>s;
  s.insert(a);
  s.insert(b);
  s.insert(c);
  s.erase(0ll);
  return s.size();
}
int trans(char x){
  if(x=='Z')return 1;
  else x=='F'?2:3;
}
int rec(int idx, int left_a, int left_b, int right_a, int right_b){
  if(idx==n)return 0;
  int &ret=dp[idx][left_a][left_b][right_a][right_b];
  if(~ret)return ret;
  int c=trans(s[idx]);
  int c1=rec(idx+1,left_b,c,right_a,right_b)+value(left_a,left_b,c);
  int c2=rec(idx+1,left_a,left_b,right_b,c)+value(right_a,right_b,c);
  return ret=max(c1,c2);
}
void testcase(int h){
  cin>>n>>s;
  memset(dp,-1,sizeof dp);
  cout<<rec(0,0,0,0,0);
}
int32_t main()
{
  fast
  testcase(1);
  // int tc;cin>>tc;for(int i=1;i<=tc;i++)testcase(i);
  return 0;
}

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

miners.cpp: In function 'long long int trans(char)':
miners.cpp:32:18: warning: second operand of conditional expression has no effect [-Wunused-value]
   32 |   else x=='F'?2:3;
      |                  ^
miners.cpp:32:18: warning: third operand of conditional expression has no effect [-Wunused-value]
miners.cpp:33:1: warning: control reaches end of non-void function [-Wreturn-type]
   33 | }
      | ^

• Subtask 1: 0 / 9
• Subtask 2: 0 / 9
• Subtask 3: 0 / 9
• Subtask 4: 0 / 9
• Subtask 5: 0 / 9
• Subtask 6: 0 / 7
• Subtask 7: 0 / 8
• Subtask 8: 0 / 8
• Subtask 9: 0 / 8
• Subtask 10: 0 / 8
• Subtask 11: 0 / 8
• Subtask 12: 0 / 8