oj.uz

Submission #328911

# Submission time Handle Problem Language Result Execution time Memory
328911 2020-11-18T12:52:53 Z sofapuden Linear Garden (IOI08_linear_garden) C++14
100 / 100
 114 ms 2440 KB 
#include <bits/stdc++.h>
#define int ll

using namespace std;

typedef long long int;

int M;

int po(int a, int b){
int _a = a, _b = b;
int ret = 1;
while(_b){
if(_b&1){ret*=_a;ret%=M;}
_a*=_a;
_a%=M;
_b>>=1;
}
return ret;
}

signed main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int n; cin >> n >> M;

string s; cin >> s;

int l = 0, r = 0, ans = 0, now = 0;
for(int i = 0; i < n; ++i){
if(s[i] == 'L'){now++, r = max(r,now);continue;}
int rb = max(r,now+1);
int rb2 = n-i-1;
if(rb-l == 1){
ans+=po(2,rb2>>1);
ans+=po(2,(rb2+1)>>1);
ans--;
ans+=M;
ans%=M;
}
else if(rb-l == 2){
if(now+2==rb)ans+=po(2,(rb2+1)>>1);
else ans+=po(2,rb2>>1);
}
now--, l = min(l,now);
}
cout << (ans+1)%M << "\n";
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct

Subtask #7
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct

Subtask #8
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct

Subtask #9
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct

Subtask #10
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct

Subtask #11
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 500 KB Output is correct

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 508 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 492 KB Output is correct

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 620 KB Output is correct

Subtask #19
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 1272 KB Output is correct

Subtask #20
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 1400 KB Output is correct

Subtask #21
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 1528 KB Output is correct

Subtask #22
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 2048 KB Output is correct

Subtask #23
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 2440 KB Output is correct
2 Correct 37 ms 2440 KB Output is correct
3 Correct 114 ms 2440 KB Output is correct