Skip to content

Commit 82e4807

Browse files
NatanGarciasNatanGarcias
committed
more problems solved
1 parent 9399397 commit 82e4807

File tree

32 files changed

+2727
-0
lines changed

32 files changed

+2727
-0
lines changed

‎Codeforces/Educational/Educational Codeforces Round 101 (Rated for Div. 2)/1469A.cpp

Lines changed: 51 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,51 @@
1+
#include<bits/stdc++.h>
2+
using namespace std;
3+
4+
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { os << "{"; for (typename vector<T>::const_iterator vi = v.begin(); vi != v.end(); ++vi) { if (vi != v.begin()) os << ", "; os << *vi; } os << "}"; return os; }
5+
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { os << '(' << p.first << ", " << p.second << ')'; return os; }
6+
7+
typedef long long ll;
8+
typedef long double ld;
9+
typedef pair<int,int> pii;
10+
11+
#define optimize ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
12+
#define endl "\n"
13+
14+
#define fi first
15+
#define se second
16+
#define pb push_back
17+
18+
#define sz(x) (ll)(x.size())
19+
#define all(x) x.begin(),x.end()
20+
#define ms(x,a) memset(x,a,sizeof(x))
21+
22+
#define INF 0x3f3f3f3f
23+
#define INFLL 0x3f3f3f3f3f3f3f3f
24+
25+
#define mod 1000000007LL
26+
#define MAXN 200010
27+
28+
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
29+
ll T,N,M,K;
30+
string s;
31+
32+
void solve(){
33+
34+
if(s.size()%2 == 0 && s[0] != ')' && s[s.size()-1] != '(') cout << "YES\n";
35+
else cout << "NO\n";
36+
}
37+
38+
int main(){
39+
40+
optimize;
41+
42+
cin >> T;
43+
44+
while(T--){
45+
cin >> s;
46+
47+
solve();
48+
}
49+
50+
return 0;
51+
}

‎Codeforces/Educational/Educational Codeforces Round 101 (Rated for Div. 2)/1469B.cpp

Lines changed: 67 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,67 @@
1+
#include<bits/stdc++.h>
2+
using namespace std;
3+
4+
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { os << "{"; for (typename vector<T>::const_iterator vi = v.begin(); vi != v.end(); ++vi) { if (vi != v.begin()) os << ", "; os << *vi; } os << "}"; return os; }
5+
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { os << '(' << p.first << ", " << p.second << ')'; return os; }
6+
7+
typedef long long ll;
8+
typedef long double ld;
9+
typedef pair<int,int> pii;
10+
11+
#define optimize ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
12+
#define endl "\n"
13+
14+
#define fi first
15+
#define se second
16+
#define pb push_back
17+
18+
#define sz(x) (ll)(x.size())
19+
#define all(x) x.begin(),x.end()
20+
#define ms(x,a) memset(x,a,sizeof(x))
21+
22+
#define INF 0x3f3f3f3f
23+
#define INFLL 0x3f3f3f3f3f3f3f3f
24+
25+
#define mod 1000000007LL
26+
#define MAXN 200010
27+
28+
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
29+
ll T,N,M,K;
30+
int A[MAXN], B[MAXN];
31+
32+
void solve(){
33+
34+
ll sumA = 0, sumB = 0;
35+
ll maxA = 0, maxB = 0;
36+
37+
for(int i=0;i<N;i++){
38+
sumA += A[i];
39+
maxA = max(maxA, sumA);
40+
}
41+
42+
for(int i=0;i<M;i++){
43+
sumB += B[i];
44+
maxB = max(maxB, sumB);
45+
}
46+
47+
cout << maxA + maxB << endl;
48+
}
49+
50+
int main(){
51+
52+
optimize;
53+
54+
cin >> T;
55+
56+
while(T--){
57+
cin >> N;
58+
for(int i=0;i<N;i++) cin >> A[i];
59+
60+
cin >> M;
61+
for(int i=0;i<M;i++) cin >> B[i];
62+
63+
solve();
64+
}
65+
66+
return 0;
67+
}

‎Codeforces/Educational/Educational Codeforces Round 101 (Rated for Div. 2)/1469C.cpp

