code_file1
stringlengths 80
4k
| code_file2
stringlengths 91
4k
| similar_or_different
int64 0
1
|
|---|---|---|
#include <iostream>
#include <vector>
#include <string>
using namespace std;
char Decryption(int k, char s) {
char station[] = {'a','b','c','d','e','f','g','h','i','j','k','l','m',
'n','o','p','q','r','s','t','u','v','w','x','y','z',
'A','B','C','D','E','F','G','H','I','J','K','L','M',
'N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
int num;
for(int i = 0; i < 52; i++) {
if(s >= 'a' && s <= 'z')
num = s - 'a';
else
num = s - 39;
}
return station[(52 + num - k) % 52];
}
int main() {
vector<int> K;
int n;
string s_in;
string s_out;
while(1) {
cin >> n;
if(n == 0)
break;
for(int i = 0; i < n; i++) {
int k;
cin >> k;
K.push_back(k);
}
cin >> s_in;
for(int i = 0; i < s_in.size(); i++) {
s_out += Decryption(K[i%n], s_in[i]);
}
cout << s_out << endl;
s_out.erase();
K.clear();
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define lp(i,n) for(int i=0;i<n;i++)
int main(){
while(1){
int n;
cin>>n;
if(n==0) break;
int a[100];
lp(i,n){
cin>>a[i];
}
int count=0;
char x;
scanf("%c",&x);
while(1){
scanf("%c",&x);
if('A'<=x&&'z'>=x){
lp(i,a[count]){
x--;
if(x==64) x=122;
if(x==96) x=90;
}
cout<<x;
count++;
if(count==n) count=0;
}
else break;
}
cout<<endl;
}
return 0;
}
| 1 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
map<string, int>mp;
for (int i = 0; i < N; ++i) {
string s;
cin >> s;
mp[s]++;
}
int M;
cin >> M;
for (int i = 0; i < M; ++i) {
string s;
cin >> s;
mp[s]--;
}
int ans = 0;
for (auto x : mp) {
ans = max(ans, max(0, x.second));
}
cout << ans << endl;
return 0;
}
| //高知能系Vtuberの高井茅乃です。
//Twitter: https://twitter.com/takaichino
//YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INTINF 1999999999
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 1000000007
int main() {
ll ans = 0;
int tmp;
int n;
cin >> n;
map<int, int> o, e;
REP(i, n){
cin >> tmp;
if(i %2 == 0) e[tmp] ++;
else o[tmp]++;
}
vector< pair <int, int >> od , ev;
for(auto it = e.begin(); it != e.end(); it++){
ev.push_back(make_pair(it->second, it->first));
}
for(auto it = o.begin(); it != o.end(); it++){
od.push_back(make_pair(it->second, it->first));
}
ev.push_back(make_pair(0, -1));
od.push_back(make_pair(0, -1));
sort(ev.begin(), ev.end(), greater<pair<int, int>>());
sort(od.begin(), od.end(), greater<pair<int, int>>());
if(ev[0].second != od[0].second){
cout << n - ev[0].first - od[0].first;
}
else{
cout << min(n - ev[1].first - od[0].first, n - ev[0].first - od[1].first);
}
//cout << ans << endl;
} | 0 |
# include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); };
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); };
typedef pair<LL, LL> pii;
const int vy[] = { -1, -1, -1, 0, 1, 1, 1, 0 }, vx[] = { -1, 0, 1, 1, 1, 0, -1, -1 };
const int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(LL n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(LL n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
LL gcd(LL a, LL b) { if (b == 0)return a; return gcd(b, a%b); };
LL lcm(LL a, LL b) { LL g = gcd(a, b); return a / g*b; };
# define ALL(qpqpq) (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw) sort(ALL((wpwpw)));(wpwpw).erase(unique(ALL((wpwpw))),(wpwpw).end())
# define LOWER(epepe) transform(ALL((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr) transform(ALL((rprpr)),(rprpr).begin(),TU<char>)
# define FOR(i,tptpt,ypypy) for(LL i=(tptpt);i<(ypypy);i++)
# define REP(i,upupu) FOR(i,0,upupu)
# define INIT std::ios::sync_with_stdio(false);std::cin.tie(0)
# pragma warning(disable:4996)
int a[202020], n;
struct BIT {
int bit[202020];
void init() {
REP(i, 202020)bit[i] = 0;
}
int sum(int i) {
int s = 0;
while (i>0) {
s += bit[i];
i -= i& -i;
}
return s;
}
void add(int i, int x) {
while (i <= 202020) {
bit[i] += x;
i += i& -i;
}
}
};
vector<pair<LL,LL>> v;
int main() {
BIT bit;
bit.init();
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
v.emplace_back(make_pair(a[i],i));
}
sort(ALL(v));
REP(i, n) {
a[v[i].second] = i + 1;
}
LL ans = 0;
for (int j = 0; j < n; j++) {
ans += j - bit.sum(a[j]);
bit.add(a[j], 1);
}
cout << ans << endl;
}
| #include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <string>
#include <cstdio>
#include <queue>
using namespace std;
long long cnt = 0;
void merge(vector<int> &v, int left, int mid, int right){
int n1 = mid - left;
int n2 = right - mid;
vector<int> l(n1 + 1);
vector<int> r(n2 + 1);
int i, j, k;
for(int i=0;i<n1;i++){
l[i] = v[left + i];
}
for(int i=0;i<n2;i++){
r[i] = v[mid + i];
}
l[n1] = r[n2] = 1000000007;
i = j = 0;
for(k = left;k < right;k++){
if(l[i] <= r[j]){
v[k] = l[i++];
cnt += j;
}else{
v[k] = r[j++];
}
}
}
void mergeSort(vector<int> &a, int left, int right){
if(left+1 < right){
int mid = (left + right)/2;
mergeSort(a, left, mid);
mergeSort(a, mid, right);
merge(a, left, mid, right);
}
}
int main(void){
int n;
cin >> n;
vector<int> v(n);
for(int i=0;i<n;i++)
cin >> v[i];
mergeSort(v, 0, n);
cout << cnt << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,K;
cin >> N >> K;
vector<int> A(N);
for(int i=0;i<N;i++) cin >> A.at(i);
for(int k=0;k<K;k++){
vector<int> B(N+1,0);
for(int i=0;i<N;i++){
int left = max(0,i-A.at(i));
int right = min(i+A.at(i)+1,N);
B.at(left) ++;
B.at(right) --;
}
for(int i=1;i<=N;i++){
B.at(i) += B.at(i-1);
}
if(A==B) break;
A = B;
}
for(int i=0;i<N;i++){
cout << A.at(i) << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x) (x).begin(),(x).end()
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
using Graph = vector<vector<int>>;
const ll mod=1000000007;
const int MAX_N = 1000; // n の最大値
double nCk(int n, int k) {
double res=1.0;
for(int i=0; i<n; i++){
res*=0.5;}
for(int i=0; i<k; i++){
res*=(double)(n-i);
res/=(double)(k-i);
}
return res;}
int main() {
ll n,p;
cin>>n>>p;
ll ca=0;
ll a[n+2]={};
ll b[n+2]={};
ll m=0;
ll f=0;
for(ll i=1; i<n+1; i++){
cin>>a[i];}
for(ll i=0; i<p; i++){
for(ll k=1; k<=n; k++){
if(k-a[k]<=0){
b[0]++;}
else{
b[k-a[k]]++;}
if(k+a[k]>=n){
b[n+1]--;}
else{
b[k+a[k]+1]--;}}
ca=b[0];
b[0]=0;
for(ll k=1; k<=n; k++){
ca+=b[k];
b[k]=0;
a[k]=ca;
if(a[k]==n){
m++;}
}
if(m==n) {f++; break;}
m=0;
ca=0;}
for(ll i=1; i<=n; i++){
cout << a[i] << " ";}
cout << endl;}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int l[10], v[2];
double total, point, now;
while(scanf("%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d", &l[0], &l[1], &l[2], &l[3], &l[4], &l[5], &l[6], &l[7], &l[8], &l[9], &v[0], &v[1]) + 1) {
total = 0;
now = 0;
for(int i = 0; i < 10; ++i) total += l[i];
point = total * v[0] / (v[0] + v[1]);
for(int i = 0; i < 10; ++i) {
now += l[i];
if(now >= point) {
cout << i + 1 << endl;
break;
}
}
//cout << total << " " << point << endl;
}
} | #include <iostream>
#include <string>
using namespace std;
int main()
{
int l[10], v1, v2, cnt;
double n, d, t;
char ch;
while (cin>>l[0]>>ch){
n = l[0];
for (int i = 1; i < 10; i++)
{
cin >> l[i] >> ch;
n += l[i];
}
cin >> v1 >> ch >> v2;
t=n/(v1+v2);
d=v1*t; //列車1の動く距離
cnt=0;
while(d>0){
d -= l[cnt];
cnt++;
}
cout << cnt << endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// Z algorithm O(|S|)
vector<int> Z_algorithm(vector<int> &s) {
vector<int> Z(s.size());
Z[0] = s.size();
int i = 1, j = 0;
while (i < s.size()) {
while (i + j < s.size() && s[j] == s[i + j]) j++;
Z[i] = j;
if (j == 0) {
i++;
continue;
}
int k = 1;
while (k < j && k + Z[k] < j) {
Z[i + k] = Z[k];
k++;
}
i += k;
j -= k;
}
return Z;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<ll> a(n), b(n);
for (int i = 0; i < n; i++) cin >> a.at(i);
for (int i = 0; i < n; i++) cin >> b.at(i);
vector<int> keep(n);
for (int i = 0; i < 30; i++) {
vector<int> x, y;
for (int j = 0; j < n; j++) {
if (b.at(j) & (1 << i)) {
x.emplace_back(1);
y.emplace_back(1);
}
else {
x.emplace_back(0);
y.emplace_back(0);
}
}
for (int j = 0; j < n; j++) {
if (a.at(j) & (1 << i)) {
x.emplace_back(1);
y.emplace_back(0);
}
else {
x.emplace_back(0);
y.emplace_back(1);
}
}
for (int j = 0; j < n; j++) {
if (a.at(j) & (1 << i)) {
x.emplace_back(1);
y.emplace_back(0);
}
else {
x.emplace_back(0);
y.emplace_back(1);
}
}
vector<int> xret = Z_algorithm(x), yret = Z_algorithm(y);
for (int j = n; j < 2 * n; j++) {
if (xret.at(j) >= n || yret.at(j) >= n) keep.at(j - n)++;
}
}
for (int i = 0; i < n; i++) {
if (keep.at(i) == 30) {
cout << i << " " << (a.at(i) ^ b.at(0)) << '\n';
}
}
} | //\\//\\ * * * //\\// ||
#include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << endl
using namespace std;
typedef long long ll;
template <typename T>
class fenwick {
public:
vector<T> fenw;
int n;
fenwick(int _n) : n(_n) {
fenw.resize(n);
}
void modify(int x, T v) {
while (x < n) {
fenw[x] += v;
x |= (x + 1);
}
}
T get(int x) {
T v{};
while (x >= 0) {
v += fenw[x];
x = (x & (x + 1)) - 1;
}
return v;
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, tt;
cin >> n >> tt;
fenwick<ll> fenw(n);
auto Get = [&](int l, int r) {
return (l == 0 ? fenw.get(r) : fenw.get(r) - fenw.get(l - 1));
};
for (int i = 0; i < n; i++) {
int x;
cin >> x;
fenw.modify(i, x);
}
while (tt--) {
int q;
cin >> q;
if (q == 1) {
int l, r;
cin >> l >> r;
cout << Get(l, r - 1) << '\n';
} else {
int p;
cin >> p;
ll x;
cin >> x;
fenw.modify(p, x);
}
}
return 0;
}
| 0 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
using namespace std;
#define INF 1000000000
#define EPS 1e-9
#define PI acos(-1)
typedef long long ll;
#define MAX_N 100
int n;
int k[MAX_N];
string s;
string str = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
vector<string> ans_list;
int main(){
while(true){
cin >> n;
if(n == 0)
break;
for(int i = 0; i < n; i++){
cin >> k[i];
}
cin >> s;
string ans;
int num = 0;
for(int i = 0; i < s.length(); i++, num++){
if(num == n)
num = 0;
int tmp;
for(tmp = 0; tmp < 52; tmp++){
if(str[tmp] == s[i])
break;
}
tmp -= k[num];
if(tmp < 0)
tmp += 52;
ans += str[tmp];
}
ans_list.push_back(ans);
}
for(int i = 0; i < ans_list.size(); i++){
cout << ans_list[i] << endl;
}
return 0;
} | #include <stdio.h>
int main(void){
int n, a[100], i, j;
char c, s[53] = {"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"};
while(1){
scanf("%d",&n);
if(!n) break;
for(i = 0;i < n;i++)
scanf("%d",&a[i]);
getchar();
for(i = 0;(c = getchar()) != '\n';i++){
for(j = 0;j < 52;j++){
if(s[j] == c)
printf("%c",s[(52 + j - a[i % n]) % 52]);
}
}
printf("\n");
}
return 0;
} | 1 |
#include<cstdio>
int main(){
int n,max,sum,t;
scanf("%d", &n);
while(n){
scanf("%d", &t);
max = sum = t;
for(int i = 1; i < n; i++){
if(sum < 0){
sum = 0;
}
scanf("%d", &t);
sum += t;
if(sum > max){
max = sum;
}
}
printf("%d\n", max);
scanf("%d", &n);
}
return 0;
} | #include <bits/stdc++.h>
#define iso ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
using namespace std;
int main()
{ iso
unsigned ll n,s=0,w=0;
cin>>n;
vector<unsigned ll>vec;
while(n--)
{
ll x;
cin>>x;
vec.push_back(x);
s+=x;
}
for(int i=0;i<vec.size();i++)
{
s-=vec[i];
w+=s%1000000007*vec[i]%1000000007;
w%=1000000007;
}
cout<<w<<"\n";
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,k;
cin >> N >>k;
int sum;
if(k==1){
sum = N+1;
}
else if(k==2||k==3||k==4){
if (N==1){
sum = 2;
}
else{
sum = 4 + k*(N-2);
}
}
else if(k==5||k==6||k==7){
if (N==1){
sum = 2;
}
else if(N==2){
sum = 4;
}
else{
sum = 8 + k*(N-3);
}
}
else{
if (N==1){
sum = 2;
}
else if (N==2){
sum = 4;
}
else if (N==3){
sum = 8;
}
else{
sum = 16 + k*(N-4);
}
}
cout<<sum<<endl;
}
|
#include <bits/stdc++.h>
using namespace std ;
#define rep(i,n) for( int i = 0 ; i < n ; i++ )
typedef long long ll ;
int main()
{
long long n,k,sum=0;
cin>>n>>k;
long long ans = 1;
while(n--){
long long ans2 = ans*2;
long long ani = ans+k;
if(ans2 < ani)
ans = ans2;
else ans = ani;
}
cout<<ans<<endl;
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
const int mx=1e6+11;
const double PI = acos(-1);
#define MOD 1000000007
#define nl '\n'
#define pb push_back
#define F first
#define S second
#define I insert
#define mp make_pair
#define sz(x) x.size()
#define tt int t; cin>>t; while(t--)
#define lo(i,a,b) for(int i=a;i<b;i++)
#define rlo(i,n) for(int i=n-1;i>=0;i--)
#define be(a) (a).begin(),(a).end()
#define rbe(a) (a).rbegin(),(a).rend()
#define mem(a,b) memset(a,b,sizeof(a))
#define pr(a) {for(auto x:a)cout<<x<<" ";cout<<nl;}
#define su ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define frac cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);
#define dbg(args...) do {cerr << #args << " : "; faltu(args); } while(0)
void faltu () { cerr << endl;}
template < typename T, typename ... hello>void faltu( T arg, const hello &... rest) {cerr << arg << ' ';faltu(rest...);}
void f()
{
int n,a,b;
cin>>n>>a>>b;
if(n==1)
cout<<"Hello World\n";
else
cout<<a+b<<nl;
}
int main()
{
su;
f();
return 0;
}
| #include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
if(n - 1)
{
int a, b;
cin >> a >> b;
cout << a + b << endl;
}
else
{
cout << "Hello World" << endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
int res;
for (int i = n; i <= 999; i++) {
string str = to_string(i);
bool ok = true;
for (int j = 0; j < str.length() - 1; j++) {
if (str[j] != str[j + 1]) {
ok = false;
break;
}
}
if (ok) {
res = i;
break;
}
}
cout << res << endl;
return 0;
}
| /*ॐॐ*/
/* I have already deleted My old account because somebody stole my code
and i have no idea how. If you are copying this code atleast make it look different.
Change variable names or change some Data structres or anything just make sure MOSS do not
Detect Anything.
Yours Faithfully
Shobhit Yadav */
/* I do not fear this new challenge. Rather like a true warrior I will rise to meet it.
-Prince Vegeta */
/* “Strength is the only thing that matters in this world. Everything else is just a delusion for the weak.” – Vegeta */
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll N;
/*ll freq[200005];*/
void solve(){
/*memset(freq,0,sizeof(freq));*/
string s;
map<string , int> days;
days["MON"] = 1;
days["TUE"] = 2;
days["WED"] = 3 ; days["THU"] = 4; days["FRI"] = 5; days["SAT"] = 6;
days["SUN"] = 0;
cin>>s;
cout<<7-days[s]<<'\n';
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
| 0 |
//FIRST THINK THEN CODE.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define rrep(i,a,b) for(ll i=a;i>b;--i)
#define FOR(i,n) for(ll i=0;i<n;i++)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define pii pair<int,int>
#define pll pair<long,long>
#define vpii vector<pii>
#define vpll vector<pll>
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define d1(x) cout<<(x)<<endl
#define d2(x,y) cout<<(x)<<" "<<(y)<<endl
#define d3(x,y,z) cout<<(x)<<" "<<(y)<<" "<<(z)<<endl
#define d4(a,b,c,d) cout<<(a)<<" "<<(b)<<" "<<(c)<<" "<<(d)<<endl
#define PI 3.1415926535897932384626433832795
#define fix(f,n) fixed<<setprecision(n)<<f
#define all(x) x.begin(),x.end()
#define rev(p) reverse(p.begin(),p.end());
#define endl "\n"
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define popcount(x) __builtin_popcountll(x)
#define sz(x) ((ll)x.size())
const ll M=1000000007;
const ll MM=998244353;
ll begtime = clock();
#define end_routine() cout << "\n\nTime elapsed: " << (clock() - begtime)*1000/CLOCKS_PER_SEC << " ms\n\n";
ll newmod(ll a,ll b)
{
return ((a%b)+b)%b;
}
ll powM(ll a,ll b,ll m )
{
if(a<=0)return 0;
a%=m;
if(!b)return 1;
ll ans=1LL;
while(b)
{
if(b&1)ans=ans*a%m;
a=a*a%m;
b>>=1;
}
return ans;
}
ll poww(ll a,ll b)
{
ll ans=1;
while(b)
{
if(b&1)ans=ans*a;
a=a*a;
b>>=1;
}
return ans;
}
template<typename T,typename F>
void chmax( T &a,F b){
if(b>a)a=b;
}
template<typename T,typename F>
void chmin( T &a,F b){
if(b<a)a=b;
}
const ll N=1e5+5;
ll vis[600][600];
ll n,m,s,cnt,k;
//cnt goes from 1 to s-k.
char ch[600][600];
bool valid(ll x,ll y){
if(vis[x][y])return false;
if(ch[x][y]=='#')return false;
if(x<1||x>n||y<1||y>m)return false;
return true;
}
ll dx[]={1,-1,0,0};
ll dy[]={0,0,-1,1};
void dfs(ll x,ll y){
cnt++;
if(cnt>s-k)return;
//cnt++;
vis[x][y]=1;
FOR(i,4){
ll nx=x+dx[i],ny=y+dy[i];
if(valid(nx,ny))dfs(nx,ny);
}
}
int main()
{
IOS;
ll n;cin>>n;
//ll ans=0;
vl a(n),b(n);
ll ans=0;
vl score(n);
FOR(i,n)cin>>a[i]>>b[i],score[i]=a[i]+b[i],ans-=b[i];
sort(all(score),greater<>());
FOR(i,n){
//if(i&1)ans-=2*b[i];
if(i%2==0)ans+=score[i];
}
d1(ans);
//end_routine();
return 0;
}
| #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <list>
#include <string.h>
#include <functional>
//#include <Windows.h>
//#include "Library.h"
//#include "Math.h"
using namespace std;
typedef long long int ll; typedef pair <int, int> P; typedef pair<int, P> P1; typedef vector <int> vecint; typedef vector <vecint> dvecint; typedef vector <dvecint> ddvecint;
const int INF = 2000000000;
const double EPS = 10e-9;
vecint a;
ll mergesort(vecint &a)
{
int n = a.size();
if (n <= 1) return 0;
ll res = 0;
vecint b(a.begin(), a.begin() + n / 2);
vecint c(a.begin() + n / 2, a.end());
res += mergesort(b);
res += mergesort(c);
int ai = 0, bi = 0, ci = 0;
while (ai < n)
{
if (bi < b.size() && (ci == c.size() || b[bi] <= c[ci]))
{
a[ai++] = b[bi++];
}
else
{
a[ai++] = c[ci++];
res += n / 2 - bi;
}
}
return res;
}
int main()
{
int n; cin >> n;
a.resize(n);
for (int i = 0; i < n; i++)
cin >> a[i];
cout << mergesort(a) << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
typedef long long ll;
int main(){
vector<int> v(1001);
int cnt=0;
for(int i=1; i<1002; i++){
if(i%3==0) cnt++;
v[i]=cnt;
}
int n; cin>>n;
cout<<v[n]<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ldouble = long double;
const ll inf = 1ll << 60;
const ll mod = (ll)1e9 + 7;
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define print(s) cout << s;
#define println(s) cout << s << endl;
#define printd(s) cout << fixed << setprecision(10) << s << endl;
string res;
int main()
{
ll n;
cin >> n;
println(n / 3);
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
string s;
int main(void){
cin >> s;
stack<char> st;
lli ans = s.size();
rep(i, s.size()){
if(s[i] == 'S'){
st.push('S');
}else if(s[i] == 'T'){
if(!st.empty() && st.top() == 'S'){
ans-=2;
st.pop();
}else st.push('T');
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
//
string str;
vector<int> vec(26, 0);
cin >> str;
if (str == "zyxwvutsrqponmlkjihgfedcba") {
cout << -1;
} else if (str.size() == 26) {
string tmp = str;
next_permutation(str.begin(), str.end());
string kekka = "";
for (int i = 0; i < str.size(); i++) {
kekka += str.at(i);
if (str.at(i) > tmp.at(i)) break;
}
cout << kekka;
} else {
for (int i = 0; i < str.size(); i++) vec.at(str.at(i) - 'a')++;
for (int i = 0; i < vec.size(); i++) {
if (vec.at(i) == 0) {
cout << str << (char)(i + 'a');
break;
}
}
}
//
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int M;
cin >> M;
vector<int64_t> d_vec(M), c_vec(M);
for (int i = 0; i < M; ++i)
cin >> d_vec.at(i) >> c_vec.at(i);
int64_t sum_digit = 0;
int64_t num_digit = 0;
for (int i = 0; i < M; ++i) {
sum_digit += d_vec.at(i) * c_vec.at(i);
num_digit += c_vec.at(i);
}
cout << num_digit - 1 + (sum_digit - 1) / 9 << endl;
}
| #include <stdio.h>
#include <cstdio>
#include <iostream>
#include <iomanip>
#include <queue>
#include <set>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <complex>
int main(){
// read problem
long long int M, tmp1, tmp2;
std::vector<long long int> d, c;
scanf("%lld", &M);
for(long long int i = 0; i < M; i++){
scanf("%lld%lld", &tmp1, &tmp2);
d.push_back(tmp1);
c.push_back(tmp2);
}
/*std::cerr << "M: " << M << std::endl;
std::cerr << "d: " << std::endl;
for(long long int i = 0; i < M; i++){
std::cerr << d[i] << " ";
}std::cerr << std::endl;
std::cerr << "c: " << std::endl;
for(long long int i = 0; i < M; i++){
std::cerr << c[i] << " ";
}std::cerr << std::endl;*/
// solve problem
long long int carryover = 0;
long long int topdigit, period, tmp_pos;
long long int ans = 0;
std::vector<long long int> tmp_digits(10);
for(long long int i = 0; i < M; i++){
//std::cerr << "i: " << i << " carryover: " << carryover << std::endl;
// calculate carryover
topdigit = d[i];
while(carryover>0){
ans++;
topdigit = topdigit+carryover;
carryover = topdigit/10;
topdigit = (topdigit+10)%10;
}
//std::cerr << "carryover is done" << std::endl;
// calculate one period
tmp_digits[0] = topdigit;
for(long long int j = 1; j < 10; j++){
tmp_digits[j] = d[i];
}
tmp_pos = 0;
period = 0;
for(long long int tmp_pos = 0; tmp_pos < 9; tmp_pos++){
while(tmp_digits[tmp_pos] > 0){
period++;
tmp_digits[tmp_pos+1] = tmp_digits[tmp_pos] + tmp_digits[tmp_pos+1];
tmp_digits[tmp_pos] = tmp_digits[tmp_pos+1]/10;
tmp_digits[tmp_pos+1] = (tmp_digits[tmp_pos+1]+10)%10;
}
/*for(long long int k = 0; k < 10; k++){
std::cerr << tmp_digits[k];
}std::cerr << std::endl;*/
}
ans += period*((c[i]-1)/9);
//std::cerr << "one period calculated" << std::endl;
// calculate amari
tmp_pos = 9 - ((c[i]+8)%9);
if(tmp_pos == 0){
continue;
}
tmp_digits[tmp_pos] = topdigit;
for(long long int j = tmp_pos+1; j < 10; j++){
tmp_digits[j] = d[i];
}
for(long long int tmp_pos = 0; tmp_pos < 9; tmp_pos++){
while(tmp_digits[tmp_pos] > 0){
ans++;
tmp_digits[tmp_pos+1] = tmp_digits[tmp_pos] + tmp_digits[tmp_pos+1];
tmp_digits[tmp_pos] = tmp_digits[tmp_pos+1]/10;
tmp_digits[tmp_pos+1] = (tmp_digits[tmp_pos+1]+10)%10;
}
}
//std::cerr << "amari calculated" << std::endl;
carryover = tmp_digits[9];
}
std::cerr << "Answer: " << std::endl;
std::cout << ans << std::endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
//{{{ graph.hpp
#ifndef INCLUDE_GRAPH_HPP
#define INCLUDE_GRAPH_HPP
#include <vector>
namespace orislib {
struct Edge {
typedef int weight_t;
int from, to;
weight_t w;
Edge(int from, int to, weight_t w) : from(from), to(to), w(w) {}
bool operator<(const Edge& e) const {
return w > e.w;
}
};
typedef std::vector<Edge> Edges;
typedef std::vector<Edges> Graph;
}
#endif
//}}}
using namespace orislib;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tuple<int, int> duo;
//{{{ templates
#define TMPINL_(...) template<__VA_ARGS__>inline
#define TT_ TMPINL_(typename T)
#define TTF_ TMPINL_(typename T,typename F)
#define TTTS_ TMPINL_(typename T,typename...Ts)
#define TITS_ TMPINL_(size_t I=0,typename...Ts)
TT_ T sq(T x){return x*x;}
TT_ T In(){T x;cin>>x;return x;}
TT_ void Out(T&x){cout<<x;}
TT_ void sort(T&v){sort(begin(v),end(v));}
TT_ void revs(T&v){reverse(begin(v),end(v));}
TT_ void uniq(T&v){sort(v);v.erase(unique(begin(v),end(v)),end(v));}
TT_ int ubnd(T&v,typename T::value_type&x){return upper_bound(begin(v),end(v),x)-begin(v);}
TT_ int lbnd(T&v,typename T::value_type&x){return lower_bound(begin(v),end(v),x)-begin(v);}
TTF_ void inpt(T&v,int n,F f){for(v.reserve(n);n--;v.emplace_back(f()));}
TTF_ void show(T&v,F f,string d=" ",string e="\n"){int i=0;for(auto&x:v)i++&&(cout<<d),f(x);cout<<e;}
TITS_ typename enable_if<I==tuple_size<tuple<Ts...>>::value-1,string>::type join(string s,tuple<Ts...>t){return to_string(get<I>(t));}
TITS_ typename enable_if<I<tuple_size<tuple<Ts...>>::value-1,string>::type join(string s,tuple<Ts...>t){return to_string(get<I>(t))+s+join<I+1>(s,t);}
TT_ string join(string s,T t){return to_string(t);}
TTTS_ string join(string s,T t,Ts...ts){return join(s,t)+s+join(s,ts...);}
inline void fast_io(){ios::sync_with_stdio(0);cin.tie(0);}
inline int in(){int x;scanf("%d",&x);return x;}
inline ll pow_mod(ll a,ll k,ll m){ll r=1;for(;k>0;a=a*a%m,k>>=1)if(k&1)r=r*a%m;return r;}
inline ll mod_inv(ll a,ll p){return pow_mod(a,p-2,p);}
inline int puts(const string&s){ return puts(s.c_str()); }
//}}} priority_queue queue deque front stringstream max_element min_element insert count make_tuple
const int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
const int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
const int Mod = 1000000000 + 0;
void dijkstra(const Graph& g, int s, vector<Edge::weight_t>& dist, vector<int>& prev)
{
const int V = g.size();
const Edge::weight_t INF = INT_MAX;
prev.assign(V, -1);
dist.assign(V, INF);
dist[s] = 0;
priority_queue<Edge> pq;
for (pq.push(Edge(-2, s, 0)); !pq.empty(); pq.pop()){
Edge c = pq.top();
if (prev[c.to] != -1) continue;
prev[c.to] = c.from;
dist[c.to] = c.w;
for (const auto& e : g[c.to]){
pq.push(Edge(e.from, e.to, e.w + c.w));
}
}
}
int main()
{
int V, E, r;
V = in(), E = in(), r = in();
Graph g(V);
for (int i = 0; i < E; i++){
int s, t, d;
s = in(), t = in(), d = in();
g[s].emplace_back(s, t, d);
}
vector<Edge::weight_t> ws;
vector<int> prev;
dijkstra(g, r, ws, prev);
show(ws, [](int v){
if (v == INT_MAX) cout << "INF";
else cout << v;
}, "\n");
return 0;
} | #include <iostream>
#include <vector>
#include <queue>
#include <utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int V,E,r;
const int Inf = 10000*100000+100;
ll C[100010];
int main(){
while(cin >> V >> E >> r && V >0){
vector< vector< P > > v(V+10);
for(int i=0;i<E;i++){
ll s,t,d;
cin >> s >> t >> d;
v[s].push_back(make_pair(d,t));
}
priority_queue<P> Q;
Q.push(P(0,r));
for(int i=0;i<V;i++){
C[i] = Inf;
}
C[r] = 0;
while(!Q.empty()){
P t = Q.top();
ll s = t.second;
Q.pop();
if(C[s] < t.first) continue;
for(int i=0;i<v[s].size();i++){
P e = v[s][i];
if(C[e.second] > C[s] + e.first){
C[e.second] = C[s] + e.first;
Q.push(make_pair(-C[e.second],e.second));
}
}
}
for(int i=0;i<V;i++){
if(C[i] < Inf) cout << C[i] << endl;
else cout << "INF" << endl;
}
}
}
#if 0
所要時間45分程度。ほとんどの部分はテキストを見ながら自力で書いたがうまくいかず，
蟻本(プログラミングコンテストチャレンジブック)(最近友人から譲ってもらった)を見て28行目を追加しAC
「確定しているので無視」ということの意味があまりわかっていなかったらしい。
#endif
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 1000005
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define ms(i) memset(i,0,sizeof(i));
#define ms1(i) memset(i,-1,sizeof(i));
#define F first
#define S second
#define all(x) x.begin(), x.end()
const int mod = 998244353;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
multiset<ll>st;
f (n) {
int x;
cin >> x;
st.insert(x);
}
int ans = 0;
while (st.size()) {
int x = *(--st.end());
st.erase(st.lower_bound(x));
for (int i = (1<<30) ; i ; i>>=1){
if (i <= x) {
break;
}
if (st.find(i-x) != st.end()) {
ans++;
st.erase(st.lower_bound(i-x));
break;
}
}
}
cout << ans << '\n';
}
| #include <bits/stdc++.h>
#include <string>
#include <vector>
#include <algorithm>
#define rep(i,w) for (int i = 0;i < (w); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
using ld = long double;
int INF = 1e9;
int main(){
int n;cin >> n;
vector<int> a(n),b(n),c(n);
rep(i,n) cin >> a[i];
rep(i,n) cin >> b[i];
rep(i,n) cin >> c[i];
sort(a.begin(),a.end());
sort(b.begin(),b.end());
sort(c.begin(),c.end());
vector<int> bc(n),ab(n);
int ind = 0;
rep(i,n){
while(b[i]>=c[ind]) {
if(ind == n) break;
ind++;
}
bc[i] = n-ind;
}
ind = 0;
rep(i,n){
while(a[i] >= b[ind]){
if(ind == n) break;
ind++;
}
ab[ind]++;
}
rep(i,n-1) ab[i+1] += ab[i];
ll ans = 0;
rep(i,n) ans += ll(ab[i])*ll(bc[i]);
cout << ans << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 5;
int n, m, a, b;
int grid[N][N];
void solve() {
cin >> n >> m >> a >> b;
memset(grid, 0, sizeof(grid));
for(int i = 1; i <= b; i++) {
for(int j = 1; j <= a; j++) {
grid[i][j] = 1;
}
}
for(int i = b + 1; i <= n; i++) {
for(int j = a + 1; j <= m; j++) {
grid[i][j] = 1;
}
}
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= m; j++) {
cout << grid[i][j];
}
cout << "\n";
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
solve();
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
/*
A
001111B
001111
110000
110000
110000
*/
int H, W, A, B;
scanf("%d %d %d %d", &H, &W, &A, &B);
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if ((i < B) ^ (j < A)) {
cout << 1;
} else {
cout << 0;
}
}
cout << "\n";
}
return 0;
} | 1 |
#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <stack>
#include <cctype>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#define INF (2 << 28)
#define fr first
#define sc second
using namespace std;
typedef long long ll;
typedef pair<int, int> iP;
typedef pair<double, double> dP;
int main(){
string line;
int l[10];
while(~scanf("%d,", l)){
int v1, v2;
vector <dP> t1(10);
vector <dP> t2(10);
int l1[10] = {}, l2[10] = {};
for(int i = 1; i < 10; i++)
scanf("%d,", l + i);
scanf("%d,%d", &v1, &v2);
l1[0] = l[0], l2[9] = l[9];
for(int i = 1; i < 10; i++){
l1[i] += l1[i - 1] + l[i];
l2[9 - i] += l2[9 - i + 1] + l[9 - i];
}
double begin = 0;
for(int i = 0; i < 10; i++){
t1[i].fr = begin;
t1[i].sc = (double)l1[i] / v1;
begin = (double)l1[i] / v1;
}
begin = 0;
for(int i = 9; i >= 0; i--){
t2[i].fr = begin;
t2[i].sc = (double)l2[i] / v2;
begin = (double)l2[i] / v2;
}
for(int i = 0; i < 10; i++){
if(!(t1[i].fr > t2[i].sc || t2[i].fr > t1[i].sc)){
cout << i + 1 << endl;
break;
}
}
}
} | #define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <utility>
#include <vector>
#include <numeric>
using namespace std;
int cnt = 0;
vector<int> g;
void insertionSort(vector<int> &a, int g)
{
for (int i = g; i < a.size(); i++)
{
int v = a[i];
int j = i - g;
for (; j >= 0 && a[j] > v;)
{
a[j + g] = a[j];
j -= g;
cnt++;
}
a[j + g] = v;
}
}
void shellSort(vector<int> &a)
{
for (int i = 1; i <= a.size(); i = 3 * i + 1)
{
g.push_back(i);
}
for (int i = g.size() - 1; i >= 0; i--)
{
insertionSort(a, g.at(i));
}
}
int main()
{
int n;
vector<int> a;
for (cin >> n; n--;)
{
int x;
cin >> x;
a.push_back(x);
}
shellSort(a);
cout << g.size() << endl;
for (int i = g.size() - 1; i >= 0; i--)
{
cout << g.at(i) << (i == 0 ? "" : " ");
}
cout << endl;
cout << cnt << endl;
for (int i = 0; i < a.size(); i++)
{
cout << a.at(i) << endl;
}
}
| 0 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <clocale>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i, s, n) for(int i = (s), i##_len=(n); i < i##_len; ++i)
#define FORS(i, s, n) for(int i = (s), i##_len=(n); i <= i##_len; ++i)
#define VFOR(i, s, n) for(int i = (s); i < (n); ++i)
#define VFORS(i, s, n) for(int i = (s); i <= (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FORS(i, 0, n)
#define VREP(i, n) VFOR(i, 0, n)
#define VREPS(i, n) VFORS(i, 0, n)
#define RFOR(i, s, n) for(int i = (s), i##_len=(n); i >= i##_len; --i)
#define RFORS(i, s, n) for(int i = (s), i##_len=(n); i > i##_len; --i)
#define RREP(i, n) RFOR(i, n, 0)
#define RREPS(i, n) RFORS(i, n, 0)
#define ALL(v) (v).begin(), (v).end()
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort(ALL(v), greater<decltype(v[0])>())
#define SZ(x) ((int)(x).size())
#define REV(x) reverse(ALL(x))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define MT make_tuple
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase(unique(ALL(v)), v.end())
using ld = long double;
using ll = long long;
using ui = unsigned int;
using ull = unsigned long long;
using Pi_i = pair<int, int>;
using Pll_ll = pair<ll, ll>;
using VB = vector<bool>;
using VC = vector<char>;
using VD = vector<double>;
using VI = vector<int>;
using VLL = vector<ll>;
using VS = vector<string>;
using VSH = vector<short>;
using VULL = vector<ull>;
const int MOD = 1000000007;
const int INF = 1000000000;
const int NIL = -1;
const double EPS = 1E-10;
template<class T, class S>
bool chmax(T &a, const S &b){
if(a < b){
a = b; return true;
}
return false;
}
template<class T, class S>
bool chmin(T &a, const S &b){
if(b < a){
a = b; return true;
}
return false;
}
int main(){
string S; cin >> S;
int w; cin >> w;
REP(i, S.length()){
cout << S[i];
i += w - 1;
}
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(){
string S;
int w;
cin >> S >> w;
for(int i=0;i<S.size();i++){
if(i%w==0){
cout << S.at(i);
}
}
cout << endl;
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int x,y; cin >> x >> y;
int ans = 0;
if(x>0){
if(y>0){
if(x>y){
ans++; // x -> -x
ans += abs(x-y); // x -> -y
ans++; // x-> y
}else if(x < y){
ans+= y-x; // x->y
}
}else if(y<0){
if(abs(x) > abs(y)){
ans++; // x->-x
ans+= abs(x) - abs(y); // x->-y
}else if(abs(x) < abs(y)){
ans+= abs(y) - abs(x); // x->y
ans++; // x -> -y
}else{
ans++;
}
}else{
ans++;
ans+= x;
}
}else if(x<0){
if(y>0){
if(abs(x)>abs(y)){
ans += abs(x) -abs(y);
ans++;
}else if(abs(x)<abs(y)){
ans++;
ans += abs(y) - abs(x);
}else{
ans++;
}
}else if(y<0){
if(abs(x)>abs(y)){
ans += abs(x) -abs(y);
}else if(abs(x)<abs(y)){
ans++;
ans += abs(y) - abs(x);
ans++;
}
}else{
ans+=abs(x);
}
}else{
if(y>0) ans+=y;
else if(y<0) ans+= abs(y) + 1;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t x, y; cin >> x >> y;
if (0 < x && 0 < y) {
if (x < y) cout << y - x << endl;
else cout << abs(y - x) + 2 << endl;
}
if (x == 0) {
if (x < y) cout << y << endl;
else cout << abs(y) + 1 << endl;
}
if (y == 0) {
if (x < y) cout << abs(x) << endl;
else cout << x + 1 << endl;
}
if (x < 0 && y < 0) {
if (x < y) cout << y - x << endl;
else cout << abs(y) - abs(x) + 2 << endl;
}
if (x < 0 && 0 < y) {
cout << min(abs(x) + abs(y), abs(abs(y) - abs(x)) + 1) << endl;
}
if (y < 0 && 0 < x) {
cout << abs(abs(y) - abs(x)) + 1 << endl;
}
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
int main() {
int n;
scanf("%d", &n);
string s;
cin >> s;
int count[n + 1];
// i文字目までにWがいくつあるか(1-indexed)
// 累積和テーブル
count[0] = 0;
rep(i, n) {
// その地点までの累積和だから前のcount[i]を代入してる
count[i + 1] = count[i];
// もしwなら加算
if (s[i] == 'W') ++count[i + 1];
}
int ans = n;
for (int i = 1; i <= n; ++i) {
// 自分より西にいて西を向いている人が
// count[i-1]人
// 自分より東にいて東を向いている人が
// (n-i)-(count[n]-count[i])人
ans = min(ans, count[i - 1] + (n - i) - (count[n] - count[i]));
}
printf("%d\n", ans);
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define sz(a) int((a).size())
#define all(a) (a).begin(), (a).end()
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPD(i,n) for(int i=(n)-1;i>=0;--i)
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define FORD(i,a,b) for(int i=(a);i>=(b);--i)
#define TLE() cerr<<"\nTime elapsed: "<<1000*clock()/CLOCKS_PER_SEC<<"ms.\n";
const ll MOD = 1E9+7;
const ll IINF = 1E18;
const int INF = 1e9;
const double EPS = 1E-9;
const double PI = atan(1.0) * 4.0;
template<class T> T getbit(T s, int i) {return s>>i&1;}
template<class T> void flipbit(T& s, int i) {s^=(1LL<<i);}
constexpr int cntbit(ll x) {return __builtin_popcountll(x);}
constexpr int lg2(ll x) {return __lg(x);} // return int(log2(x))
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
ll fpow(ll a,ll p){ll res=1LL;while(p){if(p&1LL) res=res*a%MOD;a=a*a%MOD;p>>=1LL;} return res;}
const int N=1e5+5;
int n,a[N];
int bit[N];
void upd(int x,int v){
for(;x<N;x=x|(x+1))
bit[x]=max(bit[x],v);
}
int get(int x){
int res=0;
for(;x>=0;x=(x&(x+1))-1)
res=max(res,bit[x]);
return res;
}
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);
cin>>n;
vector<int> c;
REP(i,n){
cin>>a[i];
c.pb(a[i]);
}
sort(all(c));
int res=0;
reverse(a,a+n);
REP(i,n){
int x=lower_bound(all(c),a[i])-c.begin();
int len=get(x)+1;
upd(x,len);
res=max(res,len);
}
cout<<res<<'\n';
}
| 0 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
vector<int> outp;
int icn;
int icd;
int g;
vector<int> ice;
for(g = 0;;g++){
vector<int> ice(10,0);
cin >> icn;
if(icn == 0){
break;
}else{
for(int a = 0;a< icn;a++){
cin >> icd;
ice[icd] += 1;
}
outp.insert(outp.end(),ice.begin(),ice.end());
}
}
for(int n = 0;n<g * 10;n++){
if(outp[n] == 0){
cout << "-";
}else{
for(int c = 0;c<outp[n];c++){
cout << "*" ;
}
}
cout << endl;
}
return 0;
} | #include<iostream>
#include<vector>
using namespace std;
struct data{
int a, b, c;
data(int _a, int _b, int _c) : a(_a), b(_b), c(_c) {}
};
int main(){
int a, b, c;
while(cin >> a >> b >> c){
if(a + b + c == 0) break;
int da[a], db[b], dc[c];
for(int i = 0; i < a; i++) da[i] = 0;
for(int i = 0; i < b; i++) db[i] = 0;
for(int i = 0; i < c; i++) dc[i] = 0;
vector<data> fault;
int n;
cin >> n;
while(n-- > 0){
int i, j, k, r;
cin >> i >> j >> k >> r;
if(r == 0) fault.push_back(data(i,j,k));
else da[i-1] = db[j-a-1] = dc[k-a-b-1] = 1;
}
bool update = true;
while(update){
update = false;
for(data d : fault){
if(da[d.a-1] > 1 || db[d.b-a-1] > 1 || dc[d.c-a-b-1] > 1)
continue;
if(da[d.a-1] + db[d.b-a-1] + dc[d.c-a-b-1] == 2){
update = true;
if(da[d.a-1] == 1 && db[d.b-a-1] == 1) dc[d.c-a-b-1] = 2;
else if(db[d.b-a-1] == 1 && dc[d.c-a-b-1] == 1) da[d.a-1] = 2;
else if(dc[d.c-a-b-1] == 1 && da[d.a-1] == 1) db[d.b-a-1] = 2;
}
}
}
for(int i = 0; i < a; i++) cout << 2-da[i] << endl;
for(int i = 0; i < b; i++) cout << 2-db[i] << endl;
for(int i = 0; i < c; i++) cout << 2-dc[i] << endl;
}
return 0;
}
| 0 |
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <deque>
#include <numeric>
using lint = long long;
int main()
{
lint h, w, a, b;
scanf("%lld", &h);
scanf("%lld", &w);
scanf("%lld", &a);
scanf("%lld", &b);
for (int i = 0; i < h; ++i)
{
if (i < h - b)
printf("%s\n", (std::string((w - a), '1') + std::string(a, '0')).c_str());
else
printf("%s\n", (std::string((w - a), '0') + std::string(a, '1')).c_str());
}
return 0;
}
| #include<iostream>
using namespace std;
int main(){
int H, W, A, B;
cin >> H >> W >> A >> B;
for(int i=1; i<=H; i++){
for(int j=1; j<=W; j++){
if((i<=B && j<=A) || (i>B && j>A)){
cout << 0;
} else{
cout << 1;
}
}
cout << endl;
}
} | 1 |
/*
confirm 0LL and 1LL
confirm cornercases such as 0
confirm times of cin < 10^6
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<VecP>;
template <typename T>
using Vec1 = vector<T>;
template <typename T>
using Vec2 = vector<Vec1<T> >;
#define REP(i, m, n) for(ll (i) = (m); (i) < (n); ++(i))
#define REPN(i, m, n) for(ll (i) = (m); (i) <= (n); ++(i))
#define REPR(i, m, n) for(ll (i) = (m)-1; (i) >= (n); --(i))
#define REPNR(i, m, n) for(ll (i) = (m); (i) >= (n); --(i))
#define rep(i, n) REP(i, 0, n)
#define repn(i, n) REPN(i, 1, n)
#define repr(i, n) REPR(i, n, 0)
#define repnr(i, n) REPNR(i, n, 1)
#define all(s) (s).begin(), (s).end()
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
template <typename T>
bool chmax(T &a, const T b){if(a < b){a = b; return true;} return false;}
template <typename T>
bool chmin(T &a, const T b){if(a > b){a = b; return true;} return false;}
template <typename T>
ll pow2(const T n){return (1LL << n);}
template <typename T>
void cosp(const T n){cout << n << ' ';}
template <typename T>
void co(const T n){cout << n << '\n';}
template <typename T1, typename T2>
void co(pair<T1, T2> p){cout << p.fs << ' ' << p.sc << '\n';}
template <typename T>
void co(const Vec1<T> &v){for(T i : v) cosp(i); cout << '\n';}
template <typename T>
void co(initializer_list<T> v){for(T i : v) cosp(i); cout << '\n';}
template <typename T>
void ce(const T n){cerr << n << endl;}
void sonic(){ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);}
void setp(const ll n){cout << fixed << setprecision(n);}
const ll INF = 1e9+1;
const ll LINF = 1e18+1;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const ld PI = acos(-1);
const ld EPS = 1e-11;
int main(void){
ll n, m;
cin >> n >> m;
Vec a(n), b(m);
rep(i, n) cin >> a[i];
rep(i, m) cin >> b[i];
sort(all(a));
sort(all(b));
reverse(all(a));
reverse(all(b));
a.pb(0), b.pb(0);
ll pos1 = 0, pos2 = 0;
ll ans = 1, space = 0;
repnr(i, n*m){
if(i == a[pos1] && i == b[pos2]){
space += pos1+pos2;
pos1++, pos2++;
}else if(i == a[pos1]){
ans *= pos2;
ans %= MOD;
space += pos2-1;
pos1++;
}else if(i == b[pos2]){
ans *= pos1;
ans %= MOD;
space += pos1-1;
pos2++;
}else{
ans *= space;
ans %= MOD;
space--;
}
}
if(pos1 == n && pos2 == m) co(ans);
else co(0);
return 0;
}
| #include <iostream>
#include <vector>
#include <limits.h>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
#include <cassert>
#include <random>
#include <functional>
#include <stack>
#include <iomanip>
#include <cassert>
//#include <boost/multiprecision/cpp_int.hpp>
#include <complex>
using namespace std;
const long long MOD = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ld, ll> pdl;
typedef pair<ld, ld> pdd;
//typedef boost::multiprecision::cpp_int bigint;
//0->決定
//1->xのみ決定
//2->yのみ決定
//3->x,yの範囲のみ決定
struct query {
ll type;
pll p1, p2;
};
ll H, W;
vector<ll> A, B;
vector<vector<pll>> DP;
vector<query> DP2;
int main() {
cin >> H >> W;
A.resize(H + 1);
for (ll y = 1; y <= H; y++)cin >> A[y];
sort(A.begin(), A.end(), [](ll a, ll b) {return a < b; });
B.resize(W + 1);
for (ll x = 1; x <= W; x++)cin >> B[x];
sort(B.begin(), B.end(), [](ll a, ll b) {return a < b; });
for (ll x = W; x > 1; x--) {
if (B[x] == B[x - 1]) {
cout << 0 << endl;
return 0;
}
}
for (ll y = H; y > 1; y--) {
if (A[y] == A[y - 1]) {
cout << 0 << endl;
return 0;
}
}
DP.resize(W * H + 1, vector<pll>(2, pll(0, 0)));
DP2.resize(W * H + 1);
ll xuse = W, yuse = H;
for (ll p = W * H; p >= 1; p--) {
if (A[yuse] == p && B[xuse] == p) {
DP[p][0] = pll(xuse, yuse);
DP[p][1] = pll(xuse, yuse);
xuse--;
yuse--;
DP2[p] = { 0,pll(xuse,yuse),pll(-1,-1) };
}
else if (A[yuse] == p) {
DP[p][0] = pll(xuse + 1, yuse);
DP[p][1] = pll(W, yuse);
DP2[p] = { 2,pll(xuse + 1, yuse),pll(W, yuse) };
yuse--;
}
else if (B[xuse] == p) {
DP[p][0] = pll(xuse, yuse + 1);
DP[p][1] = pll(xuse, H);
DP2[p] = { 1,pll(xuse, yuse + 1) ,pll(xuse, H) };
xuse--;
}
else {
DP[p][0] = pll(xuse+1, yuse+1);
DP[p][1] = pll(W, H);
DP2[p] = { 3,pll(xuse + 1, yuse + 1) ,pll(W, H) };
}
}
ll ans = 1;
for (ll p = W * H; p >= 1; p--) {
if (DP[p][0] == DP[p][1])continue;
else if (DP[p][0].second == DP[p][1].second) {
ans = (ans * (DP[p][1].first - DP[p][0].first + 1)) % MOD;
}
else if (DP[p][0].first == DP[p][1].first) {
ans = (ans * (DP[p][1].second - DP[p][0].second + 1)) % MOD;
}
}
for (ll p = W * H; p >= 1; p--) {
if (DP[p][0].first == DP[p][1].first ||
DP[p][0].second == DP[p][1].second)continue;
ans = (ans * ((W - DP[p][0].first+1) * (H - DP[p][0].second+1)-(W*H-p))) % MOD;
}
ans = 1;
for (ll p = W * H; p >= 1; p--) {
if (DP2[p].type == 0)continue;
else if (DP2[p].type == 1) {
ll left = DP2[p].p2.second - DP2[p].p1.second + 1;
ans = (ans * left) % MOD;
}
else if (DP2[p].type == 2) {
ll left = DP2[p].p2.first - DP2[p].p1.first + 1;
ans = (ans * left) % MOD;
}
else {
ll left = (W - DP[p][0].first + 1) * (H - DP[p][0].second + 1) - (W * H - p);
ans = (ans * left) % MOD;
}
}
cout << ans << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if(s.size()==3){
for(int i=2;i>=0;i--){
cout << s.at(i);
}
cout << endl;
}
else{
cout << s << endl;
}
}
| #include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
using namespace std;
using pii = pair<int,int>;
using ll=long long;
using ld=long double;
#define pb push_back
#define mp make_pair
#define sc second
#define fr first
#define stpr setprecision
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define rep(i,n) for(ll i=0;i<(n);++i)
#define Rep(i,a,b) for(ll i=(a);i<(b);++i)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define rRep(i,a,b) for(int i=a;i>=b;i--)
#define crep(i) for(char i='a';i<='z';++i)
#define psortsecond(A,N) sort(A,A+N,[](const pii &a, const pii &b){return a.second<b.second;});
#define ALL(x) (x).begin(),(x).end()
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define endl '\n'
int ctoi(const char c){
if('0' <= c && c <= '9') return (c-'0');
return -1;
}
ll gcd(ll a,ll b){return (b == 0 ? a : gcd(b, a%b));}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
constexpr ll MOD=1000000007;
constexpr ll INF=1000000011;
constexpr ll MOD2=998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS=10e-8;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> istream& operator>>(istream& is,vector<T>& v){for(auto&& x:v)is >> x;return is;}
template<typename T,typename U> istream& operator>>(istream& is, pair<T,U>& p){ is >> p.first; is >> p.second; return is;}
template<typename T,typename U> ostream& operator>>(ostream& os, const pair<T,U>& p){ os << p.first << ' ' << p.second; return os;}
template<class T> ostream& operator<<(ostream& os, vector<T>& v){
for(auto i=begin(v); i != end(v); ++i){
if(i !=begin(v)) os << ' ';
os << *i;
}
return os;
}
int main(){
string S;
cin >> S;
if(S.size()==3){
reverse(ALL(S));
}
cout << S << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int n, m, ex, ey;
char a[105][105];
short dp[101][101][101][101], sr[105][105], sc[105][105];
inline void getmax(short &x, short y) {
if (x < y) x = y;
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf(" %s", a[i] + 1);
for (int j = 1; j <= m; j++) {
if (a[i][j] == 'E') {
ex = i;
ey = j;
a[i][j] = '.';
}
sr[i][j] = sc[i][j] = (a[i][j] == 'o');
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
sr[i][j] += sr[i][j - 1];
sc[i][j] += sc[i - 1][j];
}
}
int ans = 0;
for (int l = 0; l <= ey - 1; l++) {
for (int r = 0; r <= m - ey; r++) {
for (int u = 0; u <= ex - 1; u++) {
for (int d = 0; d <= n - ex; d++) {
ans = max(ans, (int)dp[l][r][u][d]);
if (l + r < ey - 1) getmax(dp[l + 1][r][u][d], dp[l][r][u][d] + sc[min(n - u, ex + d)][ey - l - 1] - sc[max(d, ex - u - 1)][ey - l - 1]);
if (l + r < m - ey) getmax(dp[l][r + 1][u][d], dp[l][r][u][d] + sc[min(n - u, ex + d)][ey + r + 1] - sc[max(d, ex - u - 1)][ey + r + 1]);
if (u + d < ex - 1) getmax(dp[l][r][u + 1][d], dp[l][r][u][d] + sr[ex - u - 1][min(m - l, ey + r)] - sr[ex - u - 1][max(r, ey - l - 1)]);
if (u + d < n - ex) getmax(dp[l][r][u][d + 1], dp[l][r][u][d] + sr[ex + d + 1][min(m - l, ey + r)] - sr[ex + d + 1][max(r, ey - l - 1)]);
}
}
}
}
printf("%d\n", ans);
return 0;
} | //#pragma GCC optimize(2)
//#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define N 100005
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<22,stdin),p1 == p2)?EOF:*p1++)
using namespace std ;
//char buf[(1 << 22)] , *p1 = buf , *p2 = buf ;
inline int read ()
{
char c = getchar () ; int x = 0 , f = 1 ;
while (c < '0' || c > '9') { if (c == '-') f = -1 ; c = getchar () ; }
while (c >= '0' && c <= '9'){ x = x * 10 + c - '0' ; c = getchar () ; }
return x * f ;
}
map <int , int> mp[N << 3] ; //mp[u][w]:u属性为w的虚点编号
vector <pair <int , int> > edge[N << 3] ;
int dis[N << 3] , vis[N << 3] , n , m ;
queue <int> q ;
void spfa (int s)
{
int tim = 0 ;
for (int i = 0 ; i <= (N << 3) - 5 ; i ++) dis[i] = 1e9 ;
// fill (dis , dis + (N << 2) , 1e9) ;
dis[s] = 0 ;
vis[s] = 1 ;
q.push (s) ;
while (! q.empty ())
{
// printf ("The %d time\n" , ++ tim) ;
int x = q.front () ;
q.pop () ;
for (int i = 0 ; i < edge[x].size () ; i ++)
{
int y = edge[x][i].first ;
if (dis[y] > dis[x] + edge[x][i].second)
{
dis[y] = dis[x] + edge[x][i].second ;
if (! vis[y])
{
vis[y] = 1 ;
q.push (y) ;
}
}
}
vis[x] = 0 ;
}
}
int main ()
{
// freopen (".in" , "r" , stdin) ; freopen (".out" , "w" , stdout) ;
n = read () , m = read () ;
int tot = n ;
for (int i = 1 ; i <= m ; i ++)
{
int u = read () , v = read () , w = read () ;
if (! mp[u].count (w))
{
mp[u][w] = ++ tot ;
edge[u].push_back (make_pair (tot , 1)) ;
edge[tot].push_back (make_pair (u , 1)) ;
}
if (! mp[v].count (w))
{
mp[v][w] = ++ tot ;
edge[v].push_back (make_pair (tot , 1)) ;
edge[tot].push_back (make_pair (v , 1)) ;
}
edge[mp[u][w]].push_back (make_pair (mp[v][w] , 0)) ;
edge[mp[v][w]].push_back (make_pair (mp[u][w] , 0)) ;
}
spfa (1) ;
if (dis[n] == 1e9) return puts ("-1") , 0 ;
cout << dis[n] / 2 ;
}
| 0 |
#include <bits/stdc++.h>//Carefully Crafted by hetp111
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(),(v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vii vector<pii>
#define MOD 1000000007
#define MOD2 998244353
#define MOD3 1000000009
#define PI acos(-1)
#define eps (1e-8)
#define INF (1e18)
#define FASTER ios_base::sync_with_stdio(0);cin.tie(0)
template<class A,class B>ostream&operator<<(ostream&out,const pair<A,B>&a){return out<<"("<<a.first<<","<<a.second<<")";}
template<class A>ostream&operator<<(ostream&out,const vector<A>&a){for(const A &it:a)out<<it<<" ";return out;}
template<class A,class B>istream&operator>>(istream&in,pair<A,B>&a){return in>>a.first>>a.second;}
template<class A>istream&operator>>(istream&in,vector<A>&a){for(A &i:a)in>>i;return in;}
//ifstream cinn("in.in");ofstream coutt("out.out");
int poww(const int &a,int b,const int &m=MOD){if(b==0)return 1;int x=poww(a,b/2,m);x=x*x%m;if(b&1)x=x*a%m;return x;}
int ceil(const int &a,const int &b){return (a+b-1)/b;}
////Read:
//Check corner cases, n==1;
//
////Some function:
//__builtin_popcountll(),
int n,c;
vi v;
signed main(){
FASTER;
cin>>n>>c;
v=vi(n);
for(int &i:v)cin>>i;
int ans=0;
for(int i=0;i<=n;i++){
for(int j=0;j<=n;j++){
if(i+j>c || i+j>n)continue;
vi hand;
int cst=c,sum=0;
for(int k=0;k<i;k++)hand.push_back(v[k]),cst--,sum+=hand.back();
for(int k=0;k<j;k++)hand.push_back(v[n-k-1]),cst--,sum+=hand.back();
sort(all(hand));
for(int i:hand){
if(i>=0)break;
if(cst){
cst--;
sum-=i;
}
}
ans=max(ans,sum);
}
}
cout<<ans;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define SP << " "
#define LLi long long int
using namespace std;
int gcdi(int a, int b) {
if(a<0) a=b;
if(b<0) b=a;
if (b == 0) return a;
return gcdi(b, a%b);
}
int lcmi(int a, int b) {
return a/gcdi(a, b)*b;
}
int gcdv(vector<int> gv){
int tmp=gv[0];
for(int i=1;i<(int)gv.size();i++) tmp=gcdi(tmp, gv[i]);
return tmp;
}
int lcmv(vector<int> gv){
int tmp=gv[0];
for(int i=1;i<(int)gv.size();i++) tmp=lcmi(tmp, gv[i]);
return tmp;
}
int main(){
int n, k, gc;
vector<int> v;
map<LLi, int> mp;
cin>> n >> k;
v.resize(n);
rep(i, n){
cin>> v[i];
if(v[i]==k){
cout<< "POSSIBLE" <<endl;
return 0;
}
}
gc=gcdv(v);
rep(i, n){
if(v[i]-k>0 && (v[i]-k)%gc==0){
cout<< "POSSIBLE" <<endl;
return 0;
}
}
cout<< "IMPOSSIBLE" <<endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n) for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n) for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v+n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout<<d<<endl;
#define coutd(d) cout<<std::setprecision(10)<<d<<endl;
#define cinline(n) getline(cin,n);
#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll,ll,ll>>;
using vb = vector<bool>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e15;
const ll MOD = 1e9+7;
const ll LINF = 1e18;
ll dp[105][10];
signed main()
{
cin.tie( 0 ); ios::sync_with_stdio( false );
ll h,w,k; cin>>h>>w>>k;
k--;
dp[0][0]=1;
rep(i,h){
rep(j,w){
for(ll bit=0; bit<(1<<(w-1)); bit++){
bool ok=true;
rep(ki,w-2){
if(bit>>ki&1 && bit>>(ki+1)&1){
ok=false;
break;
}
}
if(!ok) continue;
ll nj=j;
if(bit>>j&1) nj=j+1;
else if(j>0 && bit>>(j-1)&1) nj=j-1;
dp[i+1][nj]+=dp[i][j];
dp[i+1][nj]%=MOD;
}
}
}
cout<<dp[h][k]<<endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <random>
#include <chrono>
#include <queue>
#include <math.h>
#include <string>
#include <sstream>
#include <stack>
#include <deque>
#define pb push_back
#define make make_pair
#define kaku(a) cout << a << endl
#define isort(a) sort(a.begin(),a.end())
#define ll long long
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define PI 3.14159265359
long long gcd(long long a,long long b){ return b==0?a:gcd(b,a%b);}
long long lcm(long long a,long long b){ return a/gcd(a,b)*b;}
const ll inf =998244353;
typedef pair<ll,ll> Pair;
typedef vector<ll> vl;
const ll MAX = 510000;
const ll MOD = 998244353;
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(ll n, ll k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
//繰り返し２乗
ll cal(ll x,ll n) { // (K/x)^N
int p = n;
x %= inf;
ll res = 1;
while (p > 0) {
if (p & 1) res = (x * res) % inf; //pが奇数ならresはx倍される
x = x * x % inf; //ここはxを二乗している
p >>= 1; //pを二で割って、あまり切り捨てか。
}
return res;
}
void solve(){
ll n,m,k;
cin >> n >>m >>k;
COMinit();
ll ans=0;
rep(j,k+1){
ll score=m;
score*=COM(n-1,j);
score%=MOD;
score*=cal(m-1,n-1-j);
score%=MOD;
ans+=score;
ans%=MOD;
}
kaku(ans);
}
int main(){
solve();
} | 0 |
#include <iostream>
#include<vector>
#include<string>
using namespace std;
int Roma(char a){
switch(a){
case 'I':return 1;
case 'V':return 5;
case 'X':return 10;
case 'L':return 50;
case 'C':return 100;
case 'D':return 500;
case 'M':return 1000;
}
return 0;
}
int main() {
while(1){
string a;
cin>>a;
if(cin.fail())break;
int s=0;
for(int b=0;b<a.length();b++){
if(a.length()-1==b){
s+=Roma(a[b]);
}
else{
if(Roma(a[b])<Roma(a[b+1])){
s+=Roma(a[b+1])-Roma(a[b]);
b++;
}
else s+=Roma(a[b]);
}
}
cout<<s<<endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
bool ok = true;
if (s[0] != 'A') ok = false;
int cnt = 0;
for (int i = 1; i < s.size(); i++) {
if (i >= 2 && i <= s.size() - 2) {
if (s[i] == 'C') {
cnt++;
continue;
}
}
if (!islower(s[i])) {
ok = false;
}
}
if (cnt != 1) ok = false;
if (ok) cout << "AC" << endl;
else cout << "WA" << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int check = 1000;
for(int i; i < N; i++){
int A;
int count = 0;
cin >> A;
while(A % 2 == 0){
A /= 2;
count += 1;
}
if(count < check){
check = count;
}
}
cout << check << endl;
} | // ALDS 1_10_B
#include<cstdio>
#include<cstring>
#include<vector>
#define rep(i,a) for( int i = 0; i != (a); ++i )
#define repi(i,a,b) for( int i = (a); i != (b); ++i )
const int INF = 1<<28;
int n;
std::vector<int> r(100);
std::vector<std::vector<int> > dp( 100, std::vector<int>( 100, INF ) );
int main()
{
scanf( "%d", &n );
rep( i, n )
scanf( "%d%d", &r[i], &r[i+1] );
rep( i, n )
dp[i][i] = 0;
repi( k, 1, n ) rep( i, n-k ) repi( j, i, i+k )
dp[i][i+k] = std::min( dp[i][i+k], dp[i][j]+dp[j+1][i+k]+r[i]*r[j+1]*r[i+k+1] );
printf( "%d\n", dp[0][n-1] );
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define all(t) t.begin(), t.end()
#define inrange(i, a, b) (((i)>= min((a), (b))) && ((i) <= max((a), (b))))
typedef vector<ll> vi;
typedef pair<ll, ll> pii;
#define fi first
#define se second
#define upb upper_bound
#define lwb lower_bound
#define show(x) cout << #x << " is " << x << "\n";
const ll inf = 2e18;
const ll mod = 1e9 + 7;
const ld pi = 3.141592653589793238462643383279502884;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void print(ll a[], ll n){for(ll i=0;i<n;i++){cout<<a[i]<<" ";}cout<<"\n";}
ll power(ll x, ll y){
if(y<=0) return 1;
ll ans = 1;
x %= mod;
while(y){
if(y&1)
ans = (x * ans) % mod;
x = (x * x) % mod;
y >>= 1;
}
return ans;
}
ll modInverse(ll n) {return power(n, mod-2);}
inline ll mul(ll a, ll b){ return (a * b) % mod; }
inline ll sub(ll a, ll b){ ll c = (a - b); if(c < 0) c += mod; return c; }
inline ll add(ll a, ll b){ ll c = (a + b); if(c >= mod) c -= mod; return c; }
inline ll divi(ll a, ll b){ return mul(a, modInverse(b)); }
//------------------------------------------------------------------------------------------
const ll N = 5e5 + 1;
//vector<ll> adj[N];
//bool visited[N];
const int B = sqrt(N); // sqrt(n)
struct Q {
int L, R, cmp, ind;
bool operator<(const Q &temp) const {
return cmp < temp.cmp;
}
};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
cout<<fixed<<setprecision(10);
ll n, q;
cin>>n>>q;
ll a[n];
map<ll, vi> mp;
for(int i=0;i<n;i++){
cin>>a[i];
mp[a[i]].pb(i);
}
int k=0;
for(auto it : mp){
for(auto x : it.second){
a[x] = k;
}
k++;
}
vi cnt(k);
vector<Q> que(q);
for(int i=0;i<q;i++){
cin>>que[i].L>>que[i].R;
que[i].L--;
que[i].R--;
que[i].cmp = (que[i].L/B)*n + que[i].R;
que[i].ind = i;
}
sort(all(que));
int l=0, r=-1, dist=0;
vi ans(q);
auto add = [&](int i) { if (++cnt[i]==1) dist++; };
auto rem = [&](int i) { if (--cnt[i]==0) dist--; };
for(auto it : que){
int l1 = it.L;
int r1 = it.R;
while(l<l1) rem(a[l++]);
while(l>l1) add(a[--l]);
while(r<r1) add(a[++r]);
while(r>r1) rem(a[r--]);
ans[it.ind] = dist;
}
for(int i=0;i<q;i++){
cout<<ans[i]<<"\n";
}
// cout<<"\n";
return 0;
}
| #include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define rep(i,N) for(int i=0;i<(int)N;i++)
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
static inline void PUT(char c)
{
static char buf[1<<15],*ptr=buf;
if(ptr==buf+strlen(buf)||c==0){fwrite(buf,1,ptr-buf,stdout),ptr=buf;}*ptr++=c;
}
static inline int IN(void)
{
int x=0,f=0,c=getchar();while(c<48||c>57){f^=c==45,c=getchar();}
while(c>47&&c<58){x=x*10+c-48,c=getchar();}return f?-x:x;
}
static inline void OUT(int a)
{
if(a<0)PUT('-'),a=-a;
int d[40],i=0;do{d[i++]=a%10;}while(a/=10);
while(i--){PUT(d[i]+48);}PUT('\n');
}
int N=0;
static inline void Add(int *fwt,int i,int v){while(i<N){fwt[i]+=v;i|=i+1;}}
static inline int Sum(int *fwt,int i){int v=0;while(i>=0){v+=fwt[i];i=(i&(i+1))-1;}return v;}
int main()
{
N=IN();int Q=IN(),after[500001],dat[500000],fenwick[500000],id[500001],left[500001],pos[500000],result[500000];
rep(i,N){dat[i]=IN()-1;}
rep(i,Q){left[i+1]=IN()-1;int r=IN()-1;after[i+1]=id[r];id[r]=i+1;}
for(int r=0;r<N;r++)
{
if(pos[dat[r]]){Add(fenwick,pos[dat[r]]-1,-1);}
Add(fenwick,r,1);
for(int i=id[r];i;i=after[i]){result[i-1]=Sum(fenwick,r)-Sum(fenwick,left[i]-1);}
pos[dat[r]]=r+1;
}
rep(i,Q){OUT(result[i]);}
} | 1 |
/*====Corycle====*/
#include<algorithm>
#include<iostream>
#include<iomanip>
#include<cstring>
#include<cstdlib>
#include<complex>
#include<cstdio>
#include<vector>
#include<cmath>
#include<ctime>
#include<stack>
#include<queue>
#include<map>
#define ll long long
using namespace std;
const int inf=0x3f3f3f3f;
const int Mod=1e9+7;
const int N=1e6+5;
int read(){
int s=0,f=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while(c>='0'&&c<='9'){s=s*10+c-'0';c=getchar();}
return s*f;
}
int n,m,a,b,Ans,fac[N],inv[N];
int mod(int x){return x>=Mod?x-Mod:x;}
void Prepare(){
fac[0]=fac[1]=inv[0]=inv[1]=1;
for(int i=2;i<N;i++)fac[i]=1ll*fac[i-1]*i%Mod;
for(int i=2;i<N;i++)inv[i]=1ll*inv[Mod%i]*(Mod-Mod/i)%Mod;
for(int i=2;i<N;i++)inv[i]=1ll*inv[i-1]*inv[i]%Mod;
}
int C(int n,int m){return n<m?0:1ll*fac[n]*inv[m]%Mod*inv[n-m]%Mod;}
int F(int n,int m){return C(n+m-2,n-1);}
int main(){
// freopen("_.in","r",stdin);
// freopen("_.out","w",stdout);
n=read();m=read();a=read();b=read();Prepare();
for(int i=1;i<=n-a;i++)Ans=mod(Ans+1ll*F(i,b)*F(n-i+1,m-b)%Mod);
printf("%d\n",Ans);
return 0;
} | #include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef vector<P> vpl;
#define rep(i,n) for(ll i=0; i<(n); i++)
#define REP(i,a,b) for(ll i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 510000;
ll dy[8] = {0,1,0,-1,1,-1,1,-1};
ll dx[8] = {1,0,-1,0,1,-1,-1,1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
if(a>b){
a = b; return true;
}
else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
if(a<b){
a = b; return true;
}
else return false;
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << endl;}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
cout << a << " " << b << " " << c << endl;
}
const int mod = 1e9 + 7;
vector<ll> fac(MAX), finv(MAX), inv(MAX);
void comInit(){
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for(ll i=2; i<MAX; i++){
fac[i] = fac[i-1]*i % mod;
inv[i] = mod - inv[mod%i] * (mod/i) % mod;
finv[i] = finv[i-1] * inv[i] % mod;
}
}
ll com(ll n, ll k){
if(n < k) return 0;
if(n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n-k] % mod) % mod;
}
int main(){
ll n,x; cin >> n >> x;
comInit();
vl a(n); rep(i,n) cin >> a[i];
sort(rall(a));
vvl dp(n+1,vl(x+1,0));
dp[0][x] = 1;
rep(i,n){
rep(j,x+1){
dp[i+1][j%a[i]] += inv[n-i] * dp[i][j];
dp[i+1][j] += ((n-1-i)*inv[n-i])%mod * dp[i][j];
dp[i+1][j%a[i]] %= mod;
dp[i+1][j] %= mod;
}
}
ll ans = 0;
rep(i,x+1){
ans += dp[n][i] * fac[n] % mod * i;
ans %= mod;
}
cout << ans << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define txt \
freopen("ip.txt", "r", stdin); \
freopen("op.txt", "w", stdout)
#define a3 INT_MAX
#define i3 INT_MIN
#define a6 INT64_MAX
#define i6 INT64_MIN
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define fo(i, n) for (int i = 0; i < (int)n; i++)
#define rep(i, k, n) for (int i = k; k < (int)n ? i < (int)n : i > (int)n; k < (int)n ? i += 1 : i -= 1)
#define quickie \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define div2(a) (!(a & 1))
#define deb(x) cout << (#x) << " " << (x) << "\n";
#define newl cout << "\n"
#define all(s) s.begin(), s.end()
#define pi 3.14159265358979323846
#define fp(x) fixed << setprecision(x) <<
template <class T>
T mod(T a)
{
if (a < 0)
{
a += 1000000007;
}
return a % 1000000007;
}
template <class T>
T addmod(T a, T b)
{
return (mod(a) + mod(b)) % 1000000007;
}
template <class T>
T prodmod(T a, T b)
{
return (mod(a) * mod(b)) % 1000000007;
}
template <class T>
T bin_exp(T a, T b)
{
T res = 1;
T temp = 1;
if (b <= 1)
return a;
if (b % 2 == 0)
res = bin_exp(a * a, b / 2);
else
{
res *= a;
temp = bin_exp(a, --b);
}
return res * temp;
}
template <class T>
T bin_expmod(T a, T b)
{
T res = 1;
T temp = 1;
if (b <= 1)
return a;
if (b % 2 == 0)
res = bin_expmod(prodmod(a, a), b / 2);
else
{
res = prodmod(a, res);
temp = bin_exp(a, --b);
}
return prodmod(res, temp);
}
template <class T>
int digit(T a)
{
vector<long long> dig = {
0,
9,
99,
999,
9999,
99999,
999999,
9999999,
99999999,
999999999,
9999999999,
99999999999,
999999999999,
9999999999999,
99999999999999,
999999999999999,
9999999999999999,
99999999999999999,
999999999999999999,
INT64_MAX};
auto it = lower_bound(dig.begin(), dig.end(), a);
int idx = (it - dig.begin());
return idx;
}
template <class T>
int sumAllInts(T n)
{
int a = 1;
int su = 0;
while (n)
{
su += n % 10;
n /= 10;
}
return su;
}
template <class T>
void split(char c, T s)
{
int n = s.size();
int i = 0;
while ((cout << s[i], i += 1) && (i < n) && (cout << c << ' '))
;
}
void print(vi &vec)
{
for (int i = 0; i < vec.size(); i++)
{
cout << vec[i] << " ";
}
}
void solve()
{
int n,t;
cin>>n>>t;
int temp;cin>>temp;
ll ans = t;
fo(i,n-1){
int te; cin>>te;
int diff = te - temp;
ans+=min(diff,t);
temp = te;
}
cout<<ans;
}
int main()
{
quickie;
//txt;
int t = 1;
while (t--)
{
solve();
newl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll N,T;cin >> N >> T;
ll sum =0;
vector<ll> C(N);
for(int i=0;i<N;i++){
cin >> C[i];
}
for(int i=0;i<N-1;i++){
sum += min(T,C[i+1]-C[i]);
}
sum += T;
cout << sum << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using iii = pair<ii, int>;
#define vt vector
#define pq priority_queue
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define __lcm(a, b) a * b / __gcd(a, b)
// #define multicase
const int MOD = 1e9 + 7;
const int INF = 2e9;
const int N = 2e5 + 5;
int x;
void solve() {
int T = 1;
#ifdef multicase
cin >> T;
#endif
while(T--) {
cin >> x;
cout << (x < 1200 ? "ABC\n" : x < 2800 ? "ARC\n" : "AGC\n");
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
solve();
} | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#include <cassert>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <functional>
#include <sstream>
using namespace std;
int main(int argc, char** argv) {
ios::sync_with_stdio(false);
cin.tie(0);
int r;
cin >> r;
if (r < 1200) {
cout << "ABC\n";
} else if (r < 2800) {
cout << "ARC\n";
} else {
cout << "AGC\n";
}
return 0;
} | 1 |
#include <iostream>
using namespace std;
int XX(int a, int d){
return a * a * d;
}
int main(){
int d;
while (true){
int sum = 0;
cin >> d;
if (cin.eof()) { break; }
for (int i = 0;i<600/d;i++){
sum += XX(i*d, d);
}
cout << sum << endl;
}
return 0;
} | #include<stdio.h>
int l;
int ans=0;
int main()
{
while(scanf("%d",&l)!=-1)
{
ans=0;
for(int i=0;i*l<600;i++)
{
ans=ans+i*l*i*l*l;
}
printf("%d\n",ans);
}
return 0;
} | 1 |
#include <iostream>
using namespace std;
int main(){
int a=0,b=0;
int na,nb;
int nc;
while(1){
cin>>nc;
if(nc==0) break;
a=b=0;
for(int i=0;i<nc;i++){
cin>>na>>nb;
if(na>nb) a+=(na+nb);
else if(na<nb) b+=(na+nb);
else {a+=na;b+=nb;}
}
cout<<a<<" "<<b<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
string station = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
int n;
int main() {
while(cin>>n) {
if(n==0) return 0;
vector<int> vec(n);
rep(i,n) {
int a; cin>>a;
vec[i]=a;
}
string ss;
cin>>ss;
rep(i,ss.size()) {
int a = i % vec.size();
int t = station.find(ss[i])-vec[a];
if(t<0) t += station.size();
t %= station.size();
cout<<station[t];
}
cout<<endl;
}
return 0;
} | 0 |
#include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define ALL(a) (a.begin()),(a.end())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL<<60;
const int INF = 1001001001;
/* --------------------------------------------------- */
int main() {
int a, b, k;
cin >> a >> b >> k;
rep(i, k) {
if(i % 2 == 0) {
a /= 2;
b += a;
} else {
b /= 2;
a += b;
}
}
cout << a << " " << b << endl;
return 0;
} | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
int main() {
int N, H, W; cin >> N >> H >> W;
cout << (N-H+1) * (N-W+1) << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
typedef long long int ll;
int main()
{
int n;
ll a, b, x, d, op = 0 ;
cin >> n >> x;
cin >> a >> b;
if( a + b > x )
{
d = a + b - x;
if( d <= b ){
b -= d;
}
else
{
b = 0;
}
op += d;
}
a = b;
rep(i,2,n)
{
cin >> b;
if( a + b > x )
{
d = a + b - x;
if( d <= b ){
b -= d;
}
else
{
b = 0;
}
op += d;
}
a = b;
}
cout << op<< endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main() {
int N, x;
cin >> N >> x;
vector<int> a(N);
for (int i = 0; i < N; ++i) cin >> a[i];
vector<int> cpa = a;
long long ans = 0;
for (int i = 0; i < N; ++i) {
if (i == 0) {
if (cpa[i] > x) ans += cpa[i] - x, cpa[i] = x;
}
else {
if (cpa[i] + cpa[i-1] > x) ans += cpa[i] + cpa[i-1] - x, cpa[i] = x - cpa[i-1];
}
}
cpa = a;
long long ans2 = 0;
for (int i = N - 1; i >= 0; i--) {
if (i == N - 1) {
if (cpa[i] > x) ans2 += cpa[i] - x, cpa[i] = x;
}
else {
if (cpa[i] + cpa[i+1] > x) ans2 += cpa[i] + cpa[i+1] - x, cpa[i] = x - cpa[i+1];
}
}
cout << min(ans, ans2) << endl;
return 0;
} | 1 |
// https://atcoder.jp/contests/abc152/tasks/abc152_c
#include <bits/stdc++.h>
using namespace std;
int main()
{
long a, b;
cin >> a >> b;
long ans = 0;
for (int x = a; x <= b; x++)
{
string s, t;
s = to_string(x);
t = s;
reverse(t.begin(), t.end());
if (s == t)
{
ans++;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int res = 0;
for (int i = A; i <= B; i++) {
if (i/10000 == i%10) {
if (i/1000%10 == i%100/10) {
res += 1;
}
i += 9;
}
}
cout << res << endl;
} | 1 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <random>
#include <chrono>
#include <bitset>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fastInp cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
const ll SIZE = 1e5 + 100, INF = 1e9 * 1e4 + 10, MOD = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll n, a, b, c, d, dp[SIZE][30], lf, q;
vector<ll> vec;
map<ll, ll> ch;
ll check(int val, int pos) {
if (val == 0) return pos;
ll lft = val, u = pos;
for (ll i = 29; i >= 0; i--) {
if (lft - (1ll << i) >= 0) {
u = dp[u][i];
lft -= (1ll << i);
}
}
return u;
}
void sol() {
cin >> n;
vec.resize(n);
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
cin >> lf;
cin >> q;
for (int i = 29; i >= 0; i--) {
dp[n - 1][i] = n - 1;
}
for (int i = vec.size() - 2; i >= 0; i--) {
int l = i, r = vec.size();
while (r - l > 1) {
int mid = (l + r) / 2;
if (vec[i] + lf < vec[mid]) {
r = mid;
}
else {
l = mid;
}
}
dp[i][0] = l;
for (int j = 1; j < 30; j++) {
dp[i][j] = dp[dp[i][j - 1]][j - 1];
}
}
while (q--) {
ll lq, rq;
cin >> lq >> rq;
if (lq > rq) swap(lq, rq);
if (lq == rq) {
cout << "0\n";
continue;
}
lq--;
rq--;
ll dist = 0, cur = lq, curR = rq;
int l = 0, r = vec.size() + 1;
while (r - l > 1) {
int mid = (l + r) / 2;
if (check(mid, cur) >= curR) {
r = mid;
}
else {
l = mid;
}
}
cout << r << "\n";
}
}
int main()
{
fastInp;
ll t = 1;
while (t--) {
sol();
}
return 0;
} | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#define print(x) (cout << (x) << endl)
#define pb push_back
#define mp make_pair
#define sz(x) int(x.size())
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
#define fs first
#define sc second
// 多倍長
#include <boost/rational.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using boost::rational;
using boost::multiprecision::cpp_int;
const int INF = 1e9;
const ll LLINF = 1e16;
const ll MOD = 1e9+7;
template<class T> inline void add(T &a, T b){a = ((a+b) % MOD + MOD) % MOD;};
template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
// 指定した文字cが文字列に何文字入ってるか
ll stringcount(string s, char c) {
return count(s.cbegin(), s.cend(), c);
}
// 割り算の切り上げ処理
template<typename T>
T rp(T a, T b) {
return (a + b - 1) / b;
}
// 桁和
template<typename T>
T digsum(T n) {
T res = 0;
while(n > 0) {
res += n%10;
n /= 10;
}
return res;
}
// 回文判定
bool kai (string s) {
string t{s};
reverse(begin(t), end(t));
return s == t;
}
using pint = pair<int, int>;
using pll = pair<ll, ll>;
int dp[3100][3100];
int main(void)
{
cout.tie(0);
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int n,t;
cin >> n >> t;
vector<pint> p(n);
rep(i, n){
cin >> p[i].fs >> p[i].sc;
}
sort(all(p));
int ans = 0;
rep(i, n){
rep(j, t){
chmax(dp[i + 1][j], dp[i][j]);
if(j < p[i].fs) continue;
chmax(dp[i + 1][j], dp[i][j - p[i].fs] + p[i].sc);
}
int now = dp[i][t - 1] + p[i].sc;
chmax(ans, now);
}
print(ans);
}
| 0 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
#include<list>
using namespace std;
int inf = 1000000000;
int main(void) {
string alp = "IVXLCDM";
int num[7] = {1, 5, 10, 50, 100, 500, 1000};
string s;
while(cin >> s){
reverse(s.begin(), s.end());
int n = 0;
int b = 0;
for(int i=0; i<s.size(); i++){
for(int j=0; j<7; j++){
if( s[i] == alp[j] ){
// cerr << n << " " << b << endl;
if( num[j] < b ) n -= num[j];
else n += num[j];
b = num[j];
}
}
}
cout << n << endl;
}
return 0;
}
// EOF | #include <stdio.h>
int main(void){
char fig[101];
int num;
while (scanf("%s", fig) != EOF){
num = 0;
for (char *pt=fig; *pt!='\0'; pt++){
switch (*pt){
case 'I':
switch(*(pt+1)){
case 'V':
num += 4;
pt++;
break;
case 'X':
num += 9;
pt++;
break;
default:
num += 1;
break;
}
break;
case 'V':
num += 5;
break;
case 'X':
switch(*(pt+1)){
case 'L':
num += 40;
pt++;
break;
case 'C':
num += 90;
pt++;
break;
default:
num += 10;
break;
}
break;
case 'L':
num += 50;
break;
case 'C':
switch(*(pt+1)){
case 'D':
num += 400;
pt++;
break;
case 'M':
num += 900;
pt++;
break;
default:
num += 100;
break;
}
break;
case 'D':
num += 500;
break;
case 'M':
num += 1000;
break;
}
}
printf("%d\n", num);
}
return 0;
} | 1 |
const int LG = 21;
const int FN = 400005;
const long long MOD = 998244353;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define forn(i, n) for (int (i) = 0; (i) != (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define fi first
#define se second
#define re return
#define pb push_back
#define uniq(x) sort(all(x)); (x).resize(unique(all(x)) - (x).begin())
#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " " << #x << " " << x << endl
#define ln cerr << __LINE__ << endl
#else
#define dbg(x) void(0)
#define ln void(0)
#endif // LOCAL
int cx[4] = {-1, 0, 1, 0};
int cy[4] = {0, -1, 0, 1};
ll inq(ll x, ll y)
{
if (!y) re 1 % MOD;
ll l = inq(x, y / 2);
if (y % 2) re l * l % MOD * x % MOD;
re l * l % MOD;
}
ll rev(ll x)
{
return inq(x, MOD - 2);
}
bool __precomputed_combinatorics = 0;
vector<ll> __fact, __ufact, __rev;
void __precompute_combinatorics()
{
__precomputed_combinatorics = 1;
__fact.resize(FN);
__ufact.resize(FN);
__rev.resize(FN);
__rev[1] = 1;
for (int i = 2; i < FN; i++) __rev[i] = MOD - __rev[MOD % i] * (MOD / i) % MOD;
__fact[0] = 1, __ufact[0] = 1;
for (int i = 1; i < FN; i++) __fact[i] = __fact[i - 1] * i % MOD, __ufact[i] = __ufact[i - 1] * __rev[i] % MOD;
}
ll fact(int x)
{
if (!__precomputed_combinatorics) __precompute_combinatorics();
return __fact[x];
}
ll cnk(int n, int k)
{
if (k < 0 || k > n) return 0;
if (!__precomputed_combinatorics) __precompute_combinatorics();
return __fact[n] * __ufact[n - k] % MOD * __ufact[k] % MOD;
}
int Root(int x, vector<int> &root)
{
if (x == root[x]) return x;
return root[x] = Root(root[x], root);
}
void Merge(int v, int u, vector<int> &root, vector<int> &sz)
{
v = Root(v, root), u = Root(u, root);
if (v == u) return;
if (sz[v] < sz[u])
{
sz[u] += sz[v];
root[v] = u;
}
else
{
sz[v] += sz[u];
root[u] = v;
}
}
int ok(int x, int n)
{
return 0 <= x && x < n;
}
const int N = 1100000;
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, m, k;
cin >> n;
vi a(2 * n);
forn(i, 2 * n) cin >> a[i];
sort(all(a));
ll ans = 0;
forn(i, n) ans += min(a[2 * i], a[2 * i + 1]);
cout << ans;
}
/* Note:
Check constants at the beginning of the code.
N is set to 4e5 but be careful in problems with large constant factor.
Setting N in every problem is more effective.
Check corner cases.
N = 1
No def int long long for now.
Add something here.
*/
| #include <iostream>
#include <algorithm>
using namespace std;
int N;
int L[200];
int main() {
int total = 0;
cin >> N;
for (int i = 0; i < 2 * N; i++) {
cin >> L[i];
}
sort(L, L + 2 * N);
for (int i = 0; i < 2 * N; i += 2) {
total += min(L[i], L[i + 1]);
}
cout << total;
} | 1 |
#include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <queue>
#include <iomanip>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ++i)
template<class T> inline bool chmax(T& a, T b) { if(a < b){ a=b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if(a > b){ a=b; return 1; } return 0;}
int main(){
int n;
cin >> n;
string s="";
while(n!=0){
if(n%-2==1){
s = '1'+s;
n /= -2;
}else if(n%-2==-1){
s = '1'+s;
n /= -2;
n += 1;
}else{
s = '0'+s;
n /= -2;
}
}
if(s.size()==0) s = "0";
cout << s << endl;
return 0;
} | #include <iostream>
#include <map>
typedef long long ll;
using namespace std;
// 素数 -> 個数
map<ll, ll> mp;
// 素数
map<ll, bool> prime;
bool isPrime(ll n) {
if (prime.find(n) != prime.end()) return prime[n];
if (n == 2) {
prime[2] = true;
return true;
}
else {
bool flg = true;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
flg = false;
break;
}
}
prime[n] = flg;
return flg;
}
}
void prime_split(ll n) {
ll gen = 2;
while (true) {
if (isPrime(gen)) {
if (mp.find(gen)==mp.end()) mp[gen] = 0;
while (n % gen == 0) {
n /= gen;
mp[gen] += 1;
}
}
if (n == 1) break;
gen++;
}
}
int main(void) {
int N;cin>>N;
ll result = 1;
for (int i = 2; i <= N; i++) {
prime_split(i);
}
for (map<ll,ll>::iterator it = mp.begin(); it != mp.end(); ++it) {
result *= it->second + 1;
result %= 1000000007;
}
cout << result << endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
a--;b--;
cout << (a+b-1)/a << endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstream>
#include <numeric>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
#define EPS (1e-7)
#define INF 1e18
#define max(p,q)((p)>(q)?(p):(q))
#define min(p,q)((p)<(q)?(p):(q))
#define PI (acos(-1))
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define rep(i, init, n) for(int i = init; i <(int)(n); i++)
int main() {
ll N, M;
cin >> N >> M;
if ((N % 2) == 1){
REP(i, M){
cout << (i + 1) << " " << (N - i - 1) << endl;
}
}else{
vector<P> v;
int i = 1;
while(v.size()<M+1){
v.push_back(P(i, N + 1 - i));
v.push_back(P(N / 2 - i, N / 2 + i));
i++;
}
REP(i, M) cout << v[i].first << " " << v[i].second << endl;
}
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
main()
{
int a, b, sum, c = 1;
cin >> a >> b;
sum = a;
if(b == 1){
cout << 0;
}
else if(b <= a){
cout << 1;
}
else{
while(1){
sum = sum + (a - 1);
c++;
if(sum >= b){
break;
}
}
cout << c;
}
}
///promy_pompom
//hello world
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
string S;
cin >> A >> B >> S;
string ans="Yes";
for (int i=0; i<A; i++) {
if (S[i]=='-') {
ans="No";
}
}
if (S[A]!='-') {
ans="No";
}
for (int i=A+1; i<A+B+1; i++) {
if (S[i]=='-') {
ans="No";
}
}
cout << ans << endl;
}
| 0 |
#include<iostream>
#include<vector>
#include <cmath>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#define rep(i,n) for (int i= 0;i<(n);++i)
using namespace std;
typedef long long ll;
int main(){
int n,m;
cin>>n>>m;
vector<string>vec(n);
int s;
string c;
rep(i,m){
cin>>s>>c;
if(n!=1&&s==1&&c=="0"){
cout<<-1<<endl;
return 0;
}
if(vec.at(s-1)==""){
vec.at(s-1)=c;
}else if(vec.at(s-1)!=c){
cout<<-1<<endl;
return 0;
}
}
string ans="";
if(n!=1&&vec.at(0)==""){
vec.at(0)="1";
}
rep(i,n){
if(vec.at(i)==""){
ans+="0";
}else{
ans+=vec.at(i);
}
}
cout<<ans<<endl;
}
|
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <math.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <bitset>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007; //998244353;
template<class _T> static void get(_T& a) {
std::cin >> a;
}
template<class _T> static void get(_T& a, _T& b) {
std::cin >> a >> b;
}
template<class _T> static void get(_T& a, _T& b, _T& c) {
std::cin >> a >> b >> c;
}
template <class _T> static _T tp_pow(int base, int exp)
{
_T ans = 1;
for (int i = 0; i < exp; i++) {
ans *= (_T)base;
}
return ans;
}
static void D();
int main()
{
D();
fflush(stdout);
return 0;
}
static void D()
{
int N, M;
get(N, M);
std::vector<int> num(N, -1);
for (int i = 0; i < M; i++) {
int s, c;
get(s, c);
if ((s > N) || ((num[s - 1] != -1) && (num[s - 1] != c))) {
printf("-1\n");
return;
}
num[s - 1] = c;
}
if (num[0] == 0 && N > 1) {
printf("-1\n");
return;
}
else if (num[0] == -1 && N > 1) num[0] = 1;
for (int i = 0; i < N; i++) {
if (num[i] < 0) num[i] = 0;
printf("%d", num[i]);
}
putchar('\n');
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
bool flag = (s.size()%2 == 0);
while(s.size()>0 && flag){
if(s.substr(0,2) == "hi"){
s = s.substr(2,s.size()-2);
}
else flag = 0;
}
cout << (flag?"Yes":"No") << endl;
} | #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char myGetchar() {
static char buf[IN_BUF], *ps = buf, *pt = buf;
if (ps == pt) {
ps = buf, pt = buf + fread(buf, 1, IN_BUF, stdin);
}
return ps == pt ? EOF : *ps++;
}
template<typename T>
inline bool read(T &x) {
bool op = 0;
char ch = getchar();
x = 0;
for (; !isdigit(ch) && ch != EOF; ch = getchar()) {
op ^= (ch == '-');
}
if (ch == EOF) {
return false;
}
for (; isdigit(ch); ch = getchar()) {
x = x * 10 + (ch ^ '0');
}
if (op) {
x = -x;
}
return true;
}
inline int readStr(char *s) {
int n = 0;
char ch = getchar();
for (; isspace(ch) && ch != EOF; ch = getchar())
;
for (; !isspace(ch) && ch != EOF; ch = getchar()) {
s[n++] = ch;
}
s[n] = '\0';
return n;
}
inline void myPutchar(char x) {
static char pbuf[OUT_BUF], *pp = pbuf;
struct _flusher {
~_flusher() {
fwrite(pbuf, 1, pp - pbuf, stdout);
}
};
static _flusher outputFlusher;
if (pp == pbuf + OUT_BUF) {
fwrite(pbuf, 1, OUT_BUF, stdout);
pp = pbuf;
}
*pp++ = x;
}
template<typename T>
inline void print_(T x) {
if (x == 0) {
putchar('0');
return;
}
static int num[40];
if (x < 0) {
putchar('-');
x = -x;
}
for (*num = 0; x; x /= 10) {
num[++*num] = x % 10;
}
while (*num){
putchar(num[*num] ^ '0');
--*num;
}
}
template<typename T>
inline void print(T x, char ch = '\n') {
print_(x);
putchar(ch);
}
inline void printStr_(const char *s, int n = -1) {
if (n == -1) {
n = strlen(s);
}
for (int i = 0; i < n; ++i) {
putchar(s[i]);
}
}
inline void printStr(const char *s, int n = -1, char ch = '\n') {
printStr_(s, n);
putchar(ch);
}
}
using namespace IO;
const char ch[] = "hi";
int n;
char s[15];
void solve() {
n = readStr(s);
if (n & 1) {
printStr("No");
return;
}
for (int i = 0; i < n; ++i) {
if (s[i] != ch[i % 2]) {
printStr("No");
return;
}
}
printStr("Yes");
}
int main() {
int T = 1;
// read(T);
while (T--) {
solve();
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
map<int, bool> m;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if(m[a]) m.erase(a);
else m[a] = true;
}
cout << m.size() << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
int main(void){
long long N;cin>>N;
std::vector<long long>A(N);
for(long long i=0;i<N;i++){
cin>>A[i];
}
sort(A.begin(),A.end());
long long ans=0;
long long tmp=0;
for(long long i=1;i<N;i++){
if(A[i]==A[i-1]){
tmp++;
if(i==N-1){
if(tmp%2==0){
ans++;
}
}
}
else{
if(tmp%2==0){
ans++;
}
tmp=0;
}
}
if(A[N-1]!=A[N-2]){
ans++;
}
cout<<ans<<endl;
return 0;
}
| 1 |
#pragma region header
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using ll = long long;
using P = pair<int, int>;
/* ----------------よく使う数字や配列----------------- */
int dx[] = {1,0,-1,0};
int dy[] = {0,1,0,-1};
constexpr ll mod = 1e9+7;
constexpr int inf = INT32_MAX/2;
constexpr ll INF = LLONG_MAX/2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
/* ----------------------end----------------------- */
/* --------------------テンプレート------------------ */
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
/* ----------------------end----------------------- */
/* --------------------ライブラリ-------------------- */
ll fact(int i) { //階乗
if (i == 0) return 1;
return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) { //最大公約数
if(b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { //最小公倍数
return a / gcd(a, b) * b ;
}
int keta(ll n) { //桁数を求める
if(n == 0) return 1;
int count = 0;
while(n != 0) {
n /= 10;
count++;
}
return count;
}
ll ketasum(ll n) { //各桁の和
ll sum = 0;
while(n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
bool isprime(int n) { //素数判定
if(n==1)return false;
if(n==2)return true;
for(int i = 2;i<=sqrt(n);i++) {
if(n%i==0) return false;
}
return true;
}
/* ----------------------end----------------------- */
#pragma endregion
vi prime_fact (int k) {
vi v;
for(int i = 2;i<=sqrt(k);i++) {
if(k%i==0) {
while(k%i==0) k/=i;
v.pb(i);
}
}
if(k!=1) v.pb(k);
return v;
}
signed main() {
int g;
{
int a,b;cin >> a >> b;
g=gcd(a,b);
}
cout << prime_fact(g).size()+1 << endl;
return 0;
} | #include <iostream>
#include <time.h>
#include <algorithm>
#include <stdio.h>
#include<string.h>
typedef long long LL;
using namespace std;
const int times = 20;
LL fac[1001];
int cnt;
LL mul(LL a, LL b, LL mod)
{
LL ans = 0;
while (b)
{
if (b & 1)
{
ans = (ans + a) % mod;
}
a = (a << 1) % mod;
b >>= 1;
}
return ans;
}
LL pow(LL a, LL b, LL mod)
{
LL ans = 1;
while (b)
{
if (b & 1)
{
ans = mul(ans, a, mod);
}
b >>= 1;
a = mul(a, a, mod);
}
return ans;
}
bool witness(LL a, LL n)
{
LL temp = n - 1;
int j = 0;
while (temp % 2 == 0)
{ // 其实就是得到 m
j++;
temp /= 2;
}
LL x = pow(a, temp, n);
if (x == 1 || x == n - 1)
{ // 判断a^m
return true;
}
while (j--)
{
x = mul(x, x, n); // 进一步判断 a^(2m) a^(4m) ...
if (x == n - 1)
return true;
}
return false;
}
bool miller_rabin(LL n)
{
if (n == 2)
{ // 如果是2肯定是素数
return true;
}
if (n < 2 || n % 2 == 0)
{ //如果小于2或者是大于2的偶数肯定不是素数
return false;
}
for (int i = 0; i < times; i++)
{ //随机化检验
LL a = rand() % (n - 1) + 1;
if (!witness(a, n))
return false;
}
return true;
}
LL gcd(LL a, LL b)
{ // 这里的gcd和一般的gcd不一样
if (a == 0)
{ // pollard_rho的需要
return 1;
}
if (a < 0)
{ // 可能有负数
return gcd(-a, b);
}
while (b)
{
LL t = a % b;
a = b;
b = t;
}
return a;
}
LL pollard_rho(LL n, LL c)
{ // 找因子
LL i = 1, k = 2; // 用来判断是否成环
LL xx = rand() % n, y = xx;
while (1)
{
i++;
xx = (mul(xx, xx, n) + c) % n;
LL d = gcd(y - xx, n);
if (1 < d && d < n)
{ // 找到一个因数
return d;
}
if (y == xx)
{ // 出现循环，那么查找失败
return n;
}
if (i == k)
{ // 相当一个优化？
y = xx;
k <<= 1;
}
}
}
void find(LL n)
{ // 通过因数来找质因子
if (miller_rabin(n))
{
fac[cnt++] = n; // 记录质因子
return;
}
LL p = n;
while (p >= n)
p = pollard_rho(p, rand() % (n - 1) + 1); //如果转了一圈还是p那么继续
find(p);
find(n / p);
}
int main()
{
srand(251);
LL a, b;
cin>>a>>b;
if(a==1||b==1){
cout<<1;
return 0;
}
if (miller_rabin(a))
{
if (b % a == 0)
cout << 2;
else
cout << 1;
return 0;
}
if (miller_rabin(b))
{
if (a % b)
cout << 2;
else
cout << 1;
return 0;
}
cnt = 0;
find(a);
LL fa[1001];
memcpy(fa, fac, sizeof(fac));
sort(fa, fa + cnt);
int ss = cnt;
cnt = 0;
find(b);
sort(fac, fac + cnt);
int ans = 0;
for (int i = 0; i < ss; i++) {
if (i && fa[i] == fa[i - 1])continue;
for (int j = 0; j < cnt; j++) {
if (j && fac[j] == fac[j - 1])continue;
if (fac[j] == fa[i])ans++;
}
}
cout << ans+1;
return 0;
} | 1 |
#include <bits/stdc++.h>
#define lol long long
using namespace std;
int main(){
int a,b,c;
string s,t,q;
cin>>a>>b;
cout<<a+(b-a)*2<<"\n";
return(0);
} | #include <bits/stdc++.h>
using namespace std;
#define loop(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < n; ++i)
#define dump(a) cerr << #a << " = " << (a) << "(L:" << __LINE__ << ")" << endl
void solve(long long A, long long B) {
cout << A * B << endl;
}
int main() {
long long A;
scanf("%lld", &A);
long long B;
scanf("%lld", &B);
solve(A, B);
return 0;
}
| 0 |
#include <bits/stdc++.h>
#include <limits>
#include <math.h>
#include <cmath>
#include <cctype>
#include <cstdio>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pll = pair<ll, ll> ;
using vs = vector<string>;
using vb = vector<bool>;
using vll = vector<long long>;
using vvll = vector<vector<long long >>;
#define PI 3.1415926535
#define rep(i, k, n) for(ll i = k; i < n; i++)
vector<vector<char>> maze; //迷路を表す文字列
vvll d; //距離
ll INF = 10000000000;
ll r, c;
ll dy[4] = {0, 1, 0, -1};
ll dx[4] = {1, 0, -1, 0};
ll bfs(){
queue<pll> que;
//全ての点をINFで初期化
rep(i, 0, r){
rep(j, 0, c){
d[i][j] = INF;
}
}
//スタート地点をキューに入れ、距離を0にする
que.push(pll(0, 0));
d[0][0] = 0;
//キューが空になるまでループ
while(que.size()){
//キューの先頭を取り出す
pll p = que.front();
que.pop();
//取り出してきたものがゴールなら探索終了
if(p.first == r-1 && p.second == c-1){break;}
//移動四方向ループ
rep(i, 0, 4){
//移動後の点(nx,ny)
ll ny = p.first + dy[i];
ll nx = p.second + dx[i];
//移動可能か、すでに訪れているか判定
if(ny >= 0 && ny < r && nx >= 0 && nx < c && d[ny][nx] == INF && maze[ny][nx] != '#'){
//移動できるならキューに入れ、その点をpの距離＋１にする
que.push(pll(ny, nx));
d[ny][nx] = d[p.first][p.second] + 1;
}
}
}
return d[r-1][c-1];
}
int main(){
cin >> r >> c;
maze = vector<vector<char>> (r,vector<char>(c));
d = vvll (r,vll(c,INF));
ll num_akichi = 0;
rep(i, 0, r){
rep(j, 0, c){
cin >> maze[i][j];
if(maze[i][j] == '.'){num_akichi ++;}
}
}
ll dist = bfs();
ll score;
if(dist == INF){score = -1;}
else{score = num_akichi - dist - 1;}
cout << score << endl;
}
| #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define D()
#define INF 1000000000000
#define MOD 10000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define INITA(a,i,j,v) for(ll k=i;k<=j;k++){a[k]=v;}
int main() {
int n; cin >> n;
string s, t; cin >> s >> t;
int res = 300;
FOR(i, 0, n) {
FOR(j, 0, n) {
string conc = s.substr(0, i) + t.substr(j, n-j);
if (conc.size() >= n && conc.substr(0, n) == s && conc.substr(conc.size()-n, n) == t) {
res = min(res, (int)conc.size());
}
}
}
cout << res << endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
const int maxn=100005;
inline int read(){
register int x=0,w=1,ch=getchar();
for(;ch<'0'||ch>'9';ch=getchar())if(ch=='-')w=-1;
for(;ch>='0'&&ch<='9';ch=getchar())x=x*10+ch-48;
return w*x;
}
int n,s,x[maxn];
long long p[maxn];
long long calc(int l,int r,int lst){
if(s<x[l])return x[r]-s;
if(x[r]<s)return s-x[l];
if(p[l]>=p[r]){
p[l]+=p[r];
return calc(l,r-1,l)+(lst==r)*(x[r]-x[l]);
}
else{
p[r]+=p[l];
return calc(l+1,r,r)+(lst==l)*(x[r]-x[l]);
}
}
int main(){
n=read(),s=read();
for(int i=1;i<=n;i++)
x[i]=read(),p[i]=read();
cout<<calc(1,n,p[1]<p[n]?1:n)<<'\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e15;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// __uint128_t
const ll MOD = 1e9+7;
int main(){
ll H, W; cin >> H >> W;
vector<string> S(H); for(int i = 0; i < H; i++) cin >> S[i];
ll bs = 0;
for(int i = 0; i < H; i++){
for(int j = 0; j < W; j++) if(S[i][j] == '#') bs++;
}
vector<vector<ll>> V(H, vector<ll>(W, INF));
queue<ll> qh, qw;
qh.push(0); qw.push(0);
V[0][0] = 0;
int dh[] = {0, 1, 0, -1};
int dw[] = {1, 0, -1, 0};
while(!qh.empty()){
ll h = qh.front(), w = qw.front();
qh.pop(), qw.pop();
for(int i = 0; i < 4; i++){
ll nh = h+dh[i], nw = w+dw[i];
if(0<=nh && nh < H && 0<=nw && nw<W && S[nh][nw] == '.' && V[h][w]+1<V[nh][nw]){
qh.push(nh);
qw.push(nw);
V[nh][nw] = V[h][w]+1;
}
}
}
if(V[H-1][W-1] == INF) cout << -1 << endl;
else cout << H*W-bs-V[H-1][W-1]-1 << endl;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
char str[303]; int dp[303][303][303] , N , K;
int solve(int x , int y , int z){
if(x > y) return 0;
if(x == y) return 1;
if(dp[x][y][z]) return dp[x][y][z];
if(str[x] == str[y]) return dp[x][y][z] = solve(x + 1 , y - 1 , z) + 2;
return dp[x][y][z] = max(solve(x + 1 , y , z) , max(solve(x , y - 1 , z) , z == 0 ? 0 : 2 + solve(x + 1 , y - 1 , z - 1)));
}
int main(){
scanf("%s %d" , str + 1 , &K); N = strlen(str + 1);
cout << solve(1 , N , K) << endl; return 0;
} | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
using namespace std;
const int inf=1<<28;
char s[310];
int n,f[310][310],g[310][310],K;
int main()
{
scanf("%s",s+1);n=strlen(s+1);
scanf("%d",&K);
memset(f,-63,sizeof(f));
for(int i=0;i<=K;i++) f[1][i]=1;
for(int i=2;i<=n;i++)
{
for(int j=1;j<i;j++)
for(int k=0;k<=K;k++) g[j][k]=f[j][k];
for(int j=0;j<=K;j++) g[i][j]=1;
for(int j=0;j<=K;j++)
{
int t1=0,t2=0;
for(int k=i-1;k>=1;k--)
{
t1=max(t1,f[k+1][j]);
if(j!=0) t2=max(t2,f[k+1][j-1]);
if(s[k]==s[i]) g[k][j]=max(g[k][j],t1+2);
else if(j!=0) g[k][j]=max(g[k][j],t2+2);
}
}
for(int j=1;j<=i;j++) for(int k=1;k<=K;k++) g[j][k]=max(g[j][k],g[j][k-1]);
for(int j=i-1;j>=1;j--) for(int k=0;k<=K;k++) g[j][k]=max(g[j][k],g[j+1][k]);
for(int j=1;j<=i;j++) for(int k=0;k<=K;k++) f[j][k]=max(f[j][k],g[j][k]);
}
int ans=0;
for(int i=1;i<=n;i++) for(int j=0;j<=K;j++) ans=max(ans,f[i][j]);
printf("%d",ans);
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define send {ios_base::sync_with_stdio(false);}
#define help {cin.tie(NULL); cout.tie(NULL);}
#define f first
#define s second
#define getunique(v) {sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end());}
typedef long long ll;
typedef long double lld;
typedef unsigned long long ull;
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v);
template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.f << ", " << p.s << ")"; }
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";
}
template<typename A, typename B> istream& operator>>(istream& cin, pair<A, B> &p) {
cin >> p.first;
return cin >> p.second;
}
mt19937 rng(std::chrono::steady_clock::now().time_since_epoch().count());
// mt19937 rng(61378913);
/* usage - just do rng() */
void usaco(string filename) {
// #pragma message("be careful, freopen may be wrong")
freopen((filename + ".in").c_str(), "r", stdin);
freopen((filename + ".out").c_str(), "w", stdout);
}
const lld pi = 3.14159265358979323846;
const ll mod = 1000000007;
// const ll mod = 998244353;
// ll mod;
ll n, m, k, q, l, r, x, y, z;
const ll template_array_size = 1e6 + 1389;
ll a[template_array_size];
ll b[template_array_size];
ll c[template_array_size];
string s, t;
ll ans = 0;
void solve(int tc = 0) {
cin >> n;
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
for (ll i = 0; i < n; i++) {
cin >> b[i];
}
reverse(b, b + n);
ll lpt = 0, rpt = n - 1;
for (ll i = 0; i < n; i++) {
if (a[i] == b[i]) {
if (b[lpt] != b[i] && a[lpt] != b[i]) {
swap(b[i], b[lpt]);
++lpt;
} else if (b[rpt] != b[i] && a[rpt] != b[i]) {
swap(b[i], b[rpt]);
--rpt;
} else {
cout << "No\n";
return;
}
}
}
for (ll i = 0; i < n; i++) {
if (a[i] == b[i]) {
cout << "No\n";
return;
}
}
cout << "Yes\n";
for (ll i = 0; i < n; i++) {
cout << b[i] << " ";
}
cout << '\n';
}
int main() {
#ifdef galen_colin_local
auto begin = std::chrono::high_resolution_clock::now();
#endif
send help
#ifndef galen_colin_local
// usaco("moop");
#endif
// usaco("cowland");
// freopen("tc.cpp", "r", stdin);
int tc = 1;
// cin >> tc;
for (int t = 0; t < tc; t++) solve(t);
#ifdef galen_colin_local
auto end = std::chrono::high_resolution_clock::now();
cout << setprecision(4) << fixed;
// cout << "Execution time: " << std::chrono::duration_cast<std::chrono::duration<double>>(end - begin).count() << " seconds" << endl;
#endif
} | #include<map>
#include<set>
#include<bitset>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<chrono>
#include<stack>
#include<fstream>
#include<list>
#include<math.h>
#define REP(i,x,y) for(ll i=x;i<=y;i++)
#define SIZE(a) ll(a.size())
#define vll vector<ll>
#define MEMSET(a, n, m) for(ll i=0;i<=n;i++) a[i] = m
#define BIT(n) (ll(1)<<n)
#define UNIQUE(v) v.erase(unique(v.begin(),v.end()),v.end())
#define UNIQUE_ARRAY(a,x) unique(a + 1, a + x + 1) - a - 1
#define SORT(a,n) sort(a+1,a+n+1)
#define SORT_O(a,n,order) sort(a+1,a+n+1,order)
#define PER(i,y,x) for(ll i=y;i>=x;i--)
typedef long long ll;
using namespace std;
double const PI = 3.1415926535;
struct edge{
ll from; long long to; long long cost;
bool operator<(const edge& rhs) const {
return cost > rhs.cost;
}
};
ll const MAX_UF = 200005;
ll parent[MAX_UF];
ll rk[MAX_UF];
void init(ll n) {
for (ll i = 1; i <= n; i++) {
parent[i] = i;
rk[i] = 1;
}
}
ll find(ll x) {
if (parent[x] == x) {
return x;
}
parent[x] = find(parent[x]);
return parent[x];
}
bool same(ll x, ll y) {
return find(x) == find(y);
}
void unite(ll x, ll y) {
if (!same(x, y)) {
x = parent[x];
y = parent[y];
if (rk[x] < rk[y]) {
parent[x] = y;
}
else {
parent[y] = x;
if (rk[x] == rk[y]) {
rk[x]++;
}
}
}
}
ll const MAX_seg = 800005; //4倍に取っておく
ll segtree[MAX_seg];
ll mintree[MAX_seg];
//演算
ll op(ll x, ll y) {
return min(x, y);
}
//init valueの変更を忘れない
ll const INIT_VALUE = 1e17;
ll n_ = 1;
void init_seg(ll n) {
while (n_ <= n) {
n_ *= 2;
}
REP(i, 1, n_ * 2) {
segtree[i] = INIT_VALUE;
}
REP(i, n_ , n_ * 2) {
mintree[i] = i - n_;
}
REP(i, 1, n_ - 1) {
mintree[i] = mintree[i * 2];
}
}
//k番目をxでupdate
void update(ll k, ll x) {
k += n_;
segtree[k] = x;
while (k >= 1) {
k /= 2;
segtree[k] = op(segtree[k * 2], segtree[k * 2 + 1]);
if (segtree[k * 2] > segtree[k * 2 + 1]) {
mintree[k] = mintree[k * 2 + 1];
}
else {
mintree[k] = mintree[k * 2];
}
}
}
ll val_o(ll a, ll b, ll k, ll l, ll r,ll& g) {
if (a <= l && r <= b) {
g = mintree[k];
return segtree[k];
}
else if (r <= a || b <= l) {
//ここの値注意
return INIT_VALUE;
g = mintree[k];
}
else {
ll g1 = 0; ll g2 = 0;
ll x1 = val_o(a, b, k * 2, l, (l + r) / 2, g1);
ll x2 = val_o(a, b, k * 2 + 1, (l + r) / 2, r, g2);
if (x1 > x2) {
g = g2;
}else{
g = g1;
}
return op(x1, x2);
}
}
//[a,b)のvalueを求める
ll val(ll a, ll b, ll& g) {
return val_o(a, b, 1, 0, n_, g);
}
ll const MAX = 2e5;
ll n, d;
ll a[MAX];
ll ord[MAX];
bool orders(ll x, ll y) {
return a[x] < a[y];
}
ll bignumber = 5e16;
priority_queue<edge> pq;
void makegraph(ll type) {
init_seg(n);
REP(i, 1, n) {
ll cur = ord[i];
if (i > 1) {
ll min_i = 0;
ll min_a;
if (type == 1) {
min_a = val(cur + 1, n + 1, min_i);
}
else {
min_a = val(1, cur, min_i);
}
// cout << type << " " << cur << " " << min_a << endl;
if (min_a <= bignumber) {
ll c;
if (type == 1) {
c = min_a - d * cur + a[cur];
}
else {
c = min_a + d * cur + a[cur];
}
pq.push({ min_i,cur,c });
}
}
ll t = a[cur] + type * cur * d;
update(cur, t);
// cout << "?" << cur << " " << t << endl;
}
}
int main() {
cin >> n >> d;
REP(i, 1, n) {
cin >> a[i];
}
REP(i, 1, n) {
ord[i] = i;
}
SORT_O(ord, n, orders);
makegraph(1);
makegraph(-1);
ll ans = 0;
init(n);
while (!pq.empty()) {
edge cur = pq.top();
pq.pop();
//cout << "!" << cur.cost << endl;
if (!same(cur.from, cur.to)) {
ans += cur.cost;
unite(cur.from, cur.to);
}
}
cout << ans << endl;
}
| 0 |
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <iomanip>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<long double> VD;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<VD> VVD;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
template<typename T> void chmin(T &a, T b) { if (a > b) a = b; }
template<typename T> void chmax(T &a, T b) { if (a < b) a = b; }
int in() { int x; scanf("%d", &x); return x; }
ll lin() { ll x; scanf("%lld", &x); return x; }
#define INF 1LL<<60
int main() {
int N;
cin >> N;
set<ll> numbers;
map<ll, ll> map_numbers;
REP(i, N) {
ll tmp;
cin >> tmp;
numbers.insert(tmp);
map_numbers[tmp]++;
}
ll ans = 0;
FORR(t, 37, 1) {
ll x = pow(2, t-1);
ll y = pow(2, t);
if(numbers.size() == 0) break;
ll max = *numbers.rbegin();
if(max < x) continue;
set<ll> to_remove;
for(auto a = numbers.rbegin(); a != numbers.rend(); ++a) {
if(map_numbers[*a]==0) continue;
if(*a < x) break;
if(map_numbers[y - *a]>0 && *a != y - *a) {
ll num_pair = min(map_numbers[*a], map_numbers[y-*a]);
ans+=num_pair;
map_numbers[y-*a]-=num_pair;
map_numbers[*a]-=num_pair;
if(map_numbers[*a] == 0)
to_remove.insert(*a);
if(map_numbers[y-*a] == 0)
to_remove.insert(y-*a);
} else if(map_numbers[y - *a]>=2 && *a == y - *a) {
ll num_pair = map_numbers[*a] / 2;
ans+=num_pair;
map_numbers[*a]-=num_pair;
if(map_numbers[*a] == 0)
to_remove.insert(*a);
} else {
map_numbers[*a] = 0;
to_remove.insert(*a);
}
}
for(ll r: to_remove) {
numbers.erase(numbers.find(r));
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rng(i,l,r) for(int i=int(l);i<int(r);i++)
#define rep(i,r) rng(i,0,r)
#define rrng(i,l,r) for(int i=int(r)-1;i>=int(l);i--)
#define rrep(i,r) rrng(i,0,r)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define si(x) int(x.size())
#define inf INT_MAX/2-100
#define infl LLONG_MAX/3
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<' '<<#x<<' '<<x<<endl
#else
#define dmp(x) void(0)
#endif
template<class t,class u>bool chmax(t&a,u b){if(a<b)a=b;return a<b;}
template<class t,class u>bool chmin(t&a,u b){if(b<a)a=b;return b<a;}
template<class t>using vc=vector<t>;
template<class t>using vvc=vector<vector<t>>;
using pi=pair<int,int>;
using pl=pair<ll,ll>;
using vi=vc<int>;
using vl=vc<ll>;
ll readl(void){
ll x;
cin>>x;
return x;
}
int readi(void){
int x;
cin>>x;
return x;
}
string readstr(){
string s;
cin>>s;
return s;
}
vi readvi(int n,int off=0){
vi v(n);
rep(i,n)v[i]=readi(),v[i]+=off;
return v;
}
vl readvl(int n,int off=0){
vl v(n);
rep(i,n)v[i]=readl(),v[i]+=off;
return v;
}
template<class t>
void print(t x,int suc=1){
cout<<x;
if(suc==1)cout<<"\n";
if(suc==2)cout<<" ";
}
template<class t>
void print(const vc<t>&v,int suc=1){
rep(i,si(v))print(v[i],i==int(si(v))-1?1:suc);
}
template<class t>
bool inc(t a,t b,t c){
return !(c<b||b<a);
}
template<class t>
void compress(vc<t>&v){
sort(all(v));
v.erase(unique(all(v)),v.ed);
}
template<class t>
int lwb(const vc<t>&v,const t&a){
return lower_bound(all(v),a)-v.bg;
}
template<class t>
struct Compress{
vc<t>v;
Compress()=default;
Compress(const vc<t>&x){
add(x);
}
Compress(const initializer_list<vc<t> >&x){
for(auto &p:x)add(p);
}
void add(const t&x){
v.eb(x);
}
void add(const vc<t>&x){
copy(all(x),back_inserter(v));
}
void build(){
compress(v);
}
int get(const t&x)const{
return lwb(v,x);
}
vc<t>get(const vc<t>&x)const{
vc<t>res(x);
for(auto &p:res)p=get(p);
return res;
}
const t &operator[](int x)const{
return v[x];
}
int size(){
return v.size();
}
};
void Yes(bool ex=true){
cout<<"Yes\n";
if(ex)exit(0);
}
void YES(bool ex=true){
cout<<"YES\n";
if(ex)exit(0);
}
void No(bool ex=true){
cout<<"No\n";
if(ex)exit(0);
}
void NO(bool ex=true){
cout<<"NO\n";
if(ex)exit(0);
}
void orYes(bool x,bool ex=true){
if(x)Yes(ex);
else No(ex);
}
void orYES(bool x,bool ex=true){
if(x)YES(ex);
else NO(ex);
}
void Possible(bool ex=true){
cout<<"Possible\n";
if(ex)exit(0);
}
void POSSIBLE(bool ex=true){
cout<<"POSSIBLE\n";
if(ex)exit(0);
}
void Impossible(bool ex=true){
cout<<"Impossible\n";
if(ex)exit(0);
}
void IMPOSSIBLE(bool ex=true){
cout<<"IMPOSSIBLE\n";
if(ex)exit(0);
}
void orPossible(bool x,bool ex=true){
if(x)Possible(ex);
else Impossible(ex);
}
void orPOSSIBLE(bool x,bool ex=true){
if(x)POSSIBLE(ex);
else IMPOSSIBLE(ex);
}
ll n,m,vis[100005],ans,e,o,s,r;
vl g[100005];
bool dfs(int v,int k){
bool res=true;
vis[v]=k;
s++;
for(auto &i:g[v]){
if(vis[i]==0){
res&=dfs(i,k*-1);
}else if(vis[i]==k){
res=false;
}
}
return res;
}
int main(void){
cin.tie(0);
ios::sync_with_stdio(0);
cin>>n>>m;
rep(i,m){
ll a,b;
cin>>a>>b;
g[--a].pb(--b);
g[b].pb(a);
}
fill(vis,vis+n,0);
r=n;
rep(i,n){
if(vis[i]==0){
s=0;
bool bd=dfs(i,1);
if(s==1)ans+=r*2LL-1LL,r--;
else if(bd)e++;
else o++;
}
}
ans+=o*o;
ans+=e*o*2LL;
ans+=e*e*2LL;
print(ans);
} | 0 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef vector<ll> vel;
typedef vector<str> ves;
#define REP(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, b) REP(i, 0, b)
const ll mod = 1000000007;
const double pi = 3.14159265358979;
ll expo(ll a, ll b){
ll ex = 1;
rep(i, b){
ex *= a;
}
return ex;
}
ll fact(ll a){
ll fc = 1;
REP(i, 1, a+1){
fc *= i;
}
return fc;
}
int main() {
ll a, b;
cin >> a >> b;
cout << max(a+b, max(a-b, a*b)) << endl;
} | #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
#include <cassert>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int a, b;
cin >> a >> b;
int d = 0;
rep(i, b) {
int c;
cin >> c;
d = max(d, c);
}
cout << max(0, d-(a-d)-1) << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, x;
cin >> n >> x;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
sort(a.begin(), a.end());
int res = 0;
rep(i, n) {
int aa = a.at(i);
if (aa > x) {
break;
}
if (i == n - 1) {
if (aa != x) {
break;
}
}
x -= aa;
res++;
}
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <set>
using namespace std;
using pii = pair<int,int>;
using pll = pair<long long, long long>;
const long long INF = 1<<29;
const int MOD = 1000000007;
long long ruizyou(long long m,long long n){
if(m == 0)return 0;
if(m == 1)return 1;
long long ans = 1;
long long tmp = m;
for(int i=0;i<=30;i++){
if(n & (1<<i)){
ans *= tmp;
ans %= MOD;
}
tmp *= tmp;
tmp %= MOD;
}
return ans;
}
long long kaizyou(long long x){
if(x == 0)return 1;
return x * kaizyou(x-1) % MOD;
}
long long comb(long long x,long long y){
long long bunsi = kaizyou(x);
long long bunbo = kaizyou(x-y) * kaizyou(y) % MOD;
return bunsi * ruizyou(bunbo,MOD-2) % MOD;
}
struct unionfind{
vector<int> par;
vector<vector<int>> children;
vector<int> hukasa;
vector<int> kazu;
unionfind(int n){
par = vector<int>(n);
hukasa = vector<int>(n,0);
kazu = vector<int>(n,1);
for(int i=0;i<n;i++){
par.at(i) = i;
}
}
int root(int x){
if(par.at(x) == x)return x;
return root(par.at(x));
}
void unite(int x,int y){
int rx = root(x);
int ry = root(y);
if(rx == ry)return;
if(hukasa.at(rx) >= hukasa.at(ry)){
par.at(ry) = rx;
hukasa.at(rx) = max(hukasa.at(ry) + 1,hukasa.at(rx));
kazu.at(rx) += kazu.at(ry);
}
else{
par.at(rx) = ry;
kazu.at(ry) += kazu.at(rx);
}
}
void newkazu(){
int n = kazu.size();
for(int i=0;i<n;i++){
kazu.at(i) = kazu.at(root(i));
}
}
bool same(int x,int y){
return root(x) == root(y);
}
};
int ctoi(char a){
return a - '0';
}
long long gcd(long long a,long long b){
long long c = max(a,b);
long long d = min(a,b);
if(d % c == 0)return c;
return gcd(c,d%c);
}
long long lcm(long long a,long long b){
return a * b / gcd(a,b);
}
void hukasa(vector<vector<int>> s,vector<vector<int>> table,int &ans,pii frm,int n,int m){
int x,y;
tie(x,y) = frm;
set<pii> se;
if(x-1 >= 0)se.insert(pii(x-1,y));
if(x+1 < n)se.insert(pii(x+1,y));
if(y-1 >= 0)se.insert(pii(x,y-1));
if(y+1 < m)se.insert(pii(x,y+1));
for(auto t:se){
int tx,ty;
tie(tx,ty) = t;
if(s.at(tx).at(ty) && table.at(tx).at(ty) == -1){
table.at(tx).at(ty) = table.at(x).at(y) + 1;
ans = max(ans,table.at(tx).at(ty));
hukasa(s,table,ans,t,n,m);
table.at(tx).at(ty) = -1;
}
}
}
void daiku(int frm,vector<vector<pii>> g,vector<int> &cost,int n){
priority_queue<pii,vector<pii>,greater<pii>> q;
q.push(pii(cost.at(frm),frm));
vector<bool> kakutei(n,false);
while(!q.empty()){
pii now = q.top();
q.pop();
int n1,n2;
tie(n1,n2) = now;
if(kakutei.at(n2))continue;
kakutei.at(n2) = true;
for(auto t:g.at(n2)){
int tx,ty;
tie(tx,ty) = t;
if(cost.at(tx) > n1 + ty){
cost.at(tx) = n1 + ty;
q.push(pii(cost.at(tx),tx));
}
}
}
}
int main(){
int n;
string s;
cin >> n >> s;
vector<int> r(n+1,0),g(n+1,0),b(n+1,0);
for(int i=0;i<n;i++){
if(s.at(i) == 'R')r.at(i)++;
else if(s.at(i) == 'G')g.at(i)++;
else b.at(i)++;
}
for(int i=n-2;i>=0;i--){
r.at(i) += r.at(i+1);
g.at(i) += g.at(i+1);
b.at(i) += b.at(i+1);
}
long long ans = 0;
for(int i=0;i<n-2;i++){
for(int j=i+1;j<n-1;j++){
if(s.at(i) == s.at(j))continue;
unordered_set<char> se;
se.insert(s.at(i));
se.insert(s.at(j));
char c;
if(!se.count('R')){
ans += r.at(j+1);
if(j+(j-i) < n && s.at(j+(j-i)) == 'R')ans--;
}
else if(!se.count('G')){
ans += g.at(j+1);
if(j+(j-i) < n && s.at(j+(j-i)) == 'G')ans--;
}
else{
ans += b.at(j+1);
if(j+(j-i) < n && s.at(j+(j-i)) == 'B')ans--;
}
}
}
cout << ans << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int rr[8], cc[8];
int r[8], c[8];
int main(){
int k;
cin >> k;
int count=0;
for(int i=0;i<k;i++) cin >> r[i] >> c[i];
for(int co=0;co<pow(8,8-k);co++)
{
for(int i=0;i<8;i++)
{
rr[i]=-1;
cc[i]=-1;
}
//無理やり配置を用意して
for(int i=0;i<8;i++)
{
rr[i]=i;
if(i<k) cc[r[i]]=c[i];
}
int hoge=0;
for(int i=0;i<8;i++)
{
int a=pow(8,hoge);
if(cc[i]==-1)
{
cc[i]=co%(a*8)/a;
hoge++;
}
}
//襲撃をtrueで埋めて
bool masu[8][8]{false};
for(int i=0;i<8;i++)
{
for(int j=1;j<8;j++)
{
if(cc[i]-j>=0) masu[rr[i]][cc[i]-j]=true;
if(cc[i]+j<=7) masu[rr[i]][cc[i]+j]=true;
if(rr[i]-j>=0) masu[rr[i]-j][cc[i]]=true;
if(rr[i]+j<=7) masu[rr[i]+j][cc[i]]=true;
if(rr[i]-j>=0&&cc[i]-j>=0) masu[rr[i]-j][cc[i]-j]=true;
if(rr[i]+j<=7&&cc[i]-j>=0) masu[rr[i]+j][cc[i]-j]=true;
if(rr[i]-j>=0&&cc[i]+j<=7) masu[rr[i]-j][cc[i]+j]=true;
if(rr[i]+j<=7&&cc[i]+j<=7) masu[rr[i]+j][cc[i]+j]=true;
}
}
count=0;
for(int j=0;j<8;j++)
{
if(masu[rr[j]][cc[j]]==false) count++;
}
//cout << count << endl;
if(count==8)
{
count=0;
for(int j=0;j<k;j++)
{
if(c[j]==cc[r[j]]) count++;
}
if(count==k)
{
break;
//return 0;
}
}
}
for(int i=0;i<8;i++)
{
for(int j=0;j<8;j++)
{
if(cc[i]==j) cout << 'Q';
else cout <<'.';
}
cout << endl;
}
//cout << "hoge"<< endl;
return 0;
}
| #include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
const int INF=1<<29;
const double EPS=1e-9;
const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
bool ok(int x, int y) {
if (x < 0 || x >= 8 || y < 0 || y >= 8) return false;
return true;
}
bool check(int nowmap[8][8]) {
int count = 0;
for (int i = 0; i < 8; i++) {
for (int j = 0; j < 8; j++) {
if (nowmap[i][j] == 1) {
count++;
}
}
}
if (count >= 9) {
return false;
}
for (int i = 0; i < 8; i++) {
for (int j = 0; j < 8; j++) {
if (nowmap[i][j] == 1) {
int dx[] = {1,1,-1,-1};
int dy[] = {1,-1,-1,1};
for (int k = 0; k < 4; k++) {
int px = j;
int py = i;
while(ok(px + dx[k], py + dy[k])) {
px += dx[k];
py += dy[k];
if (nowmap[py][px] == 1) {
return false;
}
}
}
}
}
}
return true;
}
void print(int nowmap[8][8]) {
for (int i = 0; i < 8; i++) {
for (int j = 0; j < 8; j++) {
if (nowmap[i][j] == 1) {
cout << "Q";
} else {
cout << ".";
}
}
cout << endl;
}
}
int main(int argc, char const *argv[]) {
int N;
cin >> N;
int map[8][8] = {{0}};
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
map[a][b] = 1;
}
std::vector<int> perm;
for (int i = 0; i < 8; i++) {
perm.push_back(i);
}
do {
int nowmap[8][8] = {{0}};
for (int i = 0; i < 8; i++) {
for (int j = 0; j < 8; j++) {
nowmap[i][j] = map[i][j];
}
}
for (int i = 0; i < 8; i++) {
int x = i;
int y = perm[i];
nowmap[y][x] = 1;
}
if (check(nowmap)) {
print(nowmap);
return 0;
}
} while(next_permutation(perm.begin(), perm.end()));
return 0;
} | 1 |
// include
// ------------------------------------------------
#include <bits/stdc++.h>
#include <algorithm>
#include <math.h>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
int getDigit(int n); // 数字の桁数を取得する。
string upper(string str); // 英字を大文字に変換する。
string lower(string str); // 英字を小文字に変換する。
// class
// ------------------------------------------------
class Combi
{
public:
Combi();
long long Combination(long long n, long long k);
private:
vector<vector<long long>> memo;
long long n_num;
long long k_num;
void Resize(long long n, long long k);
};
// define
// ------------------------------------------------
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define sz(a) int((a).size())
#define rep(i,n) for(int(i)=0;(i)<(n);(i)++)
#define repe(i,n) for(int(i)=0;(i)<=(n);(i)++)
#define vsort(v) sort((v).begin(),(v).end())
#define rvsort(v) sort(rall((v)))
#define vi vector<int>
#define GCD(a,b) __gcd((a),(b))
#define LCM(a,b) (a)/GCD((a),(b))*(b)
#define kiriage(a,b) ((a)+(b)-1)/(b)
const int INF = 1e9;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<long> vll;
// code
// ------------------------------------------------
int main() {
ll x,y;
cin >> x >> y;
ll ans = 0;
if(x * y > 0)
{
ans = abs(y-x) + ( x < y ? 0 : 2);
}
else if(x == 0)
{
ans = abs(y) + ( y < 0 ? 1 : 0);
}
else if(y == 0)
{
ans = abs(x) + ( x < 0 ? 0 : 1);
}
else
{
ans = abs( y + x ) + 1;
}
cout << ans << endl;
return 0;
}
// funcの実体
// ------------------------------------------------
int getDigit(int n)
{
int i = 1;
while(1)
{
n = n / 10;
if(n == 1)
break;
i++;
}
return i;
}
int CalcSumOfDigit(int n)
{
int s = 0;
while(n)
{
s += n % 10;
n = n / 10;
}
return s;
}
string upper(string str)
{
for(auto itr = str.begin();itr != str.end() ; itr++)
{
if(97 <= *itr && *itr <= 122)
{
*itr = *itr - 32;
}
}
return str;
}
string lower(string str)
{
for(auto itr = str.begin();itr != str.end() ; itr++)
{
if(65 <= *itr && *itr <= 90)
{
*itr = *itr + 32;
}
}
return str;
}
Combi::Combi(){
n_num = -1;
k_num = -1;
};
ll Combi::Combination(ll n, ll k)
{
Resize(n,k);
ll ret;
if(memo[n][k] != 0)
{
ret = memo[n][k];
}
else if(n == k || k == 0)
{
memo[n][k] = 1;
ret = 1;
}
else
{
ret = Combination(n - 1, k - 1) + Combination(n - 1, k);
memo[n][k] = ret;
}
return ret;
}
void Combi::Resize(ll n, ll k)
{
if(n_num <= n || k_num <= k)
{
n_num = (n + 1) * 2;
k_num = (k + 1) * 2;
memo.resize(n_num);
for(auto itr = memo.begin(); itr != memo.end(); ++itr)
{
itr->resize(k_num);
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int x, y;
cin >> x >> y;
if (x == 0){
if (y >= 0){
cout << y << endl;
} else {
cout << 1 - y << endl;
}
} else if (y == 0){
if (x <= 0){
cout << -x << endl;
} else {
cout << x + 1 << endl;
}
} else if (x <= y){
if (x >= 0 && y >= 0){
cout << y - x << endl;
} else if (x <= 0 && y <= 0){
cout << y - x << endl;
} else if (abs(x) <= abs(y)){
cout << y + x + 1 << endl;
} else {
cout << -x - y + 1 << endl;
}
} else {
if (x >= 0 && y >= 0){
cout << x - y + 2 << endl;
} else if (y <= x && x <= 0){
cout << x - y + 2 << endl;
} else if (abs(x) <= abs(y)){
cout << -x - y + 1 << endl;
} else {
cout << x + y + 1 << endl;
}
}
} | 1 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <functional>
#include <numeric>
#include <iomanip>
#include <climits>
#include <cstring>
#include <cmath>
using namespace std;
#define int long long
#define rep(i, n) for (int i=0;i<(int)(n);++i)
#define rep1(i, n) for (int i=1;i<=(int)(n);++i)
#define rrep(i, n) for (int i=(int)(n)-1;i>=0;--i)
#define rrep1(i, n) for (int i=(int)(n);i>=1;--i)
#define range(i, l, r) for (int i=l;i<(int)(r);++i)
#define rrange(i, l, r) for (int i=(int)(r)-1;i>=l;--i)
#define unless(a) if(!(a))
#define all(a) begin(a),end(a)
#define fst first
#define scd second
#define PB emplace_back
#define PPB pop_back
using vi=vector<int>;
using pii=pair<int, int>;
using vpii=vector<pii>;
using ll=long long;
constexpr int TEN(int n){return n==0?1:10*TEN(n-1);}
template<typename T>bool chmin(T&a,T b){return a>b?(a=b,1):0;}
template<typename T>bool chmax(int&a,int b){return a<b?(a=b,1):0;}
int read(){int a;scanf("%lld",&a);return a;}
const double pi = acos(-1);
constexpr int inf = 3*TEN(18) + 10;
signed main()
{
int N,A,B; cin >> N >> A >> B;
vi X(N);
rep(i, N) cin >> X[i];
int ans = 0, cur = X[0];
rep(i, N - 1) {
ans += min((X[i + 1] - cur) * A, B);
cur = X[i + 1];
}
cout << ans << endl;
}
| #pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please
const int cm = 1 << 17;
char cn[cm], * ci = cn + cm, ct;
inline char getcha() {
if (ci - cn == cm) { fread_unlocked(cn, 1, cm, stdin); ci = cn; }
return *ci++;
}
inline int getint() {
int A = 0;
if (ci - cn + 16 > cm) while ((ct = getcha()) >= '0') A = A * 10 + ct - '0';
else while ((ct = *ci++) >= '0') A = A * 10 + ct - '0';
return A;
}
const int dm = 1400000;
char dn[dm], * di = dn;
//const int MAX = 1000;
//class unko {
//public:
// char C[MAX * 6 + 10];
// int K[MAX + 10];
// constexpr unko() : C(), K() {
// auto di = C + 1;
// C[0] = '0';
// K[0] = 0;
// K[1] = 1;
// rep1(i, MAX) {
// int X = i;
// int keta = 0;
// char c[10] = {};
// while (X) {
// *(c + keta) = '0' + X % 10;
// X /= 10;
// keta++;
// }
// for (int j = keta - 1; j >= 0; j--)* di++ = (*(c + j));
// K[i + 1] = K[i] + keta;
// }
// }
//};
//constexpr unko f;
//inline void putint(ll X) {
// int ue = X / 1000;
// if (ue) {
// for (int i = f.K[ue]; i < f.K[ue + 1]; i++)* di++ = f.C[i];
// int sita = X - ue * 1000;
// rep(i, 3 - f.K[sita + 1] + f.K[sita])* di++ = '0';
// for (int i = f.K[sita]; i < f.K[sita + 1]; i++)* di++ = f.C[i];
// }
// else for (int i = f.K[X]; i < f.K[X + 1]; i++)* di++ = f.C[i];
// *di++ = '\n';
//}
inline void putint(int X) {
if (X == 0) {
*di++ = '0';
*di++ = '\n';
return;
}
int keta = 0;
char C[10];
while (X) {
*(C + keta) = '0' + X % 10;
X /= 10;
keta++;
}
for (int i = keta - 1; i >= 0; i--)* di++ = (*(C + i));
*di++ = '\n';
}
int main() {
//cin.tie(0);
//ios::sync_with_stdio(false);
int N = getint(), K = getint();
int A[200001];
rep(i, N) A[i] = getint();
ll owa = ll(N) * N;
rep(p, K) {
int B[200001] = {};
rep(i, N) {
B[max(0, i - A[i])]++;
B[min(N, i + A[i] + 1)]--;
}
ll kei = B[0];
A[0] = B[0];
rep1(i, N - 1) {
kei +=(A[i] = A[i - 1] + B[i]);
}
if (kei == owa) break;
}
rep(i, N) putint(A[i]);
fwrite(dn, 1, di - dn, stdout);
Would you please return 0;
} | 0 |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long long
#define pb push_back
#define PF push_front //deque
#define mp make_pair
#define pq priority_queue
#define mod 1000000007
#define f first
#define s second
#define pii pair< int, int >
#define vi vector<int>
#define vpii vector<pii>
#define debug(v) for(auto i:v) cout<<i<<" ";
#define tc int t; cin >> t; while(t--)
using namespace std;
string repeat(string s, int n) {
string s1 = "";
for (int i=0; i<n;i++)
s1+=s;
return s1;
}
string getString(char x) {
string s(1, x);
return s;
}
void optimizeIO(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int gcd(int a, int b){
if (a == 0) return b;
return gcd(b % a, a);
}
void solve(){
int n;
cin>>n;
int a[n+2];
rep(i,1,n+1) cin>>a[i];
a[0]=0;
a[n+1]=0;
// int mn=*min_element(a,a+n),mx=*max_element(a,a+n);
int v1[n+1],pref[n+1];
rep(i,0,n+1) v1[i]=abs(a[i+1]-a[i]);//a[i+1]*a[i]>=0?abs(a[i+1]-a[i]):abs(a[i+1]-a[i])*2;
pref[0]=v1[0];
rep(i,1,n+1) pref[i]=pref[i-1]+v1[i];
rep(i,1,n+1){
ll ans=abs(a[i+1]-a[i-1])-abs(a[i]-a[i-1])-abs(a[i+1]-a[i])+pref[n];
cout<<ans<<endl;
}
}
int main(){
optimizeIO();
// tc
{ solve();
}
}
| #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,n) for (int64_t i=0; i<(n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
int n; cin>>n;
vector<int> p(n);
rep(i,n) cin>>p[i];
int sum=0;
rep(i,n-1){
sum+=abs(p[i]-p[i+1]);
}
sum+=abs(p[0]); sum+=abs(p[n-1]);
if(p[0]*(p[1]-p[0])>=0){
cout<<sum<<endl;
}else{
cout<<sum-2*min(abs(p[0]), abs(p[1]-p[0]))<<endl;
}
for(int i=1; i<n-1; ++i){
if((p[i-1]-p[i])*(p[i]-p[i+1])>=0){
cout<<sum<<endl;
}else{
cout<<sum-2*min(abs(p[i-1]-p[i]), abs(p[i]-p[i+1]))<<endl;
}
}
if((p[n-2]-p[n-1])*p[n-1]>=0){
cout<<sum<<endl;
}else{
cout<<sum-2*min(abs(p[n-2]-p[n-1]), abs(p[n-1]))<<endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 5, mod = 1e9 + 7;
int n;
vector<int> adj[N];
vector<int> bfs(int src){
vector<int> vis(n + 2, 0);
vector<int> dis(n + 1, 0);
vis[src] = 1;
dis[src] = 0;
queue<int> q;
q.push(src);
while(q.size()){
int node = q.front();
q.pop();
for(auto i: adj[node]){
if(!vis[i]){
vis[i] = 1;
dis[i] = dis[node] + 1;
q.push(i);
}
}
}
return dis;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int pos_a, pos_b;
cin >> n >> pos_a >> pos_b;
if(pos_a == pos_b) return cout << 0, 0;
for(int i = 1; i < n; i++){
int u, v;
cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
auto dis_a = bfs(pos_a);
auto dis_b = bfs(pos_b);
int ans = 0;
for(int i = 1; i <= n; i++){
if(dis_a[i] < dis_b[i]) ans = max(ans, dis_b[i] - 1);
}
cout << ans;
return 0;
}
| #include<stdio.h>
int main(){
int N;
int n1;
int M;
int m1;
int k;
scanf("%d %d %d %d %d",&N ,&n1,&M,&m1,&k );
int waktu = ((M*60+m1)-(N*60+n1))-k;
printf ("%d",waktu);
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
string query(int n) {
cout << n << '\n' << flush;
string s; cin >> s;
if (s == "Vacant") exit(0);
return s;
}
int main() {
int n; cin >> n;
int l = 0;
int r = n - 1;
string L = query(l);
string R = query(r);
while (true) {
int m = (l + r) / 2;
R = query(m);
if ((L == R) ^ (m % 2)) l = m;
else r = m;
}
return 0;
} | // This amazing code is by Eric Sunli Chen.
#include<bits/stdc++.h>
using namespace std;
template<typename T> bool get_int(T &x)
{
char t=getchar();
bool neg=false;
x=0;
for(; (t>'9'||t<'0')&&t!='-'&&t!=EOF; t=getchar());
if(t=='-')neg=true,t=getchar();if(t==EOF)return false;
for(; t<='9'&&t>='0'; t=getchar())x=x*10+t-'0';
if(neg)x=-x;return true;
}
template<typename T> void print_int(T x)
{
if(x<0)putchar('-'),x=-x;
short a[20]= {},sz=0;
while(x>0)a[sz++]=x%10,x/=10;
if(sz==0)putchar('0');
for(int i=sz-1; i>=0; i--)putchar('0'+a[i]);
}
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define get1(a) get_int(a)
#define get2(a,b) (get1(a)&&get1(b))
#define get3(a,b,c) (get1(a)&&get2(b,c))
#define printendl(a) print_int(a),puts("")
typedef long long LL;
typedef unsigned long long uLL;
typedef pair<int,int> pii;
const int inf=0x3f3f3f3f;
const LL Linf=1ll<<61;
const double pi=acos(-1.0);
bool P(int x){for(int i=2;i*i<=x;i++)if(x%i==0)return false;return true;}
int p[1111],p1[1111],p2[1111],tot,n;
LL a[555][555];
int main()
{
for(int i=2;i<=10000&&tot<1002;i++)if(P(i))p[++tot]=i;
for(int i=1;i<=501;i++)p1[i*2-1]=p[i];
for(int i=1;i<=501;i++)p2[i*2-1]=p[i+501];
for(int i=1;i<=501;i++)for(int j=1;j<=501;j++)
{
int k1=i+j-1,k2=i-j+501;
a[i][j]=1;
if(k1%2==1)a[i][j]*=p1[k1];else a[i][j]*=p1[k1-1]*p1[k1+1];
if(k2%2==1)a[i][j]*=p2[k2];else a[i][j]*=p2[k2-1]*p2[k2+1];
if(k1%2==0)a[i][j]++;
}
get1(n);
for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)printf("%lld%c",a[i][j],j==n?'\n':' ');
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
#define F first
#define S second
#define mod 1000000007
#define pb push_back
#define FOR(i,a,n) for(int i=a;i<n;i++)
#define REV(i,a,n) for(int i=a;i>=n;i--)
#define all(a) a.begin(),a.end()
const int NUM = 2e5 + 5;
int32_t main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int num_tests=1;
//cin >> num_tests;
while(num_tests-->0){
int n; cin >> n;
int ans = 0;
while(n >= 500)
{
int x = n/500;
ans += x*1000;
n -= (x)*500;
}
while(n >= 5)
{
int y = n/5;
ans += y*5;
n -= y*5;
}
cout << ans;
}
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
int main() {
fast_io;
long long x;
cin>>x;
long long thousand=(x/500)*1000;
long long rest=(x%500)/5*5;;
long long ans=thousand+rest;
cout<<ans<<endl;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
const int MAXN=10005;
int P=1e9+7,d,len;
char k[MAXN];
long long a[MAXN],dp[10005][105];
long long dfs(int pos,int tot,bool lim)
{
// cout<<pos<<' '<<tot<<' '<<lim<<endl;
if(pos==len+1)
{
if(tot==0) return 1;
return 0;
}
if(!lim&&dp[pos][tot]!=-1) return dp[pos][tot];
long long ret=0 , up=lim?a[pos]:9 ;
for(int i=0;i<= up ;++i)
{
ret=(ret+dfs(pos+1,(tot+i)%d, lim&&i==a[pos] ))%P;
//(ret+=dfs(pos+1,(tot+i)%d, lim&&i==a[pos] ) )%=P;
}
if(!lim) dp[pos][tot]=ret;
return ret;
}
int main()
{
memset(dp,-1,sizeof(dp));
scanf("%s",k+1);
scanf("%d",&d);
len=strlen(k+1);
for(int i=1;i<=len;++i)
{
a[i]=k[i]-'0';
}
long long ans=(dfs(1,0,1)-1+P)%P;
printf("%lld\n",ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ld long double
#define ll long long
#define pb push_back
#define F first
#define S second
const int A = 3e2 + 2;
const int mod = 1e9 + 7;
int n;
bool vis[A][A][A];
ld mem[A][A][A];
ld solve (int c1, int c2, int c3) {
if (c1 + c2 + c3 == 0) return 0;
if (vis[c1][c2][c3])
return mem[c1][c2][c3];
vis[c1][c2][c3] = 1;
int c0 = n - (c1 + c2 + c3);
ld ret = 1;
if (c1)
ret += solve(c1 - 1, c2, c3) * (c1 / (n * 1.0));
if (c2)
ret += solve(c1 + 1, c2 - 1, c3) * (c2 / (n * 1.0));
if (c3)
ret += solve(c1, c2 + 1, c3 - 1) * (c3 / (n * 1.0));
ret /= (1 - (c0 / (n * 1.0)));
return mem[c1][c2][c3] = ret;
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n;
int freq[4] = {};
for (int i = 0, x; i < n; i++) {
cin >> x;
freq[x]++;
}
cout << setprecision(9) << fixed << solve(freq[1], freq[2], freq[3]);
return 0;
} | 0 |
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<iostream>
using namespace std;
#define MAX 100
int main(){
int n,dammy;
cin>>n;
int p[MAX+1];
cin>>p[0];
for(int i=0;i<n-1;i++){
cin>>p[i+1];
cin>>dammy;
}
cin>>p[n];
int C[MAX+1][MAX+1];
for(int i=1;i<=n;i++) C[i][i]=0;
for(int h=2;h<=n;h++){
for(int s=1;s<=n-h+1;s++){
int e=s+h-1;
C[s][e]=C[s][s]+C[s+1][e]+p[s-1]*p[s]*p[e];
for(int j=s+1;j<e;j++){
C[s][e]=min(C[s][e],C[s][j]+C[j+1][e]+p[s-1]*p[j]*p[e]);
}
}
}
cout<<C[1][n]<<endl;
}
| #include <bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;i++)
using namespace std;
int dp[111][111],n,L[111],R[111];
int dfs(int l,int r){
if(dp[l][r]!=-1)return dp[l][r];
int res=1e9;
for(int i=l;i<r;i++){
res=min(res,dfs(l,i)+dfs(i+1,r)+L[l]*R[i]*R[r]);
}
return dp[l][r]=res;
}
signed main(){
memset(dp,-1,sizeof(dp));
r(i,111)dp[i][i]=0;
cin>>n;
r(i,n)cin>>L[i]>>R[i];
cout<<dfs(0,n-1)<<endl;
}
| 1 |
#include<bits/stdc++.h>
#define reg register
const int maxn = 1000005;
int N;
char S[maxn];
char T[maxn];
int main(){
scanf("%d", &N);
scanf("%s%s", S+1, T+1);
int flag = 1;
for(reg int i = 1; i <= N; i ++)
if(S[i] != T[i]){ flag = 0; break ; }
if(flag){ printf("0\n"); return 0; }
int Min_l = N, Ans = 1;
std::queue <int> Q;
for(reg int i = N; i >= 1; i --){
Min_l = std::min(i, Min_l);
if(T[i] == T[i-1]) continue ;
while(Min_l && S[Min_l] != T[i]) Min_l --;
if(!Min_l){ printf("-1\n"); return 0; }
while(!Q.empty()){
if(Q.front()-Q.size()+1 > i) Q.pop();
else break ;
}
Q.push(Min_l);
if(Min_l != i) Ans = std::max(Ans, (int)Q.size() + 1);
}
printf("%d\n", Ans);
return 0;
} | /******************
* Author: BD747 *
******************/
#include<algorithm>
#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<map>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<string>
#include<vector>
#include<bits/stdc++.h>
using namespace std;
#define MP make_pair
int r[100005];
int FIND(int x){
return (x==r[x]) ? x : (r[x]=FIND(r[x]));
}
int n;
long long ans;
vector<pair<int,pair<int,int> > > v;
pair<pair<int,int>,int> g[100005];
int cnt;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
for(int i=0;i<=100000;i++){
r[i]=i;
}
cin>>n;
for(int i=0;i<n;i++){
cin>>g[i].first.first>>g[i].first.second;
g[i].second=i;
}
sort(g,g+n);
for(int i=0;i<n-1;i++){
int x1=g[i].first.first,y1=g[i].first.second,id1=g[i].second;
int x2=g[i+1].first.first,y2=g[i+1].first.second,id2=g[i+1].second;
v.push_back(MP( min(abs(x1-x2),abs(y1-y2)) , MP(id1,id2)));
g[i].first.first=y1;g[i].first.second=x1;
}
int x=g[n-1].first.first,y=g[n-1].first.second;
g[n-1].first.first=y;
g[n-1].first.second=x;
sort(g,g+n);
for(int i=0;i<n-1;i++){
int x1=g[i].first.first,y1=g[i].first.second,id1=g[i].second;
int x2=g[i+1].first.first,y2=g[i+1].first.second,id2=g[i+1].second;
v.push_back(MP( min(abs(x1-x2),abs(y1-y2)) , MP(id1,id2)));
}
sort(v.begin(),v.end());
//cout<<pq.size()<<endl;
for(int i=0;i<v.size();i++){
int id1=v[i].second.first,id2=v[i].second.second,len=v[i].first;
if( !(FIND(id1)==FIND(id2)) ){
ans+=((long long)len);
r[FIND(id1)]=FIND(id2);
cnt++;
}
if(cnt>=n-1){
break;
}
}
cout<<ans<<endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> b;
while(n!=0){
if(abs(n)%2==0)
b.push_back(0);
else{
b.push_back(1);
n--;
}
n/=-2;
}
if(b.empty())
cout<<0;
for(int i=b.size()-1;i>=0;i--)
cout<<b.at(i);
cout<<endl;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 9;
const long long mod = 1e9 + 7;
struct matrix {
int n, m;
long long a[N][N];
matrix(int n, int m) : n(n), m(m) {
memset(a, 0, sizeof a);
}
void reset() {
memset(a, 0, sizeof a);
for(int i = 0; i<n; i++)
a[i][i] = 1;
}
const long long * operator[](const int id) const {
return a[id];
}
long long * operator[](const int id) {
return a[id];
}
matrix operator*(const matrix& mat) const {
matrix ret(this->n, mat.m);
for(int i = 0; i<this->n; i++) {
for(int j = 0; j<mat.m; j++) {
long long &now = ret[i][j];
now = 0;
for(int k = 0; k<this->m; k++) {
now = (now + this->a[i][k] * mat[k][j]) % mod;
}
}
}
return ret;
}
void print() {
for(int i = 0; i<n; i++) {
for(int j = 0; j<m; j++)
cout << a[i][j] << " ";
cout << endl;
}
}
matrix operator^(long long pw) const {
matrix ret(n, m), base = *this;
ret.reset();
while(pw) {
if(pw & 1)
ret = ret*base;
base = base*base;
pw >>= 1;
}
return ret;
}
};
int nol[][N] = {{0, 0, 0, 0, 0, 0, 0, 0, 0},
{1, 0, 1, 0, 0, 0, 0, 0, 0},
{0, 1, 0, 0, 0, 0, 0, 0, 0},
{0, 0, 0, 0, 0, 0, 0, 0, 0},
{0, 0, 0, 1, 0, 1, 0, 0, 0},
{0, 0, 0, 0, 1, 0, 0, 0, 0},
{0, 0, 0, 0, 0, 0, 0, 0, 0},
{0, 0, 0, 0, 0, 0, 1, 0, 1},
{0, 0, 0, 0, 0, 0, 0, 1, 0}};
int one[][N] = {{0, 1, 0, 0, 0, 0, 0, 0, 0},
{0, 0, 1, 0, 0, 0, 0, 0, 0},
{0, 0, 0, 0, 0, 0, 0, 0, 0},
{1, 0, 0, 0, 1, 0, 0, 0, 0},
{0, 0, 0, 0, 0, 1, 0, 0, 0},
{0, 0, 0, 0, 0, 0, 0, 0, 0},
{0, 0, 0, 1, 0, 0, 1, 1, 0},
{0, 0, 0, 0, 0, 0, 0, 0, 1},
{0, 0, 0, 0, 0, 0, 0, 0, 0}};
const int L = 3e5 + 5;
char s[L];
int main() {
matrix m0(N, N), m1(N, N), m01(N, N);
for (int i = 0; i < N; ++i)
for (int j = 0; j < N; ++j) {
m0[i][j] = nol[i][j];
m1[i][j] = one[i][j];
m01[i][j] = nol[i][j] + one[i][j];
}
matrix res(N, 1);
res[0][0] = 1;
scanf("%s", s);
int n = strlen(s);
for (int i = 0; i < n; ++i) {
if (s[i] == '0')
res = m0 * res;
else if (s[i] == '1')
res = m1 * res;
else
res = m01 * res;
// cerr << i << " cek" << end
// res.print();
}
long long ans = res[3][0] + res[6][0] + res[7][0] + res[8][0];
ans %= mod;
if (ans < 0) ans += mod;
printf("%lld\n", ans);
return 0;
} | 0 |
#include "bits/stdc++.h"
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define rep(i,N) for(ll i = 0; i < (ll)N; i++)
#define repi(i,a,b) for(ll i = ll(a); i < ll(b); ++i)
template<class T>bool chmax(T &former, const T &b) { if (former<b) { former=b; return true; } return false; }
template<class T>bool chmin(T &former, const T &b) { if (b<former) { former=b; return true; } return false; }
template<class T>T sqar(T x){ return x*x; }//sqrt(x)は平方根;
#define Sort(v) std::sort(v.begin(), v.end(), std::greater<decltype(v[0])>()) //降順でVをソート
#define p_queue(v) priority_queue<v, vector<v>, greater<v> >
template<class T> inline void princ(T x){cout<<x<<" ";};
template<class T> inline void print(T x){cout<<x<<"\n";};
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
///////////////////////////////////////////////////////////////////////////////////
ll n,m;
Vi a;
ll cal(ll n){
switch(n){
case 1:
return 2;
break;
case 2:
case 3:
case 5:
return 5;
break;
case 4:
return 4;
break;
case 6:
return 6;
break;
case 7:
return 3;
break;
case 8:
return 7;
break;
case 9:
return 6;
break;
default:
return 0;
break;
}
}
vector<string> dp;
int main(){
cin.tie(0);ios::sync_with_stdio(false);
std::cout<<std::fixed<<std::setprecision(30);
cin>>n>>m;
a.resize(m);
rep(i,m){
cin>>a[i];
}
dp.resize(n+10,"-1");
dp[0]="";
rep(i,n){
if(dp[i]=="-1")continue;
rep(j,a.size()){
ll tmp = i+cal(a[j]);
string fig = dp[i]+(char)('0'+a[j]);
string now = dp[tmp];
if(now=="-1" || now.size()<fig.size()){
dp[tmp] = fig;
}else if(now.size()>fig.size()){
}else{
chmax(dp[tmp],fig);
}
}
}
print(dp[n]);
return 0;
} | #include<iostream>
#include<iomanip>
#include<algorithm>
#include<bitset>
#include<cstdio>
#include<cmath>
#include<deque>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<string>
#include<tuple>
#include<utility>
#include<vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<vector<long long>> vvll;
typedef vector<vector<int>> vvi;
#define rep(i, a, n) for(int i=a; i<n; i++)
#define REP(i, n) for(int i=0; i<(int)(n); i++)
#define REPS(i, n) for(int i=1; i<=(int)(n); i++)
#define PER(i, n) for(int i=(int)(n)-1; i>= 0; i--)
#define PERS(i, n) for(int i=(int)(n); i>0; i--)
#define FOR(i, c) for(__typeof((c).begin()) i = (c).begin(); i!=(c).end(); i++)
#define RFOR(i, c) for(__typeof((c).rbegin()) i=(c).rbegin(); i!=(c).end(); i++)
#define ALL(container) (container).begin(), (container).end()
#define RALL(container) (container).rbegin(), (container).rend()
#define SZ(container) (container).size()
#define FILL0(n) setfill('0') << right << setw(n)
#define mp(a, b) make_pair(a, b)
#define toLower(c) c+0x20
#define toUpper(c) c-0x20
#define pb push_back
#define eb emplace_back
const int INF = 1e9;
const long long LLINF = 1e18;
const ull MOD = 998244353;
const int MSIZE = 100007;
const double Pi = 3.14159265358979323146;
int main(){
int match[10] = {6,2,5,5,4,5,6,3,7,6};
int n, m; cin >> n >> m;
vector<int> num(m), dp(n+100, -INF);
REP(i, m){
cin >> num[i];
}
dp[0]=0;
sort(RALL(num));
string ans = "";
for(int i=1; i<=n; i++){
REP(j, m){
if(i-match[num[j]]<0) continue;
dp[i] = max(dp[i], dp[i-match[num[j]]]+1);
}
}
//cout << n << ":" << ans << endl;
while(n>0){
REP(j, m){
if(n-match[num[j]]<0) continue;
if(dp[n-match[num[j]]]==dp[n]-1){
ans += ('0'+num[j]);
n-=match[num[j]];
//cout << n << ":" << ans << endl;
break;
}
}
}
cout << ans << endl;
}
| 1 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <cstring>
#define N 100002
using namespace std;
struct node{
int u,v,w;
}e[200002];
vector<int> id[N];
int head[2000002],ver[2000002],nxt[2000002],edge[2000002],l;
int n,m,i,j,cnt[N],now[N],dis[2000002],num;
bool in[2000002];
int read()
{
char c=getchar();
int w=0;
while(c<'0'||c>'9') c=getchar();
while(c<='9'&&c>='0'){
w=w*10+c-'0';
c=getchar();
}
return w;
}
int my_comp(const node &x,const node &y)
{
return x.w<y.w;
}
void insert(int x,int y,double z)
{
l++;
ver[l]=y;
edge[l]=z;
nxt[l]=head[x];
head[x]=l;
}
void SPFA(int s)
{
queue<int> q;
memset(dis,0x3f,sizeof(dis));
q.push(s);
dis[s]=0;in[s]=1;
while(!q.empty()){
int x=q.front();
q.pop();
for(int i=head[x];i;i=nxt[i]){
int y=ver[i];
if(dis[y]>dis[x]+edge[i]){
dis[y]=dis[x]+edge[i];
if(!in[y]){
in[y]=1;
q.push(y);
}
}
}
in[x]=0;
}
}
int main()
{
n=read(),m=read();
for(i=1;i<=m;i++) e[i].u=read(),e[i].v=read(),e[i].w=read();
sort(e+1,e+m+1,my_comp);
for(i=1;i<=m;i++){
int u=e[i].u,v=e[i].v,w=e[i].w;
if(now[u]!=w) cnt[u]++,now[u]=w,id[u].push_back(++num);
if(now[v]!=w) cnt[v]++,now[v]=w,id[v].push_back(++num);
insert(id[u][cnt[u]-1],id[v][cnt[v]-1],0);
insert(id[v][cnt[v]-1],id[u][cnt[u]-1],0);
}
for(i=1;i<=n;i++){
for(j=0;j<cnt[i];j++){
insert(num+i,id[i][j],1);
insert(id[i][j],num+i,1);
}
}
SPFA(num+1);
if(dis[num+n]==dis[0]) cout<<"-1"<<endl;
else cout<<dis[num+n]/2<<endl;
return 0;
}
| #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,no-stack-protector,fast-math")
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define IO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;
const int N = 1e5 + 5, M = 4 * N + 5;
int head[N], nxt[M], to[M], typ[M], ne, n;
void init(){
ne = 0;
memset(head, -1, n * sizeof head[0]);
}
void addEdge(int f, int t, int ty){
to[ne] = t;
typ[ne] = ty;
nxt[ne] = head[f];
head[f] = ne++;
}
void addBiEdge(int a, int b, int ty){
addEdge(a, b, ty);
addEdge(b, a, ty);
}
struct state{
int dis;
set<int> typs;
};
state node[N];
bool inQ[N];
int dij(){
priority_queue<pair<int, int> , vector<pair<int, int>>, greater<pair<int, int>>> pq;
pq.emplace(0, 0);
for(int i = 0 ; i < n ; ++i)
node[i].dis = (int)1e9;
node[0].dis = 0;
inQ[0] = true;
int cst, v;
while(pq.size()){
auto top = pq.top();
pq.pop();
int u = top.second;
int d = top.first;
inQ[u] = false;
if(node[u].dis < d)continue;
for(int e = head[u] ; ~e ; e = nxt[e]){
v = to[e];
cst = (node[u].typs.find(typ[e]) == node[u].typs.end());
if(node[u].dis + cst < node[v].dis){
inQ[v] = true;
node[v] = {node[u].dis + cst, {typ[e]}};
pq.emplace(node[v].dis, v);
}
else if(node[u].dis + cst == node[v].dis){
if(node[v].typs.find(typ[e]) != node[v].typs.end())continue;
node[v].typs.emplace(typ[e]);
if(!inQ[v])
pq.emplace(node[v].dis, v), inQ[v] = true;
}
}
}
if(node[n - 1].dis > n)
node[n - 1].dis = -1;
return node[n - 1].dis;
}
int main(){
IO;
int m;
scanf("%d %d", &n, &m);
init();
while(m--){
int u, v, ty;
scanf("%d %d %d", &u, &v, &ty);
addBiEdge(--u, --v, ty);
}
printf("%d\n", dij());
} | 1 |
#include <iostream>
using namespace std;
typedef struct {
int top;
int S;
int E;
int W;
int N;
int bottom;
} dice;
void swap4(int *a, int *b, int *c, int *d) {
int tmp = *a;
*a = *b;
*b = *c;
*c = *d;
*d = tmp;
}
void roll(dice *dp, char dir) {
if (dir == 'E') {
swap4(&(dp->top), &(dp->W), &(dp->bottom), &(dp->E));
} else if (dir == 'N') {
swap4(&(dp->top), &(dp->S), &(dp->bottom), &(dp->N));
} else if (dir == 'S') {
swap4(&(dp->top), &(dp->N), &(dp->bottom), &(dp->S));
} else {
swap4(&(dp->top), &(dp->E), &(dp->bottom), &(dp->W));
}
}
int main(void){
dice d;
dice *dp = &d;
cin >> dp->top >> dp->S >> dp->E >> dp->W >> dp->N >> dp->bottom;
string str;
cin >> str;
for (int i = 0; i < str.size(); i++) {
roll(dp, str[i]);
}
cout << dp->top << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
long long n, ans=0, i;
map<long long, long long> mp;
cin >> n;
for(i=0;i<n;i++){
long long a;
cin >> a;
mp[a]++;
}
for(auto x : mp){
if(x.second%2!=0) ans++;
}
cout << ans <<endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,x,y;
scanf("%d%d%d",&n,&x,&y);
printf("%d",(n+x-1)/x*y);
} | #include <iostream>
using namespace std;
int main(){
int n,x,t;
cin>>n>>x>>t;
int ans = n/x * t;
ans += (n%x != 0)? t:0;
cout<<ans<<endl;
return 0;
} | 1 |
#include<bits/stdc++.h>
#define lowbit(i) ((i)&(-(i)))
#define lson(i) ((i)<<1)
#define rson(i) ((i)<<1|1)
#define sqr(x) ((x)*(x))
#define fi first
#define se second
#define mp(x,y) make_pair((x),(y))
#define pb push_back
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef pair<int,int> pii;
typedef vector<int> vii;
typedef vector<pii> vpi;
typedef queue<int> qii;
const int inf=0x3f3f3f3f;
const int maxn=100007;
ll n,s;
struct node{
ll x,p;void init(){scanf("%lld%lld",&x,&p);}
}a[maxn];
pair<ll,ll> solve(ll l,ll r){
if(a[r].x<s) {
return mp(-1,s-a[l].x);
}else if(a[l].x>s) {
return mp(1,a[r].x-s);
}
if(l==r){
if(a[l].x<s) return mp(-1,s-a[l].x);
else return mp(1,a[l].x-s);
}
if(a[l].p<a[r].p){
a[r].p+=a[l].p;
pair<ll,ll> t=solve(l+1,r);
// cout<<l<<' '<<r<<' '<<a[l].p<<' '<<a[r].p-a[l].p<<' ';
// cout<<t.fi<<' '<<t.se<<'\n';
if(t.fi==-1) return mp(-1,t.se+a[l+1].x-a[l].x);
else return mp(-1,t.se+a[r].x-a[l].x);
}else{
a[l].p+=a[r].p;
pair<ll,ll> t=solve(l,r-1);
// cout<<l<<' '<<r<<' '<<a[l].p-a[r].p<<' '<<a[r].p<<' ';
// cout<<t.fi<<' '<<t.se<<'\n';
if(t.fi==1) return mp(1,t.se+a[r].x-a[r-1].x);
else return mp(1,t.se+a[r].x-a[l].x);
}
}
int main(){
// freopen("","r",stdin);5
// freopen("","w",stdout);
scanf("%lld%lld",&n,&s);
for(int i=1;i<=n;i++) a[i].init();
// for(int i=1;i<=n;i++) cout<<a[i].p<<' ';cout<<'\n';
printf("%lld\n",solve(1,n).se);
return 0;
}
/*
3 2
1 3
3 4
4 2
*/ | #include <iostream>
using namespace std;
long long p[100001],x[100001],ans=0;
int n,s,l,r;
int main(){
cin>>n>>s;
for (int i=1;i<=n;i++)
cin>>x[i]>>p[i];
l=1;r=n;
while (l<=r){
if (s<=x[l]){
cout<<x[r]-s+ans;
return 0;
}
else if (s>=x[r]){
cout<<ans+s-x[l];
return 0;
} //所有住处都在s的一侧，可以直接开过去
if (p[l]>=p[r]){
ans+=x[r]-x[l];
while (l<r&&p[l]>=p[r]) p[l]+=p[r--];
}
else{
ans+=x[r]-x[l];
while (l<r&&p[l]<p[r]) p[r]+=p[l++];
}
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef vector<int> Vi;
typedef tuple<int, int, int> T;
#define FOR(i,s,x) for(int i=s;i<(int)(x);i++)
#define REP(i,x) FOR(i,0,x)
#define ALL(c) c.begin(), c.end()
#define DUMP( x ) cerr << #x << " = " << ( x ) << endl
const int dr[4] = {-1, 0, 1, 0};
const int dc[4] = {0, 1, 0, -1};
int mat[110][2], dp[110][110];
const int INF = 1<<29;
int main() {
// use scanf in CodeForces!
cin.tie(0);
ios_base::sync_with_stdio(false);
int N;
cin >> N;
REP(i, N) REP(j, 2) cin >> mat[i][j];
REP(i, N) REP(j, N) dp[i][j] = INF;
REP(i, N) dp[i][i] = 0;
for (int w = 1; w < N; w++) {
for (int L = 0; L + w < N; L++) {
int R = L + w;
for (int i = L; i < R; i++)
dp[L][R] = min(dp[L][R], dp[L][i] + dp[i+1][R] + mat[L][0] * mat[i][1] * mat[R][1]);
}
}
cout << dp[0][N-1] << endl;
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <string>
#include <iostream>
#include <climits>
using namespace std;
int main() {
int i, j, k, to, min, temp_result;
int n;
int r[100], c[100];
int result[100][100];
cin >> n;
for (i = 0; i < n; i++) {
cin >> r[i] >> c[i];
result[i][i] = 0;
}
i = 0;
j = 1;
to = n - 2;
while (j <= n - 1) {
while (i <= to) {
//computation of result[i][i+j]
min = INT_MAX;
k = i;
while (k <= i + j - 1) {
temp_result = c[k] * r[i] * c[i + j] + result[i][k] + result[k + 1][i + j];
if (temp_result < min) {
min = temp_result;
}
k++;
}
result[i][i + j] = min;
i++;
}
i = 0;
j++;
to--;
}
printf("%d\n", result[0][n - 1]);
} | 1 |
#include<bits/stdc++.h>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define rep(i,n) for(int i = 0; i < n ; ++i)
#define REP(i,a,b) for(int i = a ; i <= b ; ++i)
#define filei freopen("input.txt", "r", stdin);
#define fileo freopen("output.txt", "w", stdout);
#define gooi cout<<"Case #"<<i+1<<" :";
#define s(n) scanf("%d",&n)
#define rev(i,n) for(int i = n ; i >= 0 ; --i)
#define REV(i,a,b) for(int i = a ; i >= b ; --i)
#define miN(a,b) (((a)<(b))?(a):(b))
#define sc(n) scanf("%c",&n)
#define tr(c,i) for(typeof((c).begin()) i=(c).begin();i!=(c).end();i++)
#define INF 1000000000
#define pii pair<long long int,long long int>
#define pb(a) push_back(a)
#define F first
#define S second
typedef long long ll;
using namespace std;
void pre(){}
void solve(){
ll n;cin>>n;
ll arr[n];
for(int i=0;i<n;i++){
cin>>arr[n-i-1];
}
string s;cin>>s;
set<ll,greater<ll>>basis;
reverse(s.begin(),s.end());
for(int i=0;i<n;i++){
for(auto j:basis){
arr[i]=min(arr[i],arr[i]^j);
}
if(arr[i]==0){
continue;
}
if( s[i]=='0' )
basis.insert(arr[i]);
if( s[i]=='1' ){
cout<<1<<"\n";
return;
}
}
cout<<0<<"\n";
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
pre();
long long int num = 1;
cin>>num;
for(long long int i=0;i<num;i++){
solve();
}
}
| /*=============================================================================================================================/*
Bismillahir Rahmanir Rahim
_ ____ ___ ____ _ _ _ ___ ____ _ _ __ __
/ \ / ___||_ _|| __ ) | | | || | |_ _|/ ___| | | / \ | \/ |
/ _ \ \___ \ | | | _ \ | | | || | | | \___ \ | | / _ \ | |\/| |
/ ___ \ ___) || | | |_) || |_| || |___ | | ___) || |___ / ___ \ | | | |
/_/ \_\|____/|___||____/ \___/ |_____| |___||____/ |_____|/_/ \_\|_| |_|
_ __ __ __ __
|_) (_ _ o__ / (_ |_
|_)o__)(_ || | \__ __) |__
___ _ _ _ _ _ __ ___ _ _ _
/ __|_ _ ___ ___ _ _ | | | |_ _ (_)_ _____ _ _ __(_) |_ _ _ ___ / _| | _ ) __ _ _ _ __ _| |__ _ __| |___ __| |_
| (_ | '_/ -_) -_) ' \ | |_| | ' \| \ V / -_) '_(_-< | _| || | / _ \ _| | _ \/ _` | ' \/ _` | / _` / _` / -_|_-< ' \
\___|_| \___\___|_||_| \___/|_||_|_|\_/\___|_| /__/_|\__|\_, | \___/_| |___/\__,_|_||_\__, |_\__,_\__,_\___/__/_||_|
|__/ |___/
FB: https://facebook.com/SIAsibul
Gmail: [email protected]
/*=============================================================================================================================*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
typedef vector<pii> vii;
typedef vector<pil> vil;
typedef vector<pli> vli;
typedef vector<pll> vll;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define sz size()
#define all(a) a.begin(), a.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define f0(i,n) for(int i=0;i<(n);i++)
#define f1(i,n) for(int i=1;i<=(n);i++)
#define f2(i,a,n) for(int i=(a);i<=(n);i++)
#define fr(i,n,a) for(int i=(n);i>=(a);i--)
#define rep(i,a,b,c) for(int i=(a);i!=(b);i+=(c))
#define nl "\n"
const int INF = 1e9 + 5;
const int MXN = 2e5 + 5;
ll a[201];
char s[202];
int main(){
ll t; cin >> t;
while(t--){
int n;
cin >> n;
f1(i, n)
cin >> a[i];
scanf("%s",s+1);
for(int i=n;i;i--){
if(a[i]==0)continue;
int u=60;
while(!(a[i]>>u&1))u--;
for(int j=i-1;j;j--)
if(a[j]>>u&1)a[j]^=a[i];
}
int ans=0;
for(int i=1;i<=n;i++)
if(s[i]=='1'&&a[i])
ans=1;
cout << ans << nl;
}
}
| 1 |
#include <iostream>
#include <iomanip>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <numeric>
#include <iterator>
using namespace std;
typedef unsigned int UI;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int,int> PII;
typedef istringstream ISS;
typedef ostringstream OSS;
#define REP( i, m, n ) for ( int i = (int)( m ); i < (int)( n ); ++i )
#define FOR( v, c ) for ( auto &v : c )
#define EACH( it, c ) for ( auto it = c.begin(); it != c.end(); ++it )
#define ALL( c ) (c).begin(), (c).end()
#define PB( n ) push_back( n )
#define MP( a, b ) make_pair( ( a ), ( b ) )
#define EXIST( c, e ) ( (c).find( e ) != (c).end() )
#define fst first
#define snd second
#define DUMP( x ) cerr << #x << " = " << ( x ) << endl
#define DEBUG( x ) cerr << __FILE__ << ":" << __LINE__ << ": " << #x << " = " << ( x ) << endl
VI solve( int a, int b, int c )
{
const int N = a + b + c;
VI parts( N, 2 );
int m;
cin >> m;
VVI nums( m, VI( 3 ) );
VI rs( m );
REP( i, 0, m )
{
REP( j, 0, 3 )
{
cin >> nums[i][j];
nums[i][j]--;
}
cin >> rs[i];
if ( !rs[i] )
{
continue;
}
REP( j, 0, 3 )
{
parts[ nums[i][j] ] = 1;
}
}
REP( i, 0, m )
{
if ( rs[i] )
{
continue;
}
int count = 0;
REP( j, 0, 3 )
{
count += parts[ nums[i][j] ] == 1;
}
if ( count != 2 )
{
continue;
}
REP( j, 0, 3 )
{
if ( parts[ nums[i][j] ] == 1 )
{
continue;
}
parts[ nums[i][j] ] = 0;
}
}
return parts;
}
int main()
{
cin.tie( 0 );
ios::sync_with_stdio( false );
while ( true )
{
int a, b, c;
cin >> a >> b >> c;
if ( !( a | b | c ) )
{
break;
}
VI res( solve( a, b, c ) );
FOR( r, res )
{
cout << r << endl;
}
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
struct parts{int power; int motor; int cable; int pass;};
int main(){
int a, b, c;
int N;
int is_disorder[300];
parts result[1000];
for(;;){
cin >> a >> b >> c;
if(a == 0 && b == 0 && c == 0) break;
for(int i = 0; i < a + b + c; i++) is_disorder[i] = 2;
cin >> N;
for(int i = 0; i < N; i++){
cin >> result[i].power >> result[i].motor >> result[i].cable >> result[i].pass;
result[i].power--; result[i].motor--; result[i].cable--;
if(result[i].pass == 1){
is_disorder[result[i].power] = 1;
is_disorder[result[i].motor] = 1;
is_disorder[result[i].cable] = 1;
}
}
for(int i = 0; i < N; i++){
if(result[i].pass == 0){
if(is_disorder[result[i].power] == 1 && is_disorder[result[i].motor] == 1) is_disorder[result[i].cable] = 0;
if(is_disorder[result[i].power] == 1 && is_disorder[result[i].cable] == 1) is_disorder[result[i].motor] = 0;
if(is_disorder[result[i].motor] == 1 && is_disorder[result[i].cable] == 1) is_disorder[result[i].power] = 0;
}
}
for(int i = 0; i < a + b + c; i++){
cout << is_disorder[i] << endl;
}
}
return 0;
} | 1 |
#include<set>
#include<queue>
#include<vector>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define inf 0x7fffffff
#define lli long long int
int n,len;
char c[50];
vector<set<pair<int,int> > > trie;
vector<lli> s;
inline int fd(int now,int k){
if(trie[now].empty()) return 0;
set<pair<int,int> >::iterator it=trie[now].lower_bound(make_pair(k,0));
if(it==trie[now].end()) return 0;
if(it->first!=k) return 0;
return it->second;
}
inline int upd(){
set<pair<int,int> > sss;
sss.clear();
trie.push_back(sss);
s.push_back(0);
return trie.size()-1;
}
int t[50],cnt;
inline void add(){
int now=0,temp=0;
for(int i=1;i<=n;i++){
int pos=t[i],nxt=fd(now,pos);
if(!nxt) nxt=upd(),trie[now].insert(make_pair(pos,nxt));
now=nxt;
}
s[now]++;
return;
}
inline unsigned lli query(){
int now=0;
for(int i=1;i<=n;i++){
int pos=t[i],nxt=fd(now,pos);
if(!nxt) return 0;
now=nxt;
}
return s[now];
}
unsigned lli ans=0;
const lli vl[20]={0,1,2,4,8,16,32,64,128,256,512,1024,2048,4096,8192,16384,32768,65536,131072,262144};
int main(){
scanf("%d",&n);
len=n<<1;
cin>>c+1;
upd();
for(int i=0;i<=vl[n+1]-1;i++){
cnt=0;
for(int j=1;j<=n;j++) if((i&vl[j])==vl[j]) t[++cnt]=c[j]-'a';
for(int j=1;j<=n;j++) if((i&vl[j])==0) t[++cnt]=c[j]-'a'+26;
add();
}
for(int i=0;i<=vl[n+1]-1;i++){
cnt=0;
for(int j=1;j<=n;j++) if((i&vl[j])==0) t[++cnt]=c[len-j+1]-'a';
for(int j=1;j<=n;j++) if((i&vl[j])==vl[j]) t[++cnt]=c[len-j+1]-'a'+26;
ans+=query();
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
//#include <algorithm>
// #include <iomanip>
#define ll long long
#define map unordered_map
#define set unordered_set
#define l_l pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
int main() {
// std::cout << std::fixed << std::setprecision(10);
ll N;
scanf("%lld", &N);
ll ans = -INF;
for (ll i = N; i <= 999; i++) {
string s = to_string(i);
if (s[0] == s[1] && s[1] == s[2]) {
ans = i;
break;
}
}
cout << ans << endl;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,X,T;
cin>>N>>X>>T;
if(N%X==0) cout<<N/X*T;
else cout<<(int(N/X)+1)*T<<endl;
}
| #include <iostream>
#include <vector>
using namespace std;
const int MOD = 1000000007;
int main(){
int H, W, K;
cin >> H >> W >> K;
vector<vector<int>> dp(H + 1, vector<int>(W, 0));
dp[0][0] = 1;
for (int i = 0; i < H; i++){
for (int j = 0; j < (1 << (W - 1)); j++){
bool ok = true;
for (int k = 0; k < W - 2; k++){
if ((j >> k & 1) && (j >> (k + 1) & 1)){
ok = false;
}
}
if (ok){
vector<int> p(W);
for (int k = 0; k < W; k++){
p[k] = k;
}
for (int k = 0; k < W - 1; k++){
if (j >> k & 1){
swap(p[k], p[k + 1]);
}
}
for (int k = 0; k < W; k++){
dp[i + 1][p[k]] += dp[i][k];
dp[i + 1][p[k]] %= MOD;
}
}
}
}
cout << dp[H][K - 1] << endl;
} | 0 |
#include <iostream>
#include<cmath>
#include<vector>
using namespace std;
#define ll long long
#define ld long double
int main(void){
string s;
cin>>s;
string ans="2018";
ans+=s.substr(4);
cout<<ans;
} | // B - Around Square
#include <bits/stdc++.h>
using namespace std;
int main(){
int N; cin>>N;
int64_t ans = 0;
for(int i=1; i*i<=N; ++i) ans = i*i;
cout<<ans<<endl;
}
| 0 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
vector<vector<int>> vec(100010);
int co[100010] = { 0 };
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n - 1 + m; i++) {
int a, b;
cin >> a >> b;
co[b]++;
vec[a].emplace_back(b);
}
queue<int>que;
for (int i = 1; i <= n; i++) {
if (co[i]==0) {
que.push(i);
break;
}
}
int ans[100010] = { 0 };
while (!que.empty()) {
int k = que.front();
for (int l = 0; l < vec[k].size(); l++) {
co[vec[k][l]]--;
if (co[vec[k][l]] == 0) {
que.push(vec[k][l]);
}
ans[vec[k][l]] = k;
}
que.pop();
}
for (int i = 1; i <= n; i++) {
cout << ans[i] << endl;
}
return 0;
}
| #include <iostream>
#include <algorithm>
using namespace std;
int straight(int card[])
{
for(int i=1; i<9; i++){
if(((card[0]==i)&&(card[1]==i+1)&&(card[2]==i+2)&&(card[3]==i+3)&&(card[4]==i+4)) ||
(card[0]==1&&card[1]==10&&card[2]==11&&card[3]==12&&card[4]==13))
return 1;
}
return 0;
}
int main(){
int c[5], n;
char k;
while(1){
cin>>c[0]>>k>>c[1]>>k>>c[2]>>k>>c[3]>>k>>c[4];
if(cin.eof())break;
n=0;
sort(c, c+5);
for(int i=0; i<4; i++){
for(int j=i+1; j<5; j++){
if(c[i]==c[j])
n++;
}
}
switch(n){
case 1:
cout<<"one pair\n";
break;
case 2:
cout<<"two pair\n";
break;
case 3:
cout<<"three card\n";
break;
case 4:
cout<<"full house\n";
break;
case 6:
cout<<"four card\n";
break;
case 10:
cout<<"four card\n";
break;
default:
if(straight(c))
cout<<"straight\n";
else
cout<<"null\n";
break;
}
}
return 0;
} | 0 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n, q;
while(true){
cin >> n >> q;
if(n == 0)
break;
int m;
vector< vector<int> > sch(n, vector<int>(101, 0));
for(int i=0; i<n; i++){
cin >> m;
for(int j=0; j<m; j++){
int temp;
cin >> temp;
sch[i][temp] = 1;
}
}
int ans, nmax = 0;
for(int i=0; i<101; i++){
int sum = 0;
for(int j=0; j<n; j++){
sum += sch[j][i];
}
if(sum > nmax){
ans = i;
nmax = sum;
}
}
if(nmax < q)
ans = 0;
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
while(cin >> n >> q && (n || q)){
int cnt[1000] = {0}, m, d;
for(int i = 0; i < n; ++i){
cin >> m;
for(int j = 0; j < m; ++j){
cin >> d;
cnt[d]++;
}
}
int maxium = 0, day = 0;
for(int i = 1; i <= 100; ++i){
if(maxium < cnt[i]){
day = i;
maxium = cnt[i];
}
}
if(maxium >= q)
cout << day << endl;
else
cout << "0" << endl;
}
return 0;
} | 1 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define BIL ((ll)1e9)
#define MOD ((ll)1e9+7)
#define INF (1LL<<60) //1LL<<63でオーバーフロー
#define inf (1<<29) //1<<29でオーバーフロー
int main(int argc,char* argv[]){
int n;
ll x;
cin >> n >> x;
vector<ll> a(n);
for(auto &x:a)cin >> x;
sort(a.begin(),a.end());
if(a[0]>x){
cout << 0 << endl;
return 0;
}
vector<ll> asum(n);
asum[0]=a[0];
int ans=-1;
for(int i=1;i<a.size();i++){
asum[i]=asum[i-1]+a[i];
if(asum[i]==x){
ans=i+1;
break;
}else if(asum[i]>x){
ans=i;
break;
}
}
if(ans==-1){
ans=n-1;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a,b); }
using P = pair <int, int>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll MOD = 1000000007;
ll INF =1<<30;
int main(){
int n,x;
cin >> n >>x;
vector<int>a(n);
rep(i,n)cin >> a[i];
sort(a.begin(),a.end());
int cnt=0;
rep(i,n-1){
if(x<a[i]) break;
x-=a[i];
cnt++;
}
if(a[n-1]==x) cnt++;
cout << cnt <<endl;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=3e5+5;
const ll mod=1e9+7;
ll power(ll a,ll b){return b?power(a*a%mod,b/2)*(b%2?a:1)%mod:1;}
ll n,ans=0,mx=0,a[N],num[100]={0},cnt[100]={0};
void split(ll x){
ll p=0;
while(x){
if(x%2) cnt[p]++;
p++;
x/=2;
}
mx=max(mx,p);
}
int main(){
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i],split(a[i]);
for(int i=1;i<=n;i++){
for(ll j=0;j<mx;j++){
if(a[i]&(1LL<<j)) num[j]+=n-cnt[j];
else num[j]+=cnt[j];
}
}
for(ll i=0;i<100;i++){
num[i+1]+=num[i]/2;
if(num[i]%2) ans=(ans+power(2,i))%mod;
}
cout<<ans*power(2,mod-2)%mod;
return 0;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree <int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> Set;
const int RLEN=1<<18|1;
inline char nc() {
static char ibuf[RLEN],*ib,*ob;
(ib==ob) && (ob=(ib=ibuf)+fread(ibuf,1,RLEN,stdin));
return (ib==ob) ? -1 : *ib++;
}
inline int rd() {
char ch=nc(); int i=0,f=1;
while(!isdigit(ch)) {if(ch=='-')f=-1; ch=nc();}
while(isdigit(ch)) {i=(i<<1)+(i<<3)+ch-'0'; ch=nc();}
return i*f;
}
const int N=3e5+50;
int n,a[N][3],inv0,inv1,flip0,flip1;
int p0[N],p1[N];
inline void calc(int &inv,int *p,int nn) {
Set S;
static int pos[N];
for(int i=1;i<=nn;i++) pos[p[i]]=i;
for(int i=1;i<=nn;i++) S.insert(i);
for(int i=1;i<=nn;i++) {
inv+=S.order_of_key(pos[i]+1)-1;
inv%=2; S.erase(pos[i]);
} return;
}
int main() {
n=rd();
for(int j=0;j<3;j++) for(int i=1;i<=n;i++) a[i][j]=rd()-1;
for(int i=1;i<=n;i+=2) {
// cerr<<i<<'\n';
if(a[i][0]/6!=a[i][1]/6 || a[i][0]/6!=a[i][2]/6) {puts("No"); return 0;}
else if(a[i][1]%6!=1) {puts("No"); return 0;}
else if(a[i][0]%6+a[i][2]%6!=2) {puts("No"); return 0;}
if(a[i][0]%6) ++flip1;
p1[(i+1)/2]=a[i][0]/6+1;
}
for(int i=2;i<=n;i+=2) {
if(a[i][0]/6!=a[i][1]/6 || a[i][0]/6!=a[i][2]/6) {puts("No"); return 0;}
else if(a[i][1]%6!=4) {puts("No"); return 0;}
if(a[i][0]%6==5) ++flip0;
p0[i/2]=a[i][0]/6+1;
}
calc(inv0,p0,n/2); calc(inv1,p1,(n+1)/2);
if((inv0^flip1)&1) {puts("No"); return 0;}
if((inv1^flip0)&1) {puts("No"); return 0;}
puts("Yes"); return 0;
} | 0 |
#include <iostream>
using namespace std;
int main(){
int a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
if(e - a > f){
cout << ":(" << endl;
return 0;
}
cout << "Yay!" << endl;
} | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vii = vector<vi>;
using vs = vector<string>;
using in6 = int64_t;
using ind = double;
using pii = pair<int,int>;
using psi = pair<string,int>;
using vpi = vector<pii>;
using vps = vector<psi>;
#define rep(i, n) for (in6 i = 0; i < (in6)(n); i++)
#define repa(i,a,n) for(in6 i = a; i < (in6)(n); i++)
#define repdown(i,n) for(in6 i = n; i > 0; i--)
#define kyun ios::sync_with_stdio(false)
#define hinata cout << "\n"
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define inf 2147483647
int main() {
kyun;
int a,b,c;
cin >> a >> b >> c;
if(a < c && c < b) cout << "Yes";
else if(b < c && c < a) cout << "Yes";
else cout << "No";
hinata;
} | 0 |
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
const int COUNT = 6;
#define size_array(x) ((sizeof(x)) / (sizeof(x[0])
class Dice
{
private:
int num[6];
public:
Dice();
void play_dice(string);
void play(int, int, int, int);
void print_() {printf("%d\n", num[0]);}
};
Dice::Dice()
{
for (int i = 0; i < COUNT; ++i)
{
cin >> num[i];
}
}
void Dice::play_dice(string s)
{
if(s == "E") {play(0, 2, 5, 3); }
if(s == "N") {play(0, 4, 5, 1); }
if(s == "S") {play(0, 1, 5, 4); }
if(s == "W") {play(0, 3, 5, 2); }
}
void Dice::play(int a, int b, int c, int d)
{
int temp;
temp = num[d]; num[d] = num[c]; num[c] = num[b]; num[b] = num[a]; num[a] = temp;
}
int main(int argc, char const *argv[])
{
Dice c;
string cmd;
cin >> cmd;
for (int i = 0; i < (int)cmd.size(); ++i)
{
c.play_dice(cmd.substr(i, 1));
}
c.print_();
return 0;
} | #include <iostream>
#include <bits/stdc++.h>
#include <string>
#include <ctype.h>
#include <algorithm>
#include <cmath>
#define REP(i, n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
#define square(x) (x) * (x)
#define cube(x) (x) * (x) * (x)
const int INF = 1e9;
using namespace std;
class dice{
private:
int s[6];
int top;
int bottom;
int r_side;
int l_side;
int face;
int rev;
public:
dice(){
top = 0;
bottom = 5;
r_side = 2;
l_side = 3;
face = 1;
rev = 4;
s[0] = 1;
s[1] = 2;
s[2] = 3;
s[3] = 4;
s[4] = 5;
s[5] = 6;
}
dice(int a[5]){
top = 0;
bottom = 5;
r_side = 2;
l_side = 3;
face = 1;
rev = 4;
REP(i, 6) s[i] = a[i];
}
dice(int x, int y, int z, int u, int v, int w){
top = 0;
bottom = 5;
r_side = 2;
l_side = 3;
face = 1;
rev = 4;
s[0] = x;
s[1] = y;
s[2] = z;
s[3] = u;
s[4] = v;
s[5] = w;
}
int get_top() {
return s[top];
}
int get_bottom(){
return s[bottom];
}
int get_r_side(){
return s[r_side];
}
int get_l_side(){
return s[l_side];
}
int get_face(){
return s[face];
}
int get_rev(){
return s[rev];
}
int set_top(int i) {
top = i;
bottom = 5 - top;
r_side = (i+1)%5;
l_side = 5 - r_side;
face = (i+2)%5;
rev = 5 - face;
return s[top];
}
int rotate_r(int i) {
while(i<0)
i+=4;
i %= 4;
REP(j, i){
int temp = face;
face = r_side;
r_side = rev;
rev = l_side;
l_side = temp;
}
return s[top];
}
int roll_r(int i) {
while(i<0)
i+=4;
i %= 4;
REP(j, i){
int temp = top;
top = l_side;
l_side = bottom;
bottom = r_side;
r_side = temp;
}
return s[top];
}
int roll_f(int i){
while(i<0)
i+=4;
i %= 4;
REP(j, i){
int temp = top;
top = face;
face = bottom;
bottom = rev;
rev = temp;
}
return s[top];
}
};
int main() {
int in[6];
REP(i, 6) cin >> in[i];
dice d = dice(in);
string roll;
cin >> roll;
while(roll.size() != 0){
string order = roll.substr(0, 1);
if(order == "E")
d.roll_r(1);
else if(order == "S")
d.roll_f(-1);
else if(order == "N")
d.roll_f(1);
else if(order == "W")
d.roll_r(-1);
roll = roll.substr(1);
}
cout << d.get_top() << endl;
return 0;
} | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cmath>
#include <unordered_map>
typedef long long ll;
using namespace std;
const int mod=1e9+7;
const ll inf=(1e14);
ll solve(){
ll n,ans=0;
string s;
cin>>n>>s;
int r[n],g[n],b[n];
g[n-1]=r[n-1]=b[n-1]=r[0]=g[0]=b[0]=0;
unordered_map<char,int*> m;
m['R']=r,m['G']=g,m['B']=b;
for(const char c:{'R','G','B'}){
for(int i=n-2;i>=0;i--) m[c][i]=m[c][i+1]+(s[i+1]==c);
}
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
for(const char c:{'R','G','B'}){
if(s[i]!=c && s[j]!=c && s[i]!=s[j]){
ans+=(m[c][j]);
if(j+(j-i) < n && s[j+(j-i)] == c) ans--;
}
}
}
}
return ans;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int t=1;
//cin>>t;
while(t--) cout<<solve()<<'\n';
//while(t--) solve(),cout<<'\n';
return 0;
}
| #include <iostream>
#include <cstring>
using namespace std;
char a[4005];
int main() {
int N, cnt = 0;
long long sum = 0;
cin >> N >> a;
for(int i = 0; i < N; i++)
if(a[i] == 'B')
cnt ++;
for(int i = 0; i < N; i++)
if(a[i] != 'R')
continue;
else for(int j = 0; j < N; j++) {
if(j == i || a[j] != 'G')
continue;
else if(i < j) {
sum += cnt - (2 * i - j > 0 && a[2 * i - j] == 'B') - (2 * j - i < N && a[2 * j - i] == 'B');
if(i != j - 1)
sum -= ((i + j) % 2 == 0 && a[(i + j) / 2] == 'B');
} else if(i > j) {
sum += cnt - (2 * j - i > 0 && a[2 * j - i] == 'B') - (2 * i - j < N && a[2 * i - j] == 'B');
if(i != j + 1)
sum -= ((i + j) % 2 == 0 && a[(i + j) / 2] == 'B');
}
// cout << i << " " << j << " " << sum << endl;
}
cout << sum << endl;
} | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(obj) (obj).begin(), (obj).end()
#define bit(n) (1LL << (n))
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string A;
string B;
string C;
rep(i,3) {
string s; cin>>s;
if (i==0) A=s;
if (i==1) B=s;
if (i==2) C=s;
}
char next = 'a';
while(true) {
if(next == 'a') {
if (A.length() == 0) {
cout<<"A";
return 0;
}
next = A[0];
A.erase(0,1);
} else if(next == 'b') {
if (B.length() == 0) {
cout<<"B";
return 0;
}
next = B[0];
B.erase(0,1);
} else if(next == 'c') {
if (C.length() == 0) {
cout<<"C";
return 0;
}
next = C[0];
C.erase(0,1);
}
}
return 0;
} | #include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int main() {
double a, b, c, d, x, y, ans;
cin >> a >> b >> c >> d;
x = a - c;
y = b - d;
ans = sqrt(x*x + y*y);
printf("%f", ans);
return 0;
} | 0 |
/*
Code for problem D by cookiedoth
Generated 22 Mar 2020 at 06.57 PM
,##. ,==.
,# #. \ o ',
# # _ _ \ \
# # (_) (_) / ;
`# #' / .'
`##' "=="
=_=
>_<
o_O
*/
#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <map>
#include <bitset>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <string>
#include <queue>
#include <deque>
#include <stack>
#include <complex>
#include <cassert>
#include <random>
#include <cstring>
#include <numeric>
#define ll long long
#define ld long double
#define null NULL
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define debug(a) cerr << #a << " = " << a << endl
#define forn(i, n) for (int i = 0; i < n; ++i)
#define sz(a) (int)a.size()
using namespace std;
template<class T> int chkmax(T &a, T b) {
if (b > a) {
a = b;
return 1;
}
return 0;
}
template<class T> int chkmin(T &a, T b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template<class iterator> void output(iterator begin, iterator end, ostream& out = cerr) {
while (begin != end) {
out << (*begin) << " ";
begin++;
}
out << endl;
}
template<class T> void output(T x, ostream& out = cerr) {
output(x.begin(), x.end(), out);
}
void fast_io() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int MOD;
int mul(int a, int b) {
return (1LL * a * b) % MOD;
}
void add(int &a, int b) {
a = (a + b) % MOD;
}
int power(int a, int deg) {
int res = 1;
while (deg) {
if (deg & 1) {
res = mul(res, a);
}
a = mul(a, a);
deg >>= 1;
}
return res;
}
int inverse(int a) {
return power(a, MOD - 2);
}
const int mx = 6010;
int n, dp[mx][2 * mx], inv[2 * mx], dim2_zero;
signed main() {
fast_io();
vector<int> delta = {0, 1, -1, 0};
cin >> n >> MOD;
dim2_zero = 3 * n;
inv[1] = 1;
for (int i = 2; i <= 3 * n; ++i) {
inv[i] = mul(MOD - MOD / i, inv[MOD % i]);
}
dp[0][dim2_zero] = 1;
for (int s = 0; s < 3 * n; ++s) {
for (int d = 0; d <= 2 * dim2_zero; ++d) {
for (int bl = 1; bl <= 3; ++bl) {
int s1 = s + bl;
int d1 = d + delta[bl];
if (s1 <= 3 * n && d1 >= 0 && d1 <= 2 * dim2_zero) {
add(dp[s1][d1], mul(dp[s][d], inv[s1]));
}
}
}
}
int ans = 0;
for (int bal = dim2_zero; bal <= 2 * dim2_zero; ++bal) {
add(ans, dp[3 * n][bal]);
}
for (int i = 1; i <= 3 * n; ++i) {
ans = mul(ans, i);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define fi first
#define se second
long long mo = 1000000007;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
typedef pair<ll,Pll> PlP;
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
template<class A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}cout << "\n";}
ld PI=3.14159265358979323846;
int main(){
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll N,T;
cin >> N >> T;
vector<ll> A(N), B(N), C(N+1);
rep(i,N){
cin >> A[i] >> B[i];
}
vector<vector<ll>> dp(N+1, vector<ll>(T+1)), dp2(N+1, vector<ll>(T+1));
rep(i,N){
rep(j,T){
if(j+A[i] <= T){
dp[i+1][j+A[i]]=max(dp[i+1][j+A[i]], dp[i][j]+B[i]);
}
dp[i+1][j+1]=max(dp[i+1][j+1], dp[i+1][j]);
dp[i+1][j+1]=max(dp[i+1][j+1], dp[i][j+1]);
}
}
for(ll i=N;i>0;i--){
rep(j,T){
if(j+A[i-1] <= T){
dp2[i-1][j+A[i-1]]=max(dp2[i-1][j+A[i-1]], dp2[i][j]+B[i-1]);
}
dp2[i-1][j+1]=max({dp2[i-1][j+1], dp2[i][j+1], dp2[i-1][j]});
}
}
ll ans = 0;
REP(i,0,N){
rep(j,T){
cmax(ans, dp[i][j] + B[i] + dp2[i+1][T-1-j]);
}
}
cout << ans << endl;
} | 0 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
using namespace std;
typedef pair <int, int> pii;
char buf[1000010];
bool cmp(pii a, pii b) {
return max(-a.se, -a.fi - b.se) < max(-b.se, -b.fi - a.se);
}
int main () {
int n; scanf("%d", &n);
int tot = 0;
vector <pii> p, q;
for (int i = 0; i < n; i++) {
scanf("%s", buf);
int len = strlen(buf);
int sum = 0, minj = 0;
for (int i = 0; i < len; i++) {
sum += buf[i] == '(' ? 1 : -1;
minj = min(minj, sum);
}
tot += sum;
if (sum >= 0) p.push_back(mp(minj, sum));
else q.push_back(mp(sum, minj));
}
if (tot != 0) {
printf("No\n");
return 0;
}
sort(p.begin(), p.end());
int sum = 0;
while (p.size() && p.back().fi + sum >= 0) {
sum += p.back().se;
p.pop_back();
}
if (p.size()) {
printf("No\n");
return 0;
}
sort(q.begin(), q.end(), cmp);
for (int i = 0; i < q.size(); i++) {
if (sum + q[i].se < 0) {
printf("No\n");
return 0;
}
sum += q[i].fi;
}
printf("Yes\n");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
constexpr long long mod = 1000000007;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
string s;
while (n!=0) {
n -= 1;
ll k = n % 26;
s += 'a' + k;
n /= 26;
}
reverse(s.begin(), s.end());
cout << s << endl;
} | 0 |
#include <iostream>
#include <string>
#include <math.h>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
int N;
cin>>N;
int A[200000],B[200000];
for(int i=0;i<N;i++) cin>>A[i];
for(int i=0;i<N;i++) cin>>B[i];
sort(B,B+N,greater<int>());
vector<int> same;
for(int i=0;i<N;i++){
if(A[i]==B[i]) same.push_back(i);
}
int j=0;
int judge=0;
for(int i=0;i<same.size();i++){
while(A[same[i]]==B[same[i]]){
if(j==N){
judge++; break;
}
if(A[j]!=B[same[i]]&&B[j]!=B[same[i]]) swap(B[same[i]],B[j]);
j++;
}
if(judge==1) break;
}
if(judge==0){
cout<<"Yes"<<endl;
for(int i=0;i<N-1;i++) cout<<B[i]<<' ';
cout<<B[N-1]<<endl;
}
else cout<<"No"<<endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <string>
#include <map>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n) - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a); i > (b); i--)
#define ALL(a) (a).begin(), (a).end()
int main() {
int N, A[200000], B[200000];
cin >> N;
map<int, int> mii;
REP(i, N) {
cin >> A[i];
mii[A[i]]++;
}
REP(i, N) {
cin >> B[i];
mii[B[i]]++;
}
for (auto p : mii) {
if (p.second > N) {
cout << "No" << endl;
return 0;
}
}
int C[200001] = {}, D[200001] = {};
REP(i, N) {
C[A[i]]++;
D[B[i]]++;
}
REP(i, N) {
C[i + 1] += C[i];
D[i + 1] += D[i];
}
int offset = 0;
REP(i, N) {
offset = max(D[i + 1] - C[i], offset);
}
cout << "Yes" << endl;
REP(i, N) {
cout << B[(i + offset) % N] << " ";
}
cout << endl;
} | 1 |
#include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MOD 1000000007
#define MAX 510000
#define rrep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep(i, n) for(ll i = 1; i <= (ll)(n); i++)
#define dcout cout<<fixed<<setprecision(15);
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
//lcm//
ll gcd(ll x, ll y) {
if (x == 0) return y;
return gcd(y%x, x);
}
ll lcm(ll x, ll y) { return x * y / gcd(x, y); }
//a^n mod p//
ll modpow(ll a, ll n, ll p) {
if (n == 1) return a % p;
if (n % 2 == 1) return (a * modpow(a, n - 1, p)) % p;
ll t = modpow(a, n / 2, p);
return (t * t) % p;
}
//inversemod//
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
//Cmonp//
ll fac[MAX], finv[MAX], inv[MAX];
//
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
//
ll COM(ll n, ll k) {
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
//LARGE n
ll com(ll n,ll m){
if(n<m || n<=0 ||m<0){
return 0;
}
if( m==0 || n==m){
return 1;
}
ll k=1;
for(ll i=1;i<=m;i++){
k*=(n-i+1);
k%=MOD;
k*=modinv(i,MOD);
k%=MOD;
}
return k;
}
////////////////////////////////////////////////////////////////////
ll rad(ll u, ll p){
ll cnt=0;
while(u%p==0){
u/=p;
cnt++;
}
return cnt;
}
int main() {
int n;
cin>>n;
string st;
cout<<0<<endl;
cout<<flush;
cin>>st;
if(st=="Vacant"){
return 0;
}
int pre=0;
int small=0;
int large=n;
rep(z,19){
string u;
int mid=(small+large)/2;
cout<<mid<<endl;
cout<<flush;
cin>>u;
if(u=="Vacant"){
return 0;
}
if(pre>mid){
if((pre-mid)%2==0 && u!=st){small=mid;}
if((pre-mid)%2==0 && u==st){large=mid;}
if((pre-mid)%2==1 && u!=st){large=mid;}
if((pre-mid)%2==1 && u==st){small=mid;}
}
if(pre<mid){
if((mid-pre)%2==0 && u!=st){large=mid;}
if((mid-pre)%2==0 && u==st){small=mid;}
if((mid-pre)%2==1 && u!=st){small=mid;}
if((mid-pre)%2==1 && u==st){large=mid;}
}
st=u;
pre=mid;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<pair<int, int> > vpii;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef vector<ll> vll;
#define INF 0x3f3f3f3f
#define MOD 1000000007LL
#define EPSILON 0.00001
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define FOR(i, a, b) for (ll i=(a); i<=(signed)(b); i++)
#define F0R(i, a) for (ll i=0; i<(signed)(a); i++)
#define RFOR(i, a, b) for (ll i=(a); i >= b; i--)
#define MN 200005
int n;
string s;
bool op[MN];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> s;
F0R(i, 2*n){
if(s[i] == 'B'){
op[i] = (i+1)%2;
} else{
op[i] = i%2;
}
//cout << op[i] << " ";
}
//cout << "\n";
ll amt = 1;
int cnt = 0;
F0R(i, 2*n){
if(op[i]) ++cnt;
else{
amt = (amt*cnt)%MOD;
--cnt;
}
if(cnt < 0){
cout << "0\n";
return 0;
}
}
if(cnt != 0){
cout << "0\n";
return 0;
}
FOR(i, 1, n) amt = (amt*i)%MOD;
cout << amt << "\n";
return 0;
}
| 0 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <stack>
#include <set>
#include <cmath>
#include <algorithm>
using namespace std;
int main(){
vector<int> v(5000);
int n , sum=0 , max=-2000000000;
while(cin>>n,n){
sum=0;
max=-2000000000;
for(int i=0;i<n;++i){
cin >> v[i];
}
for(int i=n;i>=0;--i){
for(int j=i;j<n;++j){
sum+=v[j];
if(sum>max) max=sum;
}
sum=0;
}
cout << max << endl;
}
return 0;
} | #include <iostream>
#include <climits>
#include <set>
#include <string>
#include <algorithm>
#include <vector>
#define MAX 1000000001
using namespace std;
#define ll long long
#define dbg if(0)
int main(){
while(true){
int n;
ll ans= LLONG_MIN;
cin>>n;
if (n==0)break;
ll rui[n+1];
rui[0]=0;
ll lowmax=LLONG_MIN;
for(int i=1;i<=n;i++){
cin >>rui[i];
if(rui[i]<=0)lowmax=max(lowmax,rui[i]);
rui[i]+=rui[i-1];
dbg cout <<rui[i]<<" ";
}
dbg cout <<endl;
//次を見る
//今までの最小値を更新したか？
//したなら暫定解を確定しansと比較。最大値=最小値=発見した最小値にする
//してなければ最大値の更新をする
//見る場所が一番後ろまで行ったら終了。
rui[0]=min(rui[0],rui[1]);
ll nmin=rui[0],nmax=rui[0];
bool nmflag=false;
/* for(int i=1;i<=n;i++){
for(int j=i;j<=n;j++){
ans=max(rui[j]-rui[i-1],ans);
}
}*/
for(int i=0;i<=n;i++){
if (rui[i]<nmin){
ans=max(nmax-nmin,ans);
nmax=rui[i];
nmin=rui[i];
}else{
if(rui[i]>nmax){
nmax=rui[i];
nmflag=true;
}
}
dbg cout <<nmax<<" "<<nmin<<" "<<endl;
}
ans=max(nmax-nmin,ans);
dbg cout << endl;
if(nmflag)cout<<ans<<endl;
else cout<<lowmax<<endl;
//cout <<ans<<endl;
}
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define fori(x,y) for(ll i=x;i<y;i++)
#define forj(x,y) for(ll j=x;j<y;j++)
#define rfori(a,b) for(int i=a;i>=b;i--)
#define for_it(a) for(auto it: a)
#define pb push_back
#define pf push_front
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define mp make_pair
#define mod 1000000007
#define mem(a,b) memset(a,b,sizeof(a))
#define ld long double
#define endl "\n"
#define ll long long
#define llu unsigned long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vl vector<ll>
#define vi vector<int>
#define vc vector<char>
#define vs vector<string>
#define si set<int>
#define spii set<pii>
#define usi unordered_set<int>
#define usl unordered_set<ll>
#define uspii unordered_set<pii>
#define mii map<int,int>
#define umii unordered_map<int,int>
#define pqmx priority_queue<int>
#define pqmn priority_queue<int,vi,greater<int>>
#define setbits(x) __builtin_popcountll(x)
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define testcase int test;cin>>test;for(ll tst=0;tst<test;tst++)
int xx[4]={0,0,1,-1};
int yy[4]={-1,1,0,0};
/*-----------------------------------------------------------------------------------------------------------------*/
int main()
{
#ifndef ONLINE_JUDGE
freopen("C_IN.txt","r",stdin);
freopen("C_Out.txt","w",stdout);
#endif
fast;
ll n,m;
cin>>n>>m;
vl v(11,0);
fori(0,m)
{
int x;
cin>>x;
v[x]++;
}
ll res=0,b=n;
while(1)
{
int temp=b;
bool flag=true;
while(temp>0)
{
int rem=temp%10;
temp=temp/10;
if(v[rem])
{
flag=false;
break;
}
}
if(flag)
{
cout<<b;
break;
}
b++;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mxn = 11;
vector<bool> val(mxn, 1);
bool valid(string s){
bool ok = 1;
int n = int(s.size());
for(int i = 0; i < n && ok; ++i){
ok &= (val[s[i] - '0']);
}
return ok;
}
int main(){
ios_base::sync_with_stdio(false); cin.tie(0);
int n, k;
cin >> n >> k;
for(int i = 0, x; i < k; ++i){
cin >> x;
val[x] = 0;
}
while(1){
string s = to_string(n);
if(valid(s)){
break;
}
++n;
}
cout << n << '\n';
return 0;
} | 1 |
#include<iostream>
using namespace std;
int main(){
int n;
cin >>n;
long long a,min=0,max=0,sum=0;
for (int i=1; i<=n; i++){
cin>> a;
if (i==1)min=a, max=a;
if (a<min)min=a;
if (a>max)max=a;
sum +=a;
}
cout<< min <<" "<< max <<" "<< sum <<"\n";
return 0;
} | #include<iostream>
#define LL long long
using namespace std;
int main() {
LL sum, min, max, n, d;
cin >> n;
cin >> d;
sum = d;
min = d;
max = d;
n--;
while (n--) {
cin >> d;
sum += d;
if (min > d)min = d;
if (max < d)max = d;
}
cout << min << ' ' << max << ' ' << sum << endl;
return 0;
} | 1 |
/*
Though leaves are many , the root is one.
Through all the lying days of my youth
I swayed my leaves and flowers in the sun.
Now I may wither into the truth.
- William Butler Yeats
*/
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
//#pragma GCC target("avx,tune=native")
#include<bits/stdc++.h>
#pragma comment("-Wl,--stack=1024000000")
//#include<ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
const int inf=0x3f3f3f3f;
const double eps=1e-6;
const int mod=1000000007;
typedef long long ll;
#ifndef LOCAL
#define cerr if(0)cout
#define eprintf(...) 0
#else
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#endif
inline string getstr(string &s,int l,int r){string ret="";for(int i=l;i<=r;i++)ret.push_back(s[i]);return ret;}
int modpow(int x,int y,int md=mod){int ret=1;do{if(y&1)ret=(ll)ret*x%md;x=(ll)x*x%md;}while(y>>=1);return ret;}
inline int Rand(){return rand()*32768+rand();}
int n,k,a[100005],ans;
vector<int>g[100005];
int dfs(int x,int par){
int mx=0;
for(auto to:g[x]){
mx=max(dfs(to,x),mx);
}
if(mx==k-1&&a[x]!=1)ans++;
return (mx+1)%k;
}
int main(){
cin>>n>>k;
for(int i=1;i<=n;i++)cin>>a[i];
for(int i=2;i<=n;i++){
g[a[i]].push_back(i);
}
if(a[1]!=1)ans++,a[1]=1;
dfs(1,-1);
cout<<ans<<endl;
return 0;
} | #include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <complex>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
#include <limits>
#include <time.h>
#include <cstdint>
using namespace std;
using pii = pair<int,int>;
using ll=long long;
using ld=long double;
#define pb push_back
#define mp make_pair
#define sc second
#define fr first
#define stpr setprecision
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define rep(i,n) for(ll i=0;i<(n);++i)
#define Rep(i,a,b) for(ll i=(a);i<(b);++i)
#define rrep(i,n) for(ll i=n-1;i>=0;i--)
#define rRep(i,a,b) for(ll i=a;i>=b;i--)
#define crep(i) for(char i='a';i<='z';++i)
#define psortsecond(A,N) sort(A,A+N,[](const pii &a, const pii &b){return a.second<b.second;});
#define ALL(x) (x).begin(),(x).end()
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define endl '\n'
int ctoi(const char c){
if('0' <= c && c <= '9') return (c-'0');
return -1;
}
ll gcd(ll a,ll b){return (b == 0 ? a : gcd(b, a%b));}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
constexpr ll MOD=1000000007;
constexpr ll INF=1000000011;
constexpr ll MOD2=998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS=10e-8;
template <class T, class U> inline bool chmax(T& lhs, const U& rhs) { if (lhs < rhs) { lhs = rhs; return 1; } return 0; }
template <class T, class U> inline bool chmin(T& lhs, const U& rhs) { if (lhs > rhs) { lhs = rhs; return 1; } return 0; }
template<typename T> istream& operator>>(istream& is,vector<T>& v){for(auto&& x:v)is >> x;return is;}
template<typename T,typename U> istream& operator>>(istream& is, pair<T,U>& p){ is >> p.first; is >> p.second; return is;}
template<typename T,typename U> ostream& operator>>(ostream& os, const pair<T,U>& p){ os << p.first << ' ' << p.second; return os;}
template<class T> ostream& operator<<(ostream& os, vector<T>& v){
for(auto i=begin(v); i != end(v); ++i){
if(i !=begin(v)) os << ' ';
os << *i;
}
return os;
}
const int MAX = 4000003;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main(){
COMinit();
ll N,M,K,ANS=0;
cin >> N >> M >> K;
ll com = COM(N*M-2,K-2);
Rep(i,1,N){
ll Z=1;
Z*=M*M*(N-i);
Z%=MOD;
Z=(Z*com)%MOD;
Z=(Z*i)%MOD;
ANS=(ANS+Z)%MOD;
}
Rep(i,1,M){
ll Z=1;
Z*=N*N*(M-i);
Z%=MOD;
Z=(Z*com)%MOD;
Z=(Z*i)%MOD;
ANS=(ANS+Z)%MOD;
}
cout << ANS << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
char a[11], b[11], c[11];
cin >> a >> b >> c;
if(a[strlen(a)-1] == b[0] && b[strlen(b)-1] == c[0]){
cout << "YES" << endl;
}
else{
cout << "NO" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#include<iostream>
#include<vector>
using namespace std;
typedef long long ll;
#define MOD (long long)(998244353)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// 最大公約数
ll gcd(ll a, ll b)
{
if(b == 0) return a;
return gcd(b, a % b);
}
// mod m におけるa の逆元
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
// 素因数分解
vector<pair<ll, ll>> prim;
void pf(ll n)
{
ll s = sqrt(n);
ll r = 0;
for(ll i = 2; i <= s; i++) {
if((n % i) == 0) {
r = 0;
do {
r++;
n = n / i;
} while((n % i) == 0);
prim.push_back({i, r});
}
}
if(n > s) {
prim.push_back({n, 1});
}
}
void solve()
{
ll N; cin >> N;
// ll x, y, z; cin >> x >> y >> z;
// ll a, b, c; cin >> a >> b >> c;
// string s; cin >> s;
vector<ll> a(N); rep(i, N) cin >> a[i];
vector<ll> c(100100, 0);
rep(i,N) {
c[a[i]]++;
}
if(a[0]!=0 || c[0]!=1) {
cout << 0 << endl;
return;
}
ll ans = 1;
rep(i,N-1) {
rep(j, c[i+1]) {
ans*= c[i];
ans%=MOD;
}
}
// bool ok = false;
cout << ans << endl;
// cout << (ok?"Yes":"No") << endl;
}
int main(void)
{
// ll t; cin >> t; rep(i, t)
solve();
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define prt(v) cout<<(v)<<"\n";
#define fi(v) get<0>(v)
#define se(v) get<1>(v)
#define th(v) get<2>(v)
#define endl "\n"
template <typename T> bool chmax(T &a, const T &b){if (a<b){a=b;return 1;}return 0;}
template <typename T> bool chmin(T &a, const T &b){if (a>b){a=b;return 1;}return 0;}
const ll INF=1LL<<60;
const ll MOD=1000000007;
//dp[i][j]はそれぞれiグラム、jグラム買うときの最小価格
vector<vector<ll>> dp(500, vector<ll>(500, INF));
signed main(void){
cin.tie(0);cout.tie(0);ios::sync_with_stdio(false);
ll N;
cin >> N;
ll A;
cin >> A;
ll B;
cin >> B;
vector<ll> X(N,0);
for(ll i=0;i<N;++i)cin>>X[i];
ll ans=0;
for(ll i=1;i<N;++i){
ans+=min(A*(X[i]-X[i-1]),B);
}
prt(ans)
return 0;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define IO(i, o) freopen(i, "r", stdin), freopen(o, "w", stdout)
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
int n, a, b, x[100000];
int main(){
//IO("input.txt", "output.txt");
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> a >> b >> x[0];
long long cnt = 0;
for(int i = 1; i < n; i++){
cin >> x[i];
cnt += min((long long)b, a * (long long)(x[i] - x[i - 1]));
}
cout << cnt << "\n";
return 0;
} | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
using pv = pair<P,vector<int>>;
vector<int> graph[1005];
int main(){
int n,m;
cin >> n >> m;
vector<P> edge(m);
rep(i,m){
cin >> edge[i].first >> edge[i].second;
--edge[i].first;--edge[i].second;
graph[edge[i].first].push_back(edge[i].second);
}
int id = -1;
int mn = INF;
vector<int> ans;
rep(i,m){
vector<bool> seen(n,false);
queue<pv> q;
q.push(pv(P(edge[i].second,0),{}));
while(!q.empty()){
int now = q.front().first.first;
int c = q.front().first.second;
vector<int> way = q.front().second;
q.pop();
if(now==edge[i].first){
if(c < mn){
id = i;
mn = c;
way.push_back(now);
ans = way;
break;
}else{
break;
}
}
if(seen[now]) continue;
seen[now] = true;
way.push_back(now);
for(int j:graph[now]){
if(seen[j]) continue;
q.push(pv(P(j,c+1),way));
}
}
}
if(mn==INF){
cout << -1 << endl;
}else{
cout << (int)ans.size() << endl;
rep(i,ans.size()) cout << ans[i]+1 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 7;
const int L = 17;
int go[N][L];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector <int> x(n);
for (int i = 0; i < n; i++) {
cin >> x[i];
}
int l;
cin >> l;
vector <int> who(n);
int ptr = n - 1;
for (int i = n - 1; i >= 0; i--) {
while (ptr > i && x[ptr] - x[i] > l) ptr--;
who[i] = ptr;
}
for (int i = n - 1; i >= 0; i--) {
go[i][0] = who[i];
for (int j = 1; j < L; j++) {
go[i][j] = go[go[i][j - 1]][j - 1];
}
}
int q;
cin >> q;
while (q--) {
int a, b;
cin >> a >> b;
a--, b--;
if (a > b) swap(a, b);
int pos = a;
int res = 0;
for (int i = L - 1; i >= 0; i--) {
if (go[pos][i] < b) {
pos = go[pos][i];
res += (1 << i);
}
}
cout << res + 1 << '\n';
}
return 0;
} | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Wavelet {
public:
explicit Wavelet(const vector<unsigned int>& a) : N(a.size()), vb(getDigits_(a), BitVector(a.size())){
vector<unsigned int> v = a;
vector<unsigned int> v0(N), v1(N);
for(int i=vb.size()-1;i>=0;i--){
maxVal = 2 * maxVal + 1;
int idx0 = 0, idx1 = 0;
for(int j=0;j<N;j++){
if(v[j]&(1<<i)){
v1[idx1++] = v[j];
vb[i].set(j);
} else {
v0[idx0++] = v[j];
}
}
for(int j=0;j<idx0;j++) v[j] = v0[j];
for(int j=0;j<idx1;j++) v[j+idx0] = v1[j];
vb[i].build();
}
}
int getLeqNum(int val, int end){
if(end <= 0) return 0;
if(val < 0) return 0;
val = min(val, maxVal);
int res = 0;
int offset = 0, num = end-1;
for(int i=vb.size()-1;i>=0;i--){
if(num < offset) break;
int rank1 = vb[i].rank(num) - vb[i].rank(offset-1);
int rank0 = num-offset+1-rank1;
if(val&(1<<i)){
if(i == 0) return res + num-offset+1;
res += rank0;
offset = N - vb[i].rank(N) + vb[i].rank(offset-1);
num = offset + rank1 - 1;
} else {
if(i == 0) return res + rank0;
offset = offset - vb[i].rank(offset-1);
num = offset + rank0 - 1;
}
}
return res;
}
private:
int getDigits_(const vector<unsigned int>& a){
int m = *max_element(a.begin(), a.end());
int res = 0;
while(m){ ++res; m /= 2; }
return max(1, res);
}
class BitVector{
public:
explicit BitVector(int n=0) : bit((n+63)/64) {}
void set(int p){
while(p/64 >= bit.size()) bit.emplace_back(0ULL, 0);
bit[p/64].first |= 1ULL << (p%64);
}
bool get(int p) const {
if(p/64 >= bit.size()) return false;
return bit[p/64].first & (1ULL << p%64);
}
void build(){
for(int i=1;i<bit.size();i++)
bit[i].second = bit[i-1].second + bitCount_(bit[i-1].first);
}
int rank(int p) const {
if(p < 0 || bit.size() == 0) return 0;
if(p/64 >= bit.size()) return bit.back().second + bitCount_(bit.back().first);
if(p%64 == 63) return bit[p/64].second + bitCount_(bit[p/64].first);
return bit[p/64].second + bitCount_(bit[p/64].first & (1ULL << p%64+1)-1);
}
private:
vector<pair<unsigned long long, int>> bit;
int bitCount_(unsigned long long t) const {
t = (t&0x5555555555555555ULL)+((t>>1)&0x5555555555555555ULL);
t = (t&0x3333333333333333ULL)+((t>>2)&0x3333333333333333ULL);
t = (t&0x0f0f0f0f0f0f0f0fULL)+((t>>4)&0x0f0f0f0f0f0f0f0fULL);
t = (t&0x00ff00ff00ff00ffULL)+((t>>8)&0x00ff00ff00ff00ffULL);
t = (t&0x0000ffff0000ffffULL)+((t>>16)&0x0000ffff0000ffffULL);
t = (t&0x00000000ffffffffULL)+((t>>32)&0x00000000ffffffffULL);
return t;
}
};
private:
const int N;
int maxVal = 0;
vector<BitVector> vb;
};
int main(){
int N, Q; cin >> N >> Q;
vector<int> last(N, -1);
vector<unsigned int> a(N, 0);
for(int i=0;i<N;i++){
int t; cin >> t;
--t;
if(last[t] != -1) a[i] = last[t] + 1;
last[t] = i;
}
Wavelet wav(a);
for(int i=0;i<Q;i++){
int l, r; cin >> l >> r;
--l;
cout << r - l - (wav.getLeqNum(r, r) - wav.getLeqNum(l, r)) << endl;
}
}
| #include <bits/stdc++.h>
struct FastIO {
FastIO() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
}
} fast_io;
#if DEBUG
template <typename T>
void debug(const T& value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(const T& value, const Ts&... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \
cerr << #__VA_ARGS__ << ": "; \
debug(__VA_ARGS__); \
cerr << " (L" << __LINE__ << ")\n"; \
} while (0)
#else
#define dbg(...)
#endif
void read_from_cin() {}
template <typename T, typename... Ts>
void read_from_cin(T& value, Ts&... args) {
std::cin >> value;
read_from_cin(args...);
}
#define rd(type, ...) \
type __VA_ARGS__; \
read_from_cin(__VA_ARGS__);
template <typename T>
void write_to_cout(const T& value) {
std::cout << value << '\n';
}
template <typename T, typename... Ts>
void write_to_cout(const T& value, const Ts&... args) {
std::cout << value << ' ';
write_to_cout(args...);
}
#define wt(...) write_to_cout(__VA_ARGS__);
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using ll = long long;
template <typename T>
using V = std::vector<T>;
template <typename T>
using VV = V<V<T>>;
#include <math.h>
template <typename T, class DS>
class Mo {
public:
Mo(DS& ds) : ds_(ds) {}
void AddQuery(int begin, int end) {
int index = queries_.size();
queries_.push_back({begin, end, index});
}
std::vector<T> ProcessQueries() {
int bin = sqrt(queries_.size());
sort(queries_.begin(), queries_.end(),
[&bin](const Query& a, const Query& b) {
int c = a.begin / bin, d = b.begin / bin;
if (c != d) return c < d;
if (c % 2 == 0) {
return a.end < b.end;
}
return a.end > b.end;
});
std::vector<T> ret(queries_.size());
Query p = {0, 0, 0};
for (std::size_t i = 0; i < queries_.size(); ++i) {
const Query& c = queries_[i];
Add(c.begin, p.begin);
Del(p.begin, c.begin);
Add(p.end, c.end);
Del(c.end, p.end);
ret[c.index] = ds_.Get();
p = c;
}
return ret;
}
private:
struct Query {
int begin, end, index;
};
void Add(int begin, int end) {
for (int i = begin; i < end; ++i) {
ds_.Add(i);
}
}
void Del(int begin, int end) {
for (int i = begin; i < end; ++i) {
ds_.Del(i);
}
}
DS& ds_;
std::vector<Query> queries_;
};
using namespace std;
struct DS {
DS(int n) : c(n), kinds(n), unique_kinds(0) {}
void Add(int i) {
if (kinds[c[i] - 1]++ == 0) {
++unique_kinds;
}
}
void Del(int i) {
if (--kinds[c[i] - 1] == 0) {
--unique_kinds;
}
}
int Get() const { return unique_kinds; }
V<int> c;
V<int> kinds;
int unique_kinds;
};
int main() {
rd(int, n, q);
DS ds(n);
rep(i, n) cin >> ds.c[i];
Mo<int, DS> mo(ds);
rep(i, q) {
rd(int, l, r);
mo.AddQuery(l - 1, r);
}
for (int ans : mo.ProcessQueries()) {
wt(ans);
}
}
| 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.