Codeforces Round #423 (Div. 2 Archive

#include <iostream> #include <algorithm> #include <cmath> #include <cstring> #include <cstdlib> #include <cstdio> #include <map> #include <ctime> #include <vector> #define INF 2000000000 #define N 200010 using namespace std; bool in_MST; int jump , maxl , fa; …

#include <cstdio> int main(){ int n, k; scanf(“%d%d”, &n, &k); int l = (n – 2) / k + 1; printf(“%d\n”, 2 * l – ((n – 1) % k == 1)); for(int i = …

#include<bits/stdc++.h> using namespace std; const int maxn=2e6+5; int main() { char a={}; int n,k,i; cin>>n; while(n–){ string x; cin>>x>>k; int t,len=x.size(),tt=-len; while(k–){ scanf(“%d”,&t); for(i=max(0,tt+len-t);i<len;i++) a=x; tt=t; } } for(i=maxn-1;!a;) i–; for(int j=1;j<=i;j++) putchar(a?a:’a’); return 0; …

#include <iostream> using namespace std; int main() { int n,a,b,bg=0,d=0,x; cin>>n>>a>>b; while(n–){ cin>>x; if(x==1) {if(a)a–; else if(b)b–,bg++; else if(bg)bg–; else d++; } else {if(b)b–;else d+=2; } } cout<<d; }