Lines changed: 73 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,73 @@
1+
#include<bits/stdc++.h>
2+
using namespace std;
3+
4+
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { os << "{"; for (typename vector<T>::const_iterator vi = v.begin(); vi != v.end(); ++vi) { if (vi != v.begin()) os << ", "; os << *vi; } os << "}"; return os; }
5+
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { os << '(' << p.first << ", " << p.second << ')'; return os; }
6+
7+
typedef long long ll;
8+
typedef long double ld;
9+
typedef pair<ll,ll> pii;
10+
11+
#define optimize ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
12+
#define endl "\n"
13+
14+
#define fi first
15+
#define se second
16+
#define pb push_back
17+
18+
#define sz(x) (ll)(x.size())
19+
#define all(x) x.begin(),x.end()
20+
#define ms(x,a) memset(x,a,sizeof(x))
21+
22+
#define INF 0x3f3f3f3f
23+
#define INFLL 0x3f3f3f3f3f3f3f3f
24+
25+
#define mod 1000000007LL
26+
#define MAXN 200010
27+
28+
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
29+
ll T,N,M,K;
30+
ll A[MAXN];
31+
32+
void solve(){
33+
34+
pii p;
35+
36+
for(int i=0;i<N-1;i++){
37+
if(!i) p = pii(A[i],A[i]);
38+
else{
39+
if(p.fi- 2*K +2 > A[i] || p.se+K-1 < A[i]){
40+
cout << "NO\n";
41+
return;
42+
}
43+
else{
44+
p.fi = max(A[i], p.fi - K+1);
45+
p.se = min(A[i] + K -1, p.se + K-1);
46+
}
47+
}
48+
}
49+
50+
if(p.fi- K+1 > A[N-1] || p.se+K-1 < A[N-1]){
51+
cout << "NO\n";
52+
}
53+
else{
54+
cout << "YES\n";
55+
}
56+
}
57+
58+
int main(){
59+
60+
optimize;
61+
62+
cin >> T;
63+
64+
while(T--){
65+
cin >> N >> K;
66+
67+
for(int i=0;i<N;i++) cin >> A[i];
68+
69+
solve();
70+
}
71+
72+
return 0;
73+
}

‎Codeforces/Educational/Educational Codeforces Round 101 (Rated for Div. 2)/1469D.cpp

Lines changed: 86 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,86 @@
1+
#include<bits/stdc++.h>
2+
using namespace std;
3+
4+
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { os << "{"; for (typename vector<T>::const_iterator vi = v.begin(); vi != v.end(); ++vi) { if (vi != v.begin()) os << ", "; os << *vi; } os << "}"; return os; }
5+
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { os << '(' << p.first << ", " << p.second << ')'; return os; }
6+
7+
typedef long long ll;
8+
typedef long double ld;
9+
typedef pair<int,int> pii;
10+
11+
#define optimize ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
12+
#define endl "\n"
13+
14+
#define fi first
15+
#define se second
16+
#define pb push_back
17+
18+
#define sz(x) (ll)(x.size())
19+
#define all(x) x.begin(),x.end()
20+
#define ms(x,a) memset(x,a,sizeof(x))
21+
22+
#define INF 0x3f3f3f3f
23+
#define INFLL 0x3f3f3f3f3f3f3f3f
24+
25+
#define mod 1000000007LL
26+
#define MAXN 200010
27+
28+
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
29+
ll T,N,M,K;
30+
31+
bool pos[MAXN];
32+
33+
void pre(){
34+
pos[2] = true;
35+
pos[4] = true;
36+
pos[16] = true;
37+
pos[256] = true;
38+
pos[65536] = true;
39+
pos[200000] = true;
40+
pos[N] = true;
41+
}
42+
43+
void solve(){
44+
45+
vector<pii> resp;
46+
vector<int> nums;
47+
48+
resp.reserve(N+5);
49+
50+
for(int i=2;i<=N;i++){
51+
if(!pos[i]) resp.pb(pii(i,N));
52+
else{
53+
nums.pb(i);
54+
}
55+
}
56+
57+
while(nums.size() > 1){
58+
int u = nums.back();
59+
nums.pop_back();
60+
61+
resp.pb(pii(u,nums.back()));
62+
resp.pb(pii(u,nums.back()));
63+
}
64+
65+
cout << resp.size() << endl;
66+
for(int i=0;i<resp.size();i++) cout << resp[i].fi << " " << resp[i].se << endl;
67+
}
68+
69+
int main(){
70+
71+
optimize;
72+
73+
cin >> T;
74+
75+
while(T--){
76+
cin >> N;
77+
78+
pre();
79+
80+
solve();
81+
82+
pos[N] = false;
83+
}
84+
85+
return 0;
86+
}

0 commit comments

Comments
 (0)