Submission #997925
Source Code Expand
#include <bits/stdc++.h> #include<iostream> #include<cstdio> #include<vector> #include<queue> #include<map> #include<cstring> #include<string> #include <math.h> #include<algorithm> // #include <boost/multiprecision/cpp_int.hpp> #include<functional> #define int long long #define inf 1000000007 #define pa pair<int,int> #define ll long long #define pal pair<ll,ll> #define ppa pair<int,pa> #define mp make_pair #define pb push_back #define EPS (1e-10) #define equals(a,b) (fabs((a)-(b))<EPS) using namespace std; class Point{ public: double x,y; Point(double x=0,double y=0):x(x),y(y) {} Point operator + (Point p) {return Point(x+p.x,y+p.y);} Point operator - (Point p) {return Point(x-p.x,y-p.y);} Point operator * (double a) {return Point(x*a,y*a);} Point operator / (double a) {return Point(x/a,y/a);} double absv() {return sqrt(norm());} double norm() {return x*x+y*y;} bool operator < (const Point &p) const{ return x != p.x ? x<p.x: y<p.y; } bool operator == (const Point &p) const{ return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS; } }; typedef Point Vector; struct Segment{ Point p1,p2; }; double hen(Vector a){ if(fabs(a.x)<EPS && a.y>0) return acos(0); else if(fabs(a.x)<EPS && a.y<0) return 3*acos(0); else if(fabs(a.y)<EPS && a.x<0) return 2*acos(0); else if(fabs(a.y)<EPS && a.x>0) return 0.0; else if(a.y>0) return acos(a.x/a.absv()); else return 2*acos(0)+acos(-a.x/a.absv()); } int gcd(int v,int b){ if(v>b) return gcd(b,v); if(v==b) return b; if(b%v==0) return v; return gcd(v,b%v); } double dot(Vector a,Vector b){ return a.x*b.x+a.y*b.y; } double cross(Vector a,Vector b){ return a.x*b.y-a.y*b.x; } //----------------kokomade tenpure------------ int N=262144; pa sgt[530000]; pa minis(int i,int j ){ if(i==j) return sgt[i]; else if(i%2==1){ pa z=minis(i+1,j); if(sgt[i].first>z.first)return sgt[i] ; else return z; } else if(j%2==0) { pa z=minis(i,j-1); if(sgt[j].first>z.first)return sgt[j] ; else return z; } else return minis(i/2,j/2); } pa sgtmin(int i ,int j) { return minis(i+N,j+N); } void upd(int x,int y){ x+=N; sgt[x].first=y; sgt[x].second=x; x=x/2; while(x != 0){ if(sgt[2*x+1].first>sgt[2*x].first){ sgt[x]=sgt[2*x+1]; } else sgt[x]=sgt[2*x]; x=x/2; } } signed main(){ int n; cin>>n; for(int i=N;i<2*N;i++) sgt[i]=make_pair(0,i-N); for(int i=0;i<n;i++){ cin>>sgt[i+N].first; } string s; cin>>s; int jj=0; for(int i=0;i<s.length();i++) if(s[i]=='M') jj=i; int ans=1000000000ll; for(int k=0;k<s.length()-jj-1;k++){ pa z=sgtmin(k,k+jj+1); ans=min(z.first,ans); } cout<<ans<<endl; // printf("%.10f\n",ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Compression |
User | smiken |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 3566 Byte |
Status | WA |
Exec Time | 54 ms |
Memory | 4608 KB |
Judge Result
Set Name | Sample | subtask1 | subtask2 | All | ||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 400 | 0 / 800 | 0 / 200 | ||||||||||||||
Status |
|
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt |
subtask1 | sample_2.txt, subtask_1.2_1.txt, subtask_1.2_2.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
subtask2 | sample_1.txt, subtask_1.2_1.txt, subtask_1.2_2.txt, subtask_2_1.txt, subtask_2_10.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt |
All | sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt, 2_1.txt, 2_2.txt, subtask_1.2_1.txt, subtask_1.2_2.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt, subtask_2_1.txt, subtask_2_10.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt, subtask_3_1.txt, subtask_3_10.txt, subtask_3_11.txt, subtask_3_12.txt, subtask_3_13.txt, subtask_3_14.txt, subtask_3_15.txt, subtask_3_16.txt, subtask_3_17.txt, subtask_3_18.txt, subtask_3_19.txt, subtask_3_2.txt, subtask_3_20.txt, subtask_3_21.txt, subtask_3_3.txt, subtask_3_4.txt, subtask_3_5.txt, subtask_3_6.txt, subtask_3_7.txt, subtask_3_8.txt, subtask_3_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
2_1.txt | WA | 7 ms | 4352 KB |
2_2.txt | WA | 7 ms | 4352 KB |
sample_1.txt | WA | 7 ms | 4352 KB |
sample_2.txt | AC | 7 ms | 4352 KB |
sample_3.txt | WA | 7 ms | 4352 KB |
sample_4.txt | WA | 7 ms | 4352 KB |
subtask_1.2_1.txt | WA | 7 ms | 4352 KB |
subtask_1.2_2.txt | WA | 7 ms | 4352 KB |
subtask_1_1.txt | WA | 52 ms | 4608 KB |
subtask_1_10.txt | WA | 47 ms | 4608 KB |
subtask_1_2.txt | WA | 41 ms | 4608 KB |
subtask_1_3.txt | WA | 37 ms | 4608 KB |
subtask_1_4.txt | WA | 39 ms | 4608 KB |
subtask_1_5.txt | WA | 11 ms | 4352 KB |
subtask_1_6.txt | WA | 54 ms | 4608 KB |
subtask_1_7.txt | WA | 7 ms | 4352 KB |
subtask_1_8.txt | WA | 48 ms | 4608 KB |
subtask_1_9.txt | WA | 47 ms | 4608 KB |
subtask_2_1.txt | WA | 38 ms | 4608 KB |
subtask_2_10.txt | WA | 37 ms | 4608 KB |
subtask_2_2.txt | WA | 37 ms | 4608 KB |
subtask_2_3.txt | WA | 41 ms | 4608 KB |
subtask_2_4.txt | WA | 37 ms | 4608 KB |
subtask_2_5.txt | WA | 7 ms | 4352 KB |
subtask_2_6.txt | WA | 7 ms | 4352 KB |
subtask_2_7.txt | WA | 7 ms | 4352 KB |
subtask_2_8.txt | WA | 37 ms | 4608 KB |
subtask_2_9.txt | WA | 13 ms | 4352 KB |
subtask_3_1.txt | WA | 37 ms | 4608 KB |
subtask_3_10.txt | WA | 50 ms | 4608 KB |
subtask_3_11.txt | WA | 37 ms | 4608 KB |
subtask_3_12.txt | WA | 37 ms | 4608 KB |
subtask_3_13.txt | WA | 38 ms | 4608 KB |
subtask_3_14.txt | WA | 37 ms | 4608 KB |
subtask_3_15.txt | WA | 37 ms | 4608 KB |
subtask_3_16.txt | WA | 37 ms | 4608 KB |
subtask_3_17.txt | WA | 39 ms | 4608 KB |
subtask_3_18.txt | WA | 37 ms | 4608 KB |
subtask_3_19.txt | WA | 37 ms | 4608 KB |
subtask_3_2.txt | WA | 37 ms | 4608 KB |
subtask_3_20.txt | WA | 37 ms | 4608 KB |
subtask_3_21.txt | WA | 37 ms | 4608 KB |
subtask_3_3.txt | WA | 10 ms | 4352 KB |
subtask_3_4.txt | WA | 34 ms | 4608 KB |
subtask_3_5.txt | WA | 31 ms | 4608 KB |
subtask_3_6.txt | WA | 37 ms | 4608 KB |
subtask_3_7.txt | WA | 37 ms | 4608 KB |
subtask_3_8.txt | WA | 37 ms | 4608 KB |
subtask_3_9.txt | WA | 37 ms | 4608 KB |