제출 #84538

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
84538		updown1	Linear Garden (IOI08_linear_garden)	C++17	95 / 100	42 ms	9584 KiB

linear_garden

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i, a, b) for(int i=a; i<b; i++)
#define ffi For(i, 0, N)
#define ffj For(j, 0, K)
#define ffa ffi ffj
#define s <<" "<<
#define c <<" : "<<
#define w cout
#define e endl//"\n"
#define pb push_back
#define mp make_pair
#define a first
#define b second
#define int ll
//500,000,000 operations
const int MAXN = 1000000, INF = 1000000000;
//Global Variables
int N, M, out, lo, hi, curr, p2[MAXN];
string in;

main() {
	//ifstream cin("test.in");
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> M >> in;
    p2[0] = 1;
    For (i, 1, N) p2[i] = (2*p2[i-1])%M;
    ffi {
        if (in[i] == 'P') {
            int ch = hi, cl = min(lo, curr-1), cc = curr-1;
            curr++;
            //w<< "temp" s i s cc c cl s ch<<e;
            if (ch > 2+cl) {}
            else if (ch == 1+cl) out += p2[(N-i)/2]+p2[(N-i-1)/2]-1;
            else if (cc == 1+cl) out += p2[(N-i)/2];
            else out += p2[(N-i-1)/2];
            out %=M;
            //w<< i c out<<e;
        }
        else curr--;
        lo = min(lo, curr); hi = max(hi, curr);
        //w<< "perm" s i s curr c lo s hi<<e;
    }
    if (hi-lo <= 2) out ++;
    w<< out<<e;
}

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

linear_garden.cpp:23:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^

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