added 1914 a,b,c
This commit is contained in:
ShazidMahsrafi
parent
29fa4d39c5
commit
02f9f95558
85
Codes/1914A Problemsolving Log/1914A.cpp
Normal file
85
Codes/1914A Problemsolving Log/1914A.cpp
Normal file
@ -0,0 +1,85 @@
|
|||||||
|
#include<bits/stdc++.h>
|
||||||
|
using namespace std;
|
||||||
|
|
||||||
|
// Short forms
|
||||||
|
#define int long long
|
||||||
|
#define ll long long
|
||||||
|
#define endl '\n'
|
||||||
|
#define ff first
|
||||||
|
#define ss second
|
||||||
|
#define pb push_back
|
||||||
|
#define all(x) x.begin(), x.end()
|
||||||
|
#define sz(x) (int)(x).size()
|
||||||
|
|
||||||
|
// Outputs
|
||||||
|
#define yes cout<<"YES"<<endl
|
||||||
|
#define no cout<<"NO"<<endl
|
||||||
|
|
||||||
|
// Constants
|
||||||
|
#define PI 3.141592653589793238
|
||||||
|
#define INF LONG_LONG_MAX
|
||||||
|
#define MOD 1e9+7
|
||||||
|
|
||||||
|
// Faster Input Output
|
||||||
|
#define FAST_IO (ios_base:: sync_with_stdio(false),cin.tie(NULL));
|
||||||
|
|
||||||
|
// Maths
|
||||||
|
ll fact(ll n) { if(n==0) return 1; ll res = 1; for (ll i = 2; i <= n; i++) res = res * i; return res; }
|
||||||
|
ll nPr(ll n, ll r) { return fact(n) / fact(n - r); }
|
||||||
|
ll nCr(ll n, ll r) { return fact(n) / (fact(r) * fact(n - r)); }
|
||||||
|
ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }
|
||||||
|
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b);}
|
||||||
|
ll mypow(ll a, ll b) { ll ans = 1; while(b){ if (b&1) ans = (ans*a) ; b /= 2; a = (a*a); } return ans; }
|
||||||
|
bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i <= sqrt(n); i++) if(n % i == 0) return false; return true; }
|
||||||
|
|
||||||
|
//Debugging
|
||||||
|
#ifndef ONLINE_JUDGE
|
||||||
|
#define dbg(x) cerr << #x <<" "; _print(x); cerr << endl;
|
||||||
|
#define dbgin(x) cerr << #x <<" "; _print(x); cerr << ";"<<endl;
|
||||||
|
#else
|
||||||
|
#define dbg(x)
|
||||||
|
#define dbgin(x)
|
||||||
|
#endif
|
||||||
|
|
||||||
|
void _print(int t) {cerr << t;}void _print(string t) {cerr << t;}void _print(char t) {cerr << t;}
|
||||||
|
void _print(long double t) {cerr << t;}void _print(double t) {cerr << t;}void _print(unsigned ll t) {cerr << t;}
|
||||||
|
template <class T, class V> void _print(pair <T, V> p);
|
||||||
|
template <class T> void _print(vector <T> v);template <class T> void _print(set <T> v);
|
||||||
|
template <class T, class V> void _print(map <T, V> v);template <class T> void _print(multiset <T> v);
|
||||||
|
template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.first); cerr << ","; _print(p.second); cerr << "}";}
|
||||||
|
template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
|
||||||
|
template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
|
||||||
|
template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
|
||||||
|
template <class T> void _print(unordered_set <T> v) {cerr<<"[ "; for(T i : v) {_print(i); cerr<<" ";} cerr<<"]";}
|
||||||
|
template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
|
||||||
|
template <class T, class V> void _print(multimap <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
|
||||||
|
template <class T, class V> void _print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
|
||||||
|
|
||||||
|
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
|
||||||
|
|
||||||
|
void solve()
|
||||||
|
{
|
||||||
|
int n;
|
||||||
|
string s;
|
||||||
|
cin>>n>>s;
|
||||||
|
vector<int>cnt(26,0);
|
||||||
|
for(int i=0; i<n; ++i)
|
||||||
|
{
|
||||||
|
cnt[s[i]-'A']++;
|
||||||
|
}
|
||||||
|
int ct=0;
|
||||||
|
for(int i=0; i<sz(cnt); ++i)
|
||||||
|
{
|
||||||
|
if(cnt[i]>=i+1)
|
||||||
|
ct++;
|
||||||
|
}
|
||||||
|
cout<<ct<<endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
int32_t main()
|
||||||
|
{
|
||||||
|
FAST_IO;
|
||||||
|
int TC = 1;
|
||||||
|
cin >> TC;
|
||||||
|
while (TC--) solve();
|
||||||
|
}
|
||||||
82
Codes/1914B Preparing for the Contest/1914B.cpp
Normal file
82
Codes/1914B Preparing for the Contest/1914B.cpp
Normal file
@ -0,0 +1,82 @@
|
|||||||
|
#include<bits/stdc++.h>
|
||||||
|
using namespace std;
|
||||||
|
|
||||||
|
// Short forms
|
||||||
|
#define int long long
|
||||||
|
#define ll long long
|
||||||
|
#define endl '\n'
|
||||||
|
#define ff first
|
||||||
|
#define ss second
|
||||||
|
#define pb push_back
|
||||||
|
#define all(x) x.begin(), x.end()
|
||||||
|
#define sz(x) (int)(x).size()
|
||||||
|
|
||||||
|
// Outputs
|
||||||
|
#define yes cout<<"YES"<<endl
|
||||||
|
#define no cout<<"NO"<<endl
|
||||||
|
|
||||||
|
// Constants
|
||||||
|
#define PI 3.141592653589793238
|
||||||
|
#define INF LONG_LONG_MAX
|
||||||
|
#define MOD 1e9+7
|
||||||
|
|
||||||
|
// Faster Input Output
|
||||||
|
#define FAST_IO (ios_base:: sync_with_stdio(false),cin.tie(NULL));
|
||||||
|
|
||||||
|
// Maths
|
||||||
|
ll fact(ll n) { if(n==0) return 1; ll res = 1; for (ll i = 2; i <= n; i++) res = res * i; return res; }
|
||||||
|
ll nPr(ll n, ll r) { return fact(n) / fact(n - r); }
|
||||||
|
ll nCr(ll n, ll r) { return fact(n) / (fact(r) * fact(n - r)); }
|
||||||
|
ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }
|
||||||
|
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b);}
|
||||||
|
ll mypow(ll a, ll b) { ll ans = 1; while(b){ if (b&1) ans = (ans*a) ; b /= 2; a = (a*a); } return ans; }
|
||||||
|
bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i <= sqrt(n); i++) if(n % i == 0) return false; return true; }
|
||||||
|
|
||||||
|
//Debugging
|
||||||
|
#ifndef ONLINE_JUDGE
|
||||||
|
#define dbg(x) cerr << #x <<" "; _print(x); cerr << endl;
|
||||||
|
#define dbgin(x) cerr << #x <<" "; _print(x); cerr << ";"<<endl;
|
||||||
|
#else
|
||||||
|
#define dbg(x)
|
||||||
|
#define dbgin(x)
|
||||||
|
#endif
|
||||||
|
|
||||||
|
void _print(int t) {cerr << t;}void _print(string t) {cerr << t;}void _print(char t) {cerr << t;}
|
||||||
|
void _print(long double t) {cerr << t;}void _print(double t) {cerr << t;}void _print(unsigned ll t) {cerr << t;}
|
||||||
|
template <class T, class V> void _print(pair <T, V> p);
|
||||||
|
template <class T> void _print(vector <T> v);template <class T> void _print(set <T> v);
|
||||||
|
template <class T, class V> void _print(map <T, V> v);template <class T> void _print(multiset <T> v);
|
||||||
|
template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.first); cerr << ","; _print(p.second); cerr << "}";}
|
||||||
|
template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
|
||||||
|
template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
|
||||||
|
template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
|
||||||
|
template <class T> void _print(unordered_set <T> v) {cerr<<"[ "; for(T i : v) {_print(i); cerr<<" ";} cerr<<"]";}
|
||||||
|
template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
|
||||||
|
template <class T, class V> void _print(multimap <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
|
||||||
|
template <class T, class V> void _print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
|
||||||
|
|
||||||
|
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
|
||||||
|
|
||||||
|
void solve()
|
||||||
|
{
|
||||||
|
int n,k;
|
||||||
|
cin>>n>>k;
|
||||||
|
vector<int>v(n);
|
||||||
|
for(int i=sz(v)-1; i>=0; --i)
|
||||||
|
{
|
||||||
|
v[n-i-1]=i+1;
|
||||||
|
}
|
||||||
|
dbg(v);
|
||||||
|
sort(v.begin(),v.begin()+k+1);
|
||||||
|
for(auto x:v)
|
||||||
|
cout<<x<<" ";
|
||||||
|
cout<<endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
int32_t main()
|
||||||
|
{
|
||||||
|
FAST_IO;
|
||||||
|
int TC = 1;
|
||||||
|
cin >> TC;
|
||||||
|
while (TC--) solve();
|
||||||
|
}
|
||||||
87
Codes/1914C Quests/1914C.cpp
Normal file
87
Codes/1914C Quests/1914C.cpp
Normal file
@ -0,0 +1,87 @@
|
|||||||
|
#include<bits/stdc++.h>
|
||||||
|
using namespace std;
|
||||||
|
|
||||||
|
// Short forms
|
||||||
|
#define int long long
|
||||||
|
#define ll long long
|
||||||
|
#define endl '\n'
|
||||||
|
#define ff first
|
||||||
|
#define ss second
|
||||||
|
#define pb push_back
|
||||||
|
#define all(x) x.begin(), x.end()
|
||||||
|
#define sz(x) (int)(x).size()
|
||||||
|
|
||||||
|
// Outputs
|
||||||
|
#define yes cout<<"YES"<<endl
|
||||||
|
#define no cout<<"NO"<<endl
|
||||||
|
|
||||||
|
// Constants
|
||||||
|
#define PI 3.141592653589793238
|
||||||
|
#define INF LONG_LONG_MAX
|
||||||
|
#define MOD 1e9+7
|
||||||
|
|
||||||
|
// Faster Input Output
|
||||||
|
#define FAST_IO (ios_base:: sync_with_stdio(false),cin.tie(NULL));
|
||||||
|
|
||||||
|
// Maths
|
||||||
|
ll fact(ll n) { if(n==0) return 1; ll res = 1; for (ll i = 2; i <= n; i++) res = res * i; return res; }
|
||||||
|
ll nPr(ll n, ll r) { return fact(n) / fact(n - r); }
|
||||||
|
ll nCr(ll n, ll r) { return fact(n) / (fact(r) * fact(n - r)); }
|
||||||
|
ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }
|
||||||
|
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b);}
|
||||||
|
ll mypow(ll a, ll b) { ll ans = 1; while(b){ if (b&1) ans = (ans*a) ; b /= 2; a = (a*a); } return ans; }
|
||||||
|
bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i <= sqrt(n); i++) if(n % i == 0) return false; return true; }
|
||||||
|
|
||||||
|
//Debugging
|
||||||
|
#ifndef ONLINE_JUDGE
|
||||||
|
#define dbg(x) cerr << #x <<" "; _print(x); cerr << endl;
|
||||||
|
#define dbgin(x) cerr << #x <<" "; _print(x); cerr << ";"<<endl;
|
||||||
|
#else
|
||||||
|
#define dbg(x)
|
||||||
|
#define dbgin(x)
|
||||||
|
#endif
|
||||||
|
|
||||||
|
void _print(int t) {cerr << t;}void _print(string t) {cerr << t;}void _print(char t) {cerr << t;}
|
||||||
|
void _print(long double t) {cerr << t;}void _print(double t) {cerr << t;}void _print(unsigned ll t) {cerr << t;}
|
||||||
|
template <class T, class V> void _print(pair <T, V> p);
|
||||||
|
template <class T> void _print(vector <T> v);template <class T> void _print(set <T> v);
|
||||||
|
template <class T, class V> void _print(map <T, V> v);template <class T> void _print(multiset <T> v);
|
||||||
|
template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.first); cerr << ","; _print(p.second); cerr << "}";}
|
||||||
|
template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
|
||||||
|
template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
|
||||||
|
template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
|
||||||
|
template <class T> void _print(unordered_set <T> v) {cerr<<"[ "; for(T i : v) {_print(i); cerr<<" ";} cerr<<"]";}
|
||||||
|
template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
|
||||||
|
template <class T, class V> void _print(multimap <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
|
||||||
|
template <class T, class V> void _print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
|
||||||
|
|
||||||
|
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
|
||||||
|
|
||||||
|
void solve()
|
||||||
|
{
|
||||||
|
int n,k;
|
||||||
|
cin>>n>>k;
|
||||||
|
vector<int>a(n),pre(n),b(n);
|
||||||
|
for(int i=0; i<n; ++i)
|
||||||
|
cin>>a[i];
|
||||||
|
pre[0]=a[0];
|
||||||
|
for(int i=1; i<n; ++i)
|
||||||
|
pre[i]=a[i]+pre[i-1];
|
||||||
|
int mx=0,ans=0;
|
||||||
|
for(int i=0; i<n; ++i)
|
||||||
|
{
|
||||||
|
cin>>b[i];
|
||||||
|
mx=max(mx,b[i]);
|
||||||
|
if(i<k)
|
||||||
|
ans=max(ans,pre[i]+mx*(k-i-1));
|
||||||
|
}
|
||||||
|
cout<<ans<<endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
int32_t main()
|
||||||
|
{
|
||||||
|
FAST_IO;
|
||||||
|
int TC = 1;
|
||||||
|
cin >> TC;
|
||||||
|
while (TC--) solve();
|
||||||
|
}
|
||||||
@ -210,6 +210,9 @@ This repository contains my solutions of Codeforces problems. They are in C++ la
|
|||||||
| 1912L | LOL Lovers | [Question](https://codeforces.com/problemset/problem/1912/L) | [Solution]
|
| 1912L | LOL Lovers | [Question](https://codeforces.com/problemset/problem/1912/L) | [Solution]
|
||||||
| 1913A | Rating Increase | [Question](https://codeforces.com/problemset/problem/1913/A) | [Solution]
|
| 1913A | Rating Increase | [Question](https://codeforces.com/problemset/problem/1913/A) | [Solution]
|
||||||
| 1913B | Swap and Delete | [Question](https://codeforces.com/problemset/problem/1913/B) | [Solution]
|
| 1913B | Swap and Delete | [Question](https://codeforces.com/problemset/problem/1913/B) | [Solution]
|
||||||
|
| 1914A | Problemsolving Log | [Question](https://codeforces.com/problemset/problem/1914/A) | [Solution]
|
||||||
|
| 1914B | Preparing for the Contest | [Question](https://codeforces.com/problemset/problem/1914/B) | [Solution]
|
||||||
|
| 1914C | Quests | [Question](https://codeforces.com/problemset/problem/1914/C) | [Solution]
|
||||||
|
|
||||||
</div>
|
</div>
|
||||||
|
|
||||||
|
|||||||
Loading…
Reference in New Issue
Block a user