# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
425533 | songc | Vim (BOI13_vim) | C++14 | 47 ms | 34076 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define Mup(a,x) a=max(a, x)
#define mup(a,x) a=min(a, x)
#define all(v) v.begin(),v.end()
#define lb lower_bound
#define INF (1ll<<60)
#define MOD 1'000'000'007
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;
int M, N, X, sum, ans=MOD;
int A[70707], D[70707][11][11];
bool E[70707];
int main(){
char c;
bool tf = false;
scanf("%d", &M);
for (int i=0; i<M; i++){
scanf(" %c", &c);
if (c != 'e'){
A[++N] = c-'a'+1+(c<'e'?1:0);
if (tf) X = N;
E[N] = tf, tf = false;
}
else tf = true, sum += 2;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |