EducationalCodeforcesRound43(RatedforDiv.2)

 1 #include
 2 using namespace std;
 3 #define lson l,mid,rt<<1
 4 #define rson mid+1,r,rt<<1|1
 5 #define IT set::iterator
 6 #define sqr(x) ((x)*(x))
 7 #define pb push_back
 8 #define eb emplace_back
 9 #define maxn 200005
10 #define eps 1e-8
11 #define pi acos(-1.0)
12 #define rep(k,i,j) for(int k=i;k13 typedef long long ll;
14 typedef pair<int,int> pii;
15 typedef pairpll;
16 typedef pairint> pli;
17 typedef pairint,string>,pii> ppp;
18 typedef unsigned long long ull;
19 const long long MOD=998244353;
20 const double oula=0.57721566490153286060651209;
21 using namespace std;
22 
23 
24 
25 int main(){
26     std::ios::sync_with_stdio(false);
27     int n;
28     string str;
29     cin>>n>>str;
30     if(str=="0") cout<<0<<endl;
31     else {
32         int co=0;
33         for(int i=0;i){
34             if(str[i]=='0') co++;
35         }
36         cout<<1;
37         for(int i=0;i){
38             cout<<0;
39         }
40         cout<<endl;
41     }
42 }

 1 #include
 2 using namespace std;
 3 #define lson l,mid,rt<<1
 4 #define rson mid+1,r,rt<<1|1
 5 #define IT set::iterator
 6 #define sqr(x) ((x)*(x))
 7 #define pb push_back
 8 #define eb emplace_back
 9 #define maxn 200005
10 #define eps 1e-8
11 #define pi acos(-1.0)
12 #define rep(k,i,j) for(int k=i;k13 typedef long long ll;
14 typedef pair<int,int> pii;
15 typedef pairpll;
16 typedef pairint> pli;
17 typedef pairint,string>,pii> ppp;
18 typedef unsigned long long ull;
19 const long long MOD=998244353;
20 const double oula=0.57721566490153286060651209;
21 using namespace std;
22 
23 
24 int main(){
25     std::ios::sync_with_stdio(false);
26     ll n,m,k;
27     cin>>n>>m>>k;
28     if (k<n) {
29         cout<1<<" "<<1<<endl;
30         return 0;
31     }
32     k-=n-1;
33     if (k==0) {
34         cout<" "<<1;
35         return 0;
36     }
37     k-=1;
38     ll l=k/(m-1);
39     k%=(m-1);
40     if((n-l)%2==0) cout<" "<2<<endl;
41     else cout<" "<endl;
42 }

 1 #include
 2 using namespace std;
 3 #define lson l,mid,rt<<1
 4 #define rson mid+1,r,rt<<1|1
 5 #define IT set::iterator
 6 #define sqr(x) ((x)*(x))
 7 #define pb push_back
 8 #define eb emplace_back
 9 #define maxn 200005
10 #define eps 1e-8
11 #define pi acos(-1.0)
12 #define rep(k,i,j) for(int k=i;k13 typedef long long ll;
14 typedef pair<int,int> pii;
15 typedef pairpll;
16 typedef pairint> pli;
17 typedef pairint,string>,pii> ppp;
18 typedef unsigned long long ull;
19 const long long MOD=998244353;
20 const double oula=0.57721566490153286060651209;
21 using namespace std;
22 
23 
24 vectorint,pair<int,int> > >ve;
25 
26 bool cmp(pair<int,pair<int,int> > a,pair<int,pair<int,int> > b){
27     if(a.second.first==b.second.first) return a.second.second>b.second.second;
28     return a.second.first<b.second.first;
29 }
30 
31 int main(){
32     std::ios::sync_with_stdio(false);
33     int n;
34     cin>>n;
35     int x,y;
36     for(int i=1;i<=n;i++){
37         cin>>x>>y;
38         ve.pb({i,{x,y}});
39     }
40     sort(ve.begin(),ve.end(),cmp);
41     int L=ve[0].second.first,R=ve[0].second.second,pos=ve[0].first;
42     int flag=0;
43     for(int i=1;i){
44         if(L<=ve[i].second.first&&R>=ve[i].second.second){
45             cout<" "<endl;
46             return 0;
47         }
48         L=ve[i].second.first,R=ve[i].second.second,pos=ve[i].first;
49     }
50     if(!flag){
51         cout<<-1<<" "<<-1<<endl;
52     }
53 }

 1 #include
 2 using namespace std;
 3 #define lson l,mid,rt<<1
 4 #define rson mid+1,r,rt<<1|1
 5 #define IT set::iterator
 6 #define sqr(x) ((x)*(x))
 7 #define pb push_back
 8 #define eb emplace_back
 9 #define maxn 200005
