제출 #957276

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
957276		DeltaStruct	Linear Garden (IOI08_linear_garden)	C++17	0 / 100	17 ms	3680 KiB

linear_garden

#include <bits/stdc++.h>
using namespace std;
#define int long long

signed main(){
  int n,m,r=0; cin >> n >> m; string s; cin >> s;
  vector dp(7,vector<int>(7)); dp[3][3] = 1; auto res = dp;
  for (int i(n-1);i > -1;--i){
    if (s[i]=='P') for (int k(0);k < 7;++k) for (int j(0);j < 7;++j) r += dp[k][j];
    for (int k(0);k < 7;++k) for (int j(0);j < 7;++j) res[k][j] = 0;
    for (int k(0);k < 7;++k) for (int j(k);j < 6;++j) res[min(k+1,1ll)][max(j+1,1ll)] += dp[k][j];
    for (int k(1);k < 7;++k) for (int j(k);j < 7;++j) res[min(k-1,-1ll)][max(j-1,-1ll)] += dp[k][j];
  }
  cout << r << endl;
}

• Subtask 1: 0 / 2
• Subtask 2: 0 / 2
• Subtask 3: 0 / 4
• Subtask 4: 0 / 4
• Subtask 5: 0 / 4
• Subtask 6: 0 / 4
• Subtask 7: 0 / 4
• Subtask 8: 0 / 4
• Subtask 9: 0 / 4
• Subtask 10: 0 / 4
• Subtask 11: 0 / 4
• Subtask 12: 0 / 5
• Subtask 13: 0 / 5
• Subtask 14: 0 / 5
• Subtask 15: 0 / 5
• Subtask 16: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5
• Subtask 21: 0 / 5
• Subtask 22: 0 / 5
• Subtask 23: 0 / 5