草体にぼ日記

だらだらと

2019-11-18から1日間の記事一覧

ABC043B バイナリハックイージー / Unhappy Hacking (ABC Edit)

B - バイナリハックイージー / Unhappy Hacking (ABC Edit)Submission #8513243 - AtCoder Beginner Contest 043 int main() { cout <<setprecision(10); string s ; cin >> s; string ans ="" ; rep(i,s.size()){ char c = s[i]; if(c == 'B' && ans.size()>0){ ans.pop_back(); } else if(c!='</setprecision(10);>…

ARC091C Flip,Flip, and Flip......

C - Flip,Flip, and Flip......提出AC Submission #8512938 - AtCoder Regular Contest 091 int main() { cout <<setprecision(10); ll n , m ; cin >> n >> m ; ll ans = max((ll)0, (n-2)*(m-2)); if(n==1||m==1){ if(n*m == 1){ ans = 1; }else if( n * m == 2){ ans = 0; }else ans = n*m -2</setprecision(10);>…

AGC015A - A+...+B Problem

A - A+...+B Problem提出AC Submission #8512600 - AtCoder Grand Contest 015 int main() { cout <<setprecision(10); ll n , a, b; cin >> n >> a >> b; ll ans = 1; if(n == 1){ if(a != b){ ans = 0 ;//要素は1個なのに、最小と最大が違うようなものは存在しない } } else if(n >= 2){ if(a > </setprecision(10);>…

ARC059C - いっしょ / Be Together

ずっとあなたと一緒(メンヘラ)C - いっしょ / Be Together提出AC Submission #8512086 - AtCoder Regular Contest 059 int main() { cout <<setprecision(10); ll n ; cin >> n ; vector<ll> a(n); rep(i,n) cin >>a[i]; ll ans = 100100100; for(int i = -100 ; i <= 100 ; i++){ ll tmp = 0;</ll></setprecision(10);>…

ABC047C -一次元リバーシ /1D Reversi

C - 一次元リバーシ / 1D Reversi提出AC Submission #8511739 - AtCoder Beginner Contest 047 int main() { cout <<setprecision(10); string S; cin >> S; int n = S.size(); int count = 0; For(i,1,n){ if(S[i] != S[i-1]){ count ++ ; } } cout << count << endl; }解法黒と白の区画がいく</setprecision(10);>…

AGC006A Prefix and Suffix

Prefix 意味 前に置くもの、接頭辞、敬称、 Suffix 末尾に転化したもの、接尾辞、添え字、拡張子 A - Prefix and Suffix 提出AC Submission #8511255 - AtCoder Grand Contest 006 int main() { cout <<setprecision(10); ll n ; string s , t; cin >> n >> s >> t; int additional = n; int j = 0 ; for(i</setprecision(10);>…

CODE FESTIVAL 2017 qual B Problem Set

B - Problem Set提出AC↓ Submission #8508519 - CODE FESTIVAL 2017 qual B int main() { cout <<setprecision(10); ll n ; cin >> n; vector<ll> D(n); rep(i,n){ cin >> D[i]; } SORT(D); ll m ; cin >> m; vector<ll> T(m); rep(i,m) cin >> T[i]; SORT(T); ll start = 0 ; ll count = 0; rep(i,m</ll></ll></setprecision(10);>…

ARC069C SccPuzzle

C - Scc Puzzle提出AC Submission #8507588 - AtCoder Regular Contest 069 int main() { cout <<setprecision(10); ll s , c ; cin >> s >> c; ll ans = 0; if(c < s * 2){ ans = c / 2; }else if(c < s * 2 + 4){//sをcにすることはできない ans = s; }else{ //cをsにしたほうがいい。c4でscc</setprecision(10);>…

ABC116C Grand Garden

C - Grand Garden 提出AC Submission #8507430 - AtCoder Beginner Contest 116 int main() { cout <<setprecision(10); ll n ; cin >> n ; vector<int> a(n); rep(i,n) cin >> a[i]; int active = 0 ; int ans = 0; rep(i,n){ if(active < a[i]){ ans += a[i] - active; active = a[i]; } else i</int></setprecision(10);>…

AGC013A Sorted Arrays

A - Sorted Arrays↓ 提出AC Submission #8506903 - AtCoder Grand Contest 013 int main() { cout <<setprecision(10); int n ; cin >> n; vector<int> a(n); rep(i,n) cin >> a[i]; bool up = false , down = false; int ans = 1; for(int i = 1; i< n ; i++){ if(up){ if(a[i-1] > a[i]){ up = d</int></setprecision(10);>…