10 #define eps 1e-8
11 #define pi acos(-1.0)
12 #define rep(k,i,j) for(int k=i;k13 typedef long long ll;
14 typedef pair<int,int> pii;
15 typedef pairpll;
16 typedef pairint> pli;
17 typedef pairint,string>,pii> ppp;
18 typedef unsigned long long ull;
19 const long long MOD=998244353;
20 const double oula=0.57721566490153286060651209;
21 using namespace std;
22 
23 
24 vectorve;
25 int d[305];
26 
27 int main(){
28     std::ios::sync_with_stdio(false);
29     int n;
30     cin>>n;
31     for(int i=1;i<=n;i++) cin>>d[i];
32     int L=1,R=n;
33     int co=0;
34     while(L<=R){
35         for(int i=d[L-1]+1;i<=d[L];i++){
36             for(int j=i+1;j<=d[R]+1;j++){
37                 ve.pb({i,j});
38                 co++;
39             }
40         }
41         L++;
42         R--;
43     }
44     cout<endl;
45     for(int i=0;i){
46         cout<" "<endl;
47     }
48 }

 1 #include
 2 using namespace std;
 3 #define lson l,mid,rt<<1
 4 #define rson mid+1,r,rt<<1|1
 5 #define IT set::iterator
 6 #define sqr(x) ((x)*(x))
 7 #define pb push_back
 8 #define eb emplace_back
 9 #define maxn 200005
10 #define eps 1e-8
11 #define pi acos(-1.0)
12 #define rep(k,i,j) for(int k=i;k13 typedef long long ll;
14 typedef pair<int,int> pii;
15 typedef pairpll;
16 typedef pairint> pli;
17 typedef pairint,string>,pii> ppp;
18 typedef unsigned long long ull;
19 const long long MOD=998244353;
20 const double oula=0.57721566490153286060651209;
21 using namespace std;
22 
23 ll n,a,b;
24 vectorve;
25 
26 bool cmp(pll a,pll b){
27     return a.first-a.second>b.first-b.second;
28 }
29 
30 int main(){
31     std::ios::sync_with_stdio(false);
32     ll x,y;
33     cin>>n>>a>>b;
34     b=min(b,n);
35     for(int i=1;i<=n;i++){
36         cin>>x>>y;
37         ve.pb({x,y});
38     }
39     sort(ve.begin(),ve.end(),cmp);
40     ll sum=0;
41     for(int i=0;i){
42         sum+=max(ve[i].first,ve[i].second);
43     }
44     for(int i=b;i){
45         sum+=ve[i].second;
46     }
47     ll ans=sum;
48     for(int i=0;i){
49         ans=max(ans,sum-max(ve[i].first,ve[i].second)+(ve[i].first<<a));
50     }
51     sum-=max(ve[b-1].first,ve[b-1].second)-ve[b-1].second;
52     if(b){
53         for(int i=b;i){
54             ans=max(ans,sum-ve[i].second+(ve[i].first<<a));
55         }
56     }
57     cout<endl;
58 }