code_file1
stringlengths 80
4k
| code_file2
stringlengths 91
4k
| similar_or_different
int64 0
1
|
|---|---|---|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e15;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
int main() {
int n;
cin >> n;
cout << 0 << endl;
string s;
cin >> s;
if (s == "Vacant") return 0;
vector<string> v(n);
v[0] = s;
int l = 0;
int r = n;
int p = (l+r)/2;
cout << p << endl;
while (cin >> s, s != "Vacant") {
v[p] = s;
int x = p - l - 1;
int y = r - p - 1;
if ((v[l] == s && x % 2 == 0) || (v[l] != s && x % 2 == 1)) {
r = p;
p = (l+r)/2;
} else {
l = p;
p = (l+r)/2;
}
cout << p << endl;
}
} | #include<iostream>
#include<stdio.h>
//#include <bits/stdc++.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#include<cmath>
#include<cstdint>
#define INF 1e9
#define rep(i,n)for(int i=0;(i)<(int)(n);i++)
#define REP(i,a,b)for(int i=(int)(a);(i)<=(int)(b);i++)
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define vec(type,n) vector<type>(n)
#define vvec(m,n) vector<vector<int>> (int(m),vector<int>(n))
#define ALL(a) (a).begin(),(a).end()
#define pb push_back
#define sz size()
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
ll dp[110][110];
string query(int n){
cout << n << endl;
fflush(stdout);
string res;
cin >> res;
if(res == "Vacant")exit(0);
return res;
}
int main(){
int n;
cin >> n;
int l = 0, r = n - 1;
string x = query(l);
string y = query(r);
while(1){
int mid = (l + r) / 2;
string z = query(mid);
if((z == x) != (l % 2 == mid % 2)){
r = mid;
y = z;
}
else {
l = mid;
x = z;
}
}
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int ara[n];
for(int i=0;i<n;i++) cin >> ara[i];
for(int i=n-1;i>=1;i--) cout << ara[i] << " ";
cout << ara[0] << endl;
return 0;
}
| #include <cstdio>
//#include <iostream>
//#include <string>
using namespace std;
// cl /EHsc xxx.cpp
int main(int argc, char *argv[])
{
int n;
scanf("%d", &n);
int *ary = new int[n];
int v;
int t = n;
while (t)
{
scanf("%d", &v);
ary[--t] = v;
}
for (int j = 0; j < n; j++)
{
printf((j == n-1) ? "%d\n" : "%d ", ary[j]);
}
delete[] ary;
return 0;
} | 1 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <algorithm>
#include <cstdio>
#include <iomanip>
#include <queue>
#include <deque>
#include <stack>
#include <fstream>
#include <cmath>
#include <random>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
typedef vector<ll> vec;
typedef vector<vec> mat;
template<class T> inline void chmin(T& a, T b) {
if (a > b) {
a = b;
}
}
template<class T> inline void chmax(T& a, T b) {
if (a < b) {
a = b;
}
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll N, M;
cin >> N >> M;
mat A(N, vec(M));
Rep (i, N) Rep (j, M) {
cin >> A[i][j];
A[i][j]--;
}
vector<bool> sports(M, true);
ll ans = 310;
Rep (i, M) {
vec cnt(M, 0);
Rep (j, N) {
Rep (k, M) {
if (sports[A[j][k]]) {
cnt[A[j][k]]++;
break;
}
}
}
ll sub = 0;
ll popular = -1;
Rep (j, M) {
if (sub < cnt[j]) popular = j;
chmax(sub, cnt[j]);
}
chmin(ans, sub);
sports[popular] = false;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define PI 3.14159265358979323846264338327950288419
using namespace std;
int n, m;
int pref[303][303];
int ptr[303];
int freq[303];
queue<int> Q;
bool die[303];
void incre(int j, int c){
// printf(" ++%d\n", j);
freq[j]++;
if(freq[j] == c + 1){
// printf("c = %d, die %d\n", c, j);
die[j] = true;
Q.push(j);
}
}
bool possible(int c){
// can choose with <= c ppl per event?
memset(freq, 0, sizeof(freq));
while(!Q.empty()){
Q.pop();
}
for(int j = 1; j <= m; j++){
die[j] = false;
}
for(int i = 1; i <= n; i++){
ptr[i] = 1;
incre(pref[i][1], c);
}
while(!Q.empty()){
int del = Q.front();
Q.pop();
for(int i = 1; i <= n; i++){
while(ptr[i] <= m && die[pref[i][ptr[i]]]){
ptr[i]++;
incre(pref[i][ptr[i]], c);
}
}
}
for(int j = 1; j <= m; j++){
if(!die[j]){
return true;
}
}
return false;
}
int main(){
scanf("%d %d", &n, &m);
for(int i = 1; i <= n; i++){
for(int j = 1; j <= m; j++){
scanf("%d", &pref[i][j]);
}
}
int l = 0, r = n;
while(r - l > 1){
int mid = (l + r) >> 1;
if(possible(mid)){
r = mid;
}else{
l = mid;
}
}
printf("%d\n", r);
return 0;
} | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rep2(i,s,t) for(int i = s; i <= t; ++i)
#define rev(i,n) for(int i = n-1; i >= 0; --i)
#define rev1(i,n) for(int i = n; i > 0; --i)
#define rev2(i,s,t) for(int i = s; i >= t; --i)
#define F first
#define S second
using namespace std;
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(a > b){ a = b; return 1; } return 0; }
using ll = long long;
using pi = pair<int,int>;
using vi = vector<ll>;
using vii = vector<vi>;
int main()
{
int n; cin >> n;
vi a(n);
rep(i,n) cin >> a[i];
ll inf = (1LL << 60);
vii dp(n+1, vi(2, -inf));
dp[0][0] = 0;
rep1(i,n) {
chmax(dp[i][0], dp[i-1][0] + a[i-1]);
chmax(dp[i][1], dp[i-1][0] - a[i-1]);
chmax(dp[i][0], dp[i-1][1] - a[i-1]);
chmax(dp[i][1], dp[i-1][1] + a[i-1]);
}
// rep(i,n+1) {
// cout << dp[i][0] << ":" << dp[i][1] << "\n";
// }
cout << dp[n][0] << "\n";
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,s,n) for (int i = s; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<ll> a(n);
int cnt = 0, cnt_z = 0;
rep(i,0,n) {
cin >> a[i];
if (a[i] < 0) cnt++;
else if (a[i] == 0) cnt_z++;
}
ll ans = 0;
rep(i,0,n) ans += abs(a[i]);
if (cnt_z == 0 && cnt % 2 == 1) {
ll b = 100000000000;
rep(i,0,n) {
b = min(b,abs(a[i]));
}
ans -= 2*b;
}
cout << ans << endl;
return 0;
}
| 1 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n, a;
while(cin >> n, n){
n++;
vector<int> t(n);
t[0] = 0;
for(int i = 1;i < n;i++){
cin >> a;
t[i] = max(t[i-1]+a, a);
}
cout << *max_element(t.begin()+1, t.end()) << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, a, b) for (ll i = (a); i < (b); i++)
#define chmax(x, v) \
do { \
x = max(x, v); \
} while (0)
#define chmin(x, v) \
do { \
x = min(x, v); \
} while (0)
typedef uint64_t ull;
typedef int64_t ll;
typedef std::pair<ll, ll> PLL;
using namespace std;
// {{{ (k)MP: Search pattern from text
// MP<std::string> mp("a");
// auto res = mp.findAll("aabb"); // res = {0, 1}
template<typename T>
class MP {
private:
ll n;
T t;
std::vector<ll> a;
public:
explicit constexpr MP(const T &pattern) : t(pattern) {
n = pattern.size();
a = std::vector<ll>(n+1);
a[0] = -1;
int j = -1;
for (int i = 0; i < n; ++i) {
while (j != -1 && pattern[j] != pattern[i])
j = a[j];
j++;
a[i+1] = j;
}
}
ll operator[](ll i) {
return a[i];
}
std::vector<ll> findAll(const T &text) {
std::vector<ll> res;
int j = 0;
for (int i = 0; i < text.size(); ++i) {
while (j != -1 && t[j] != text[i])
j = a[j];
j++;
if (j == n) {
res.push_back(i-j+1);
j = a[j];
}
}
return res;
}
};
// }}}
ll N;
vector<ull> a, b;
vector<ull> diff(vector<ull> &v) {
vector<ull> res(v.size());
rep(i, N) {
res[i] = v[i] ^ v[(i+1)%N];
}
return res;
}
signed main() {
cin >> N;
a.resize(N);
b.resize(N);
rep(i, N) { cin >> a[i]; }
rep(i, N) { cin >> b[i]; }
auto ad = diff(a);
auto bd = diff(b);
bd.insert(bd.end(), bd.begin(), bd.end()); // bd += bd;
// cout << "diff: " << endl;
// for (auto x : ad) { cout << x << " "; } cout << endl;
// for (auto x : bd) { cout << x << " "; } cout << endl;
MP<vector<ull>> mp(ad);
auto matches = mp.findAll(bd);
reverse(begin(matches), end(matches));
for (auto i : matches) {
ll k = N-i;
if (k >= N)
continue;
ull x = a[k] ^ b[0];
cout << k << " " << x << endl;
}
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std ;
// MY TOOLS
#define let long long int
#define async ios_base::sync_with_stdio(false);cin.tie(NULL);
//
int dp[10001][101][2] ;
int mod = 1e9 + 7 ;
void self_add( int &a, int b ){
a += b ;
if( a >= mod ) a -= mod ;
}
int SIZE ;
int generate_top_down( string num, int idx, int sum, int D, int bound ){
if( idx == SIZE ) return ( sum % D == 0 ) ;
int &check = dp[idx][sum][bound] ;
if( check != -1 ) return check ;
int N = ( num[idx]-'0' ) ;
int up_to = ( bound == 1 ) ? N : 9 ;
int payload = 0, new_bound ;
for( int digit = 0 ; digit <= up_to ; digit++ ){
new_bound = ( digit == N ) ? bound : 0 ;
self_add( payload, generate_top_down( num, idx+1, (sum+digit)%D, D, new_bound ) ) ;
}
return check = payload ;
}
// main
// write your code here
int main(){
async ;
memset( dp, -1, sizeof(dp) ) ;
string K ; int D ;
cin >> K >> D ;
SIZE = K.size() ;
int ans = generate_top_down( K, 0, 0, D, 1 ) - 1 ;
if( ans == -1 ) {
cout << mod - 1 ;
}
else{
cout << ans ;
}
return 0 ;
}
| #include <bits/stdc++.h>
using namespace std;
/* typedef */
typedef long long ll;
typedef pair<int, int> pii;
/* constant */
const int mod = 1e+9 + 7;
/* global variables */
/* funciton */
/* main */
int main() {
string S;
int D;
cin >> S >> D;
vector<int> a(S.size());
for (int i = 0; i < S.size(); i++) a[i] = S[i] - '0';
// dp[i][j][0] i桁目まで使って, mod D = j, 現時点でSよりも数字が小さいことが確定している
// dp[i][j][1] i桁目まで使って, mod D = j, 現時点でSと同じ数字 -> これから同じ or 小さい
// transition)
// dp[i+1][j+(num = a[i]) mod D][1] += dp[i][j][1]
// dp[i+1][j+(num < a[i]) mod D][0] += dp[i][j][1]
// dp[i+1][j+(0<= num <= 9) mod D][0] += dp[i][j][0]
// init
vector<vector<vector<ll>>> dp(a.size() + 1, vector<vector<ll>>(D, vector<ll>(2)));
dp[0][0][1] = 1;
// calc
for (int i = 0; i < a.size(); i++) {
for (int j = 0; j < D; j++) {
for (int num = 0; num <= 9; num++) {
int neJ = (j + num) % D;
if (num == a[i]) {
dp[i+1][neJ][1] += dp[i][j][1];
dp[i+1][neJ][1] %= mod;
}
if (num < a[i]) {
dp[i+1][neJ][0] += dp[i][j][1];
dp[i+1][neJ][1] %= mod;
}
dp[i+1][neJ][0] += dp[i][j][0];
dp[i+1][neJ][0] %= mod;
}
}
}
// ans = (mod D == j)の個数
// 答えに0が含まれるので-1する
ll ans = (dp[a.size()][0][1] + dp[a.size()][0][0] - 1 + mod) % mod;
cout << ans << '\n';
} | 1 |
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <cstdlib>
#include <complex>
#include <cctype>
#include <bitset>
using namespace std;
typedef string::const_iterator State;
#define Ma_PI 3.141592653589793
#define eps 0.00000001
#define LONG_INF 1e18
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define MOD 998244353
#define seg_size 262144
#define REP(a,b) for(long long a = 0;a < b;++a)
vector<complex<double>> DFT(vector<complex<double>> a) {
int n = a.size();
if (n == 1) return a;
vector<complex<double>> a0(n / 2), a1(n / 2);
REP(i, n) {
if (i % 2 == 0) {
a0[i / 2] = a[i];
}
else {
a1[i / 2] = a[i];
}
}
vector<complex<double>> inversed_a0 = DFT(a0), inversed_a1 = DFT(a1);
vector<complex<double>> inversed_a(n);
for (int i = 0; i < n; ++i) {
complex<double> zeta = complex<double>(cos(2 * Ma_PI * i / n), sin(2 * Ma_PI * i / n));
inversed_a[i] = inversed_a0[i % (n / 2)] + zeta * inversed_a1[i % (n / 2)];
}
return inversed_a;
}
vector<complex<double>> IDFT(vector<complex<double>> inversed_a) {
int n = inversed_a.size();
vector<complex<double>> now = DFT(inversed_a);
reverse(now.begin(), now.end());
for (int q = now.size() - 1; q >= 1; --q) {
swap(now[q], now[q - 1]);
}
REP(i, n) {
now[i] /= complex<double>(n, 0);
}
return now;
}
vector<complex<double>> conv(vector<complex<double>> a, vector<complex<double>> b) {
int deg = a.size() + b.size() - 1;
int n = 1;
while (n < deg) n <<= 1;
a.resize(n);
b.resize(n);
vector<complex<double>> inversed_a = DFT(a), inversed_b = DFT(b);
vector<complex<double>> inversed_c(n);
REP(i, n) {
inversed_c[i] = inversed_a[i] * inversed_b[i];
}
return IDFT(inversed_c);
}
long long inv(long long now) {
long long hoge = MOD - 2LL;
long long ans = 1;
while (hoge != 0) {
if (hoge % 2 == 1) {
ans *= now;
ans %= MOD;
}
hoge /= 2;
now *= now;
now %= MOD;
}
return ans;
}
long long jun[2100000] = {};
long long gyaku[2100000] = {};
long long combination(long long a, long long b) {
long long ans = jun[a];
ans *= gyaku[a - b];
ans %= MOD;
ans *= gyaku[b];
ans %= MOD;
return ans;
}
long long no_limit(long long a, long long b) {
return combination(a + b - 1, a);
}
int main() {
jun[0] = 1;
gyaku[0] = 1;
for (long long i = 1; i < 2100000; ++i) {
jun[i] = jun[i - 1] * i;
jun[i] %= MOD;
gyaku[i] = inv(jun[i]);
}
long long n, m;
cin >> n >> m;
long long ans = 0;
long long tmp = 0;
for (long long odd = m;; ++odd) {
long long even = m - (odd - m) * 2LL;
if (even < 0) break;
tmp -= (n * no_limit(odd - m, n - 1)) % MOD;
tmp += 2LL * MOD;
tmp %= MOD;
if (even > n) continue;
long long geko = no_limit(odd, n);
geko += tmp;
geko += MOD;
geko %= MOD;
ans += geko * combination(n, even);
ans %= MOD;
if (n - 1 >= even) {
ans += ((n * no_limit(odd - m, n - 1)) % MOD * combination(n - 1, even)) % MOD;
ans %= MOD;
}
}
cout << ans << endl;
return 0;
} | #pragma GCC optimize("O2,Ofast,inline,unroll-all-loops,-ffast-math")
#pragma GCC target("popcnt")
#include <bits/stdc++.h>
#define maxn 2010
#define maxv 4000010
#define ll long long
#define ull unsigned long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define pii pair<int, int>
#define pil pair<int, ll>
#define pll pair<ll, ll>
#define IL inline
#define ss system
using namespace std;
int n, k;
ll f[maxn][maxn], fac[maxv], ifac[maxv];
const ll p = 1e9 + 7;
template <class T> void read (T &x) {
char ch = x = 0;
bool fl = false;
while (!isdigit(ch))
fl |= ch == '-', ch = getchar();
while (isdigit(ch))
x = x * 10 + ch - '0', ch = getchar();
x = fl ? -x : x;
}
ll pw(ll a, ll b) {
ll ret = 1;
while (b) {
if (b & 1)
ret = ret * a % p;
a = a * a % p, b >>= 1;
}
return ret;
}
ll C(int a, int b) {
return a < b || b < 0 ? 0 : fac[a] * ifac[b] % p * ifac[a - b] % p;
}
void init() {
fac[0] = 1;
for (int i = 1; i < maxv; i++) {
fac[i] = fac[i - 1] * i % p;
}
ifac[maxv - 1] = pw(fac[maxv - 1], p - 2);
for (int i = maxv - 2; ~i; i--) {
ifac[i] = ifac[i + 1] * (i + 1) % p;
}
}
int main() {
read(n), read(k), init(), f[0][0] = 1;
for (int i = 0; i <= n; i++) {
for (int j = !i; j <= i; j++) {
if (i)
f[i][j] = f[i - 1][j];
f[i][j] = (f[i][j] + f[i][j - 1] * (n - j + 1) % p * C(n - i + (n - j + 1) * (k - 1) - 1, k - 2)) % p;
}
}
printf("%d\n", f[n][n * (k > 1)]);
return 0;
} | 0 |
#include<bits/stdc++.h>
#define ll long long int
#define vec vector<ll>
#define mat vector<vector<ll>>
using namespace std;
const ll mod=1000000007;
const ll inf=LONG_LONG_MAX;
ll dx4[4]={1,0,-1,0};
ll dy4[4]={0,-1,0,1};
ll dx8[8]={1,0,-1,1,-1,1,0,-1};
ll dy8[8]={1,1,1,0,0,-1,-1,-1};
int main(){
ll n;
cin >> n;
ll a=0;
while(3*a<=n){
a++;
}
cout << a-1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int N;
cin >> N;
cout << N/3 << endl;
return 0;
} | 1 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
int month[]={0,31,29,31,30,31,30,31,31,30,31,30,31};
int m,day,sumday;
while(1){
cin >> m; // 月
if (m==0){ break;}
cin >> day; //日付
for(int i=0;i<m;i++){
day+=month[i];
}
switch(day%=7){
case 1:
cout<<"Thursday"<<endl;
break;
case 2:
cout<<"Friday"<<endl;
break;
case 3:
cout<<"Saturday"<<endl;
break;
case 4:
cout<<"Sunday"<<endl;
break;
case 5:
cout<<"Monday"<<endl;
break;
case 6:
cout<<"Tuesday"<<endl;
break;
default:
cout<<"Wednesday"<<endl;
break;
}
}
return 0;
} | #include <iostream>
#include <cstdio>
using namespace std;
string name[] = {"Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday"};
int dayOfWeek(int y, int m, int d) {
if(m == 1 || m == 2) {
y--;
m += 12;
}
return(y + y / 4 - y / 100 + y / 400 + (13*m + 8) / 5 + d) % 7;
}
int main(void) {
int y = 2004, m, d;
while(scanf("%d %d", &m, &d), m + d != 0) {
cout << name[dayOfWeek(y, m, d)] << 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;
int main() {
int N;
cin >> N;
cout << (N + 110) / 111 * 111 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int main( ) {
//freopen("B.01.in","r",stdin);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
vi a={111,222,333,444,555,666,777,888,999};
int n;
cin >> n;
rep(i, 0, 9){
if(n<=a[i]){
cout << a[i] << endl;
break;
}
}
return 0;
} | 1 |
#include<iostream>
#include<string>
using namespace std;
class Cube{
public:
int f[6];
Cube(){}
void roll_z(){roll(1,2,4,3);}
void roll_y(){roll(0,2,5,3);}
void roll_x(){roll(0,1,5,4);}
void roll(int i,int j,int k, int l){
int t=f[i];f[i]=f[j];f[j]=f[k];f[k]=f[l];f[l]=t;
}
void move(char ch){
if(ch=='E')for(int i=0;i<3;i++)roll_y();
if(ch=='W')roll_y();
if(ch=='N')roll_x();
if(ch=='S')for(int i=0;i<3;i++)roll_x();
}
};
int main(){
Cube c;
string com;
for(int i=0;i<6;i++){
cin>>c.f[i];
}
cin>>com;
for(int i=0;i<com.size();i++)c.move(com[i]);
cout<<c.f[0]<<endl;
return 0;
}
| #include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;
/* Articulation Points (Critical Routers) */
int timer = 0;
void getAP(unordered_map<int,vector<int>*>& adjacencyList, unordered_map<int,int>& d, unordered_map<int,int>& l, unordered_map<int,int>& p, unordered_map<int,bool>& visited, int* ap, int sv){
visited[sv] = true;
l[sv] = d[sv] = ++timer;
int children = 0;
for(int i=0;i<adjacencyList[sv]->size();i++){
int n = adjacencyList[sv]->at(i);
if(visited.count(n)!=0 && p[sv]!=n){
l[sv] = min(l[sv],d[n]);
}else if(visited.count(n)==0){
p[n] = sv;
children += 1;
getAP(adjacencyList, d, l, p, visited, ap, n);
l[sv] = min(l[sv],l[n]);
if(p[sv]!=-1 && d[sv] <= l[n]){
ap[sv]=1;
}
}
}
if(p[sv]==-1 && children>1){
ap[sv] = 1;
}
}
void getAP(unordered_map<int,vector<int>*>& adjacencyList){
int n = adjacencyList.size();
unordered_map<int,int> discoveryTime;
unordered_map<int,int> lowestTime;
unordered_map<int,int> parent;
int* ap = new int[n];
unordered_map<int,bool> visited;
timer = 0;
for(int i=0;i<n;i++){
ap[i] = 0;
}
parent[0] = -1;
getAP(adjacencyList,discoveryTime,lowestTime,parent,visited,ap,0);
for(int i=0;i<n;i++){
if(ap[i]==1){
cout << i << endl;
}
}
}
int main() {
int n, e;
cin >> n >> e;
unordered_map<int,vector<int>*> adjacencyList;
for(int i=0;i<n;i++){
vector<int>* v = new vector<int>;
adjacencyList[i] = v;
}
for(int i=0;i<e;i++){
int x,y;
cin >> x >> y;
adjacencyList[x]->push_back(y);
adjacencyList[y]->push_back(x);
}
getAP(adjacencyList);
}
| 0 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll A, B, C, D;
cin >> A >> B >> C >> D;
if (A + B < C + D) {
cout << "Right" << endl;
} else if (A + B > C + D) {
cout << "Left" << endl;
} else {
cout << "Balanced" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
a = a + b - c - d;
if (a > 0) cout << "Left";
if (a < 0) cout << "Right";
if (a == 0) cout << "Balanced";
} | 1 |
#include <stdio.h>
int main(void)
{
int a,b=0,c=0,e,d,f,i,j,team[10000]={0},k[100]={0};
scanf("%d",&a);
for(i=0;i<a-1;i++){
for(j=i;j<a-1;j++){
b++;
}
}
for(i=0;i<b;i++){
scanf("%d %d %d %d",&c,&d,&e,&f);
if(e>f){
team[c]=team[c]+3;
}
else if(f>e){
team[d]=team[d]+3;
}
else{
team[c]=team[c]+1;
team[d]=team[d]+1;
}
}
/*for(i=1;i<a+1;i++){
printf("%d\n",team[i]);
}
printf("\n");
*/
d=1;
f=0;
for(i=1000;i>0;i--){
for(j=1;j<a+1;j++){
if(i == team[j]){
k[j]=d;
f++;
}
}
if(f>=1){
d=d+f;
f=0;
}
}
for(i=1;i<a+1;i++){
printf("%d\n",k[i]);
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main(){
int N;
int p[100], order[100];
int a,b,c,d;
vector<int> v;
cin >> N;
for( int i=0;i<N;i++ ) p[i]=0;
for( int i=0,len=N*(N-1)/2;i<len;i++ ){
cin >>a >> b >> c >> d;
// cout << a<<b<<c<<d<<endl;
a--; b--;
if( c==d ){ // テつ暗δクテつづつォテつ陛つェテつづつッ
p[a]++; p[b]++;
}else if( c>d )
p[a]+=3;
else
p[b]+=3;
}
/*
for( int i=0;i<N;i++ )
cout << "p "<<p[i] << endl;
*/
for( int i=1;i<=N; ){ // テつ湘つつ暗δ甘つεつ凝つーテつプ
// cout << "No."<<i<<endl;
v.clear();
int max = -1;
for( int j=0;j<N;j++ ){
if( p[j]>max ){
max=p[j];
// cout << " max="<<j<<endl;
v.clear();
v.push_back( j );
} else if( p[j]==max ){
v.push_back( j );
}
}
for( int j=0;j<v.size();j++ ){
order[v[j]] = i; p[v[j]] = -10;
}
i+=v.size();
}
for( int i=0;i<N;i++ )
cout << order[i] << endl;
return 0;
} | 1 |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<ll> VLL;
typedef vector<PLL> VP;
const static int INF = 1000000000;
const static int MOD = 1000000007;
const int dx[4]={1, 0, -1, 0};
const int dy[4]={0, 1, 0, -1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
#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 rept(i,m,n) for(ll i=m; i<n; i++)
#define stl_rep(itr, x) for (auto itr = x.begin(); itr != x.end(); ++itr)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define PF push_front
#define PB push_back
#define SORT(V) sort((V).begin(), (V).end())
#define RVERSE(V) reverse((V).begin(), (V).end())
#define paired make_pair
#define PRINT(V) for(auto v : (V)) cout << v << " "
//charを整数に
int ctoi(char c) { if (c >= '0' && c <= '9') { return c - '0'; } return 0; }
// 累積和 for (int i = 0; i < N; ++i) s[i+1] = s[i] + a[i];
void cum_sum(int N,vector<double> a, vector<double> &s){ for(int i=0; i<N; i++){ s[i+1]=s[i]+a[i];}}
//ユークリッドの控除法
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; // Be careful not to overflow
}
//素数判定
bool is_prime(long long n) {
if (n <= 1) return false;
for (long long p = 2; p * p <= n; ++p) {
if (n % p == 0) return false;
}
return true;
}
int getdigit(ll num){
unsigned digit=0;
while(num!=0){
num /= 10;
digit++;
}
return digit;
}
//空白文字も入力 getline(cin, S);
//桁数指定 setprecision
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll N, A, B;
cin >> N >> A >> B;
VLL X(N);
rep(i,N){
cin >> X[i];
}
VLL dif(N);
rep(i,N-1){
dif[i]=X[i+1]-X[i];
dif[i]*=A;
}
ll ans=0;
rep(i,N-1){
if(dif[i]>=B){
ans+=B;
}
else{
ans+=dif[i];
}
}
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
int n;
long long a, b;
long long xi, x;
long long ans=0;
cin >> n >> a >> b;
cin >> x;
for (int i =0; i < n-1; ++i) {
cin >> xi;
if (a*(xi - x) > b)
ans += b;
else
ans += a*(xi-x);
x = xi;
}
cout << ans;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = (1 << 17) + 10;
const int mod = 1e9 + 7;
int n, x, y, z, ans;
int lim, Haiku, dp[45][N];
ll PowMod(ll a, ll b) {
ll res = 1 % mod;
while(b) {
if(b & 1) res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
int main() {
cin >> n >> x >> y >> z;
dp[0][0] = 1; lim = (1 << (x + y + z)) - 1;
Haiku = (1 << (x - 1)) + (1 << (x + y - 1)) + (1 << (x + y + z - 1));
// cout << n << " " << lim << endl;
for(int i = 1;i <= n; ++i) {
for(int S = 0;S <= lim; ++S) {
if(!dp[i - 1][S]) continue;
for(int j = 1;j <= 10; ++j) {
int T = (((S << j) | (1 << (j - 1)))) & lim;
if((T & Haiku) == Haiku) continue;
dp[i][T] += dp[i - 1][S];
dp[i][T] %= mod;
}
}
}
for(int i = 0;i <= lim; ++i)
ans = (ans + dp[n][i]) % mod;
ans = (PowMod(10, n) - ans + mod) % mod;
cout << ans << endl;
return 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 = 1e9;
const ll MOD = 1e9+7;
const ll LINF = 1e18;
ll modpow(ll a, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % MOD;
(a *= a) %= MOD;
n >>= 1;
}
return res;
}
const ll maxf = 10000000;
ll fact[maxf+5];
ll ifact[maxf+5];
void fact_init(){
fact[0] = 1;
for(ll i=1; i<=maxf; i++) fact[i] = (fact[i-1] * i) % MOD;
ifact[maxf]=modpow(fact[maxf],MOD-2);
for(ll i=maxf; i>=1; i--) ifact[i-1] = (ifact[i] * i) % MOD;
}
ll comb(ll n, ll r){
if(n<r || n<0 || r<0) return 0;
if(fact[0] == 0) fact_init();
return ((fact[n] * ifact[n-r]) % MOD * ifact[r]) % MOD;
}
ll naive_comb(ll n, ll r){
ll res = 1;
for (ll i = n; i > n - r; i--) res = res * i % MOD;
for (ll i = 1; i <= r; i++) res = (res * modpow(i, MOD-2)) % MOD;
return res;
}
// 参考: https://drken1215.hatenablog.com/entry/2019/06/15/111500
signed main()
{
cin.tie( 0 ); ios::sync_with_stdio( false );
ll n,m,k; cin>>n>>m>>k;
ll sum=0;
// y軸方向の取りうる距離
for(ll i=0; i<=n-1; i++){
// x軸方向の取りうる距離
for(ll j=0; j<=m-1; j++){
// y軸方向の距離がiのとき、選べるマスの組数はn-i通り (x軸も同様に考える)
// (配置する駒同士は区別されない)
ll tmp=(n-i)*(m-j)%MOD*(i+j)%MOD;
// i,jがともに0でないならば、そのような駒の配置の仕方は2パターン存在する
// 例えば (x1,y1), (x2,y2) が i,j を成すなら、(x1,y2), (x2,y1) も同様に i,j を成す
// 互いに区別される配置で同じ i,j の組合せがもう一組作れるので、i,j がともに0でない場合は2倍する
if(i!=0 && j!=0) (tmp*=2)%=MOD;
(sum+=tmp)%=MOD;
}
}
ll ans=(sum*comb(n*m-2,k-2))%MOD;
cout<<ans<<endl;
} | 0 |
#include<stdio.h>
int main(){
char a[100];
scanf("%[^\n]", a);
int ctr = 0;
for(int i= 0; a[i] != '\0'; i++){
if(a[i] == ' '){
if(a[i - 1] == a[i + 1]){
ctr++;
}
}
}
if(ctr == 2){
printf("YES\n");
}
else{
printf("NO\n");
}
return 0;
} | #include <iostream>
#include <cmath>
#include <algorithm>
#include <bitset>
#include <iomanip>
#include <cstdio>
#include <new>
#include <vector>
#include <cstdlib>
#include <string>
#include <set>
#include <tuple>
#include<map>
using namespace std;
int main() {
string A, B, C;
cin >> A >> B >> C;
bool ans = true;
if (A.at(A.size() - 1) != B.at(0)) ans = false;
if (B.at(B.size() - 1) != C.at(0)) ans = false;
if (ans) cout << "YES" << endl;
else cout << "NO" << endl;
} | 1 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define pb push_back
using namespace std;
typedef long long ll;
int n,k;
int f(int x,vector<int>v){
int ans=0;
for(int i=min(x-1,n-1);i>=0;i--){
int res=0;
int p=x-1-i;
vector<int> t(i+1);
rep(j,i+1) t[j]=v[j];
sort(t.begin(),t.end());
rep(j,i+1){
if(p>0&&t[j]<0){
p--;
}else res+=t[j];
}
ans=max(ans,res);
}
return ans;
}
int main(){
cin>>n>>k;
vector<int> v(n);
rep(i,n) cin>>v[i];
vector<int> u(n);
rep(i,n) u[i]=v[i];
reverse(u.begin(),u.end());
int ans=0;
if(k>=n){
ans=f(k,u);
}else{
rep(i,k){
ans=max(f(i,u)+f(k-i,v),ans);
}
}
cout<<ans<<endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
string s;
cin >> s;
int cnt=0;
for(int i=1; i<n; i++){
if(s.at(i) == 'E') cnt++;
}
vector<int> change(n);
change.at(0) = cnt;
for(int i=1; i<n; i++){
change.at(i) = change.at(i-1);
if(s.at(i-1) == 'W') change.at(i)++;
if(s.at(i) == 'E') change.at(i)--;
}
int ans=change.at(0);
for(int i=0; i<n; i++){
ans = min(ans, change.at(i));
}
cout << ans << endl;
} | 0 |
#include<bits/stdc++.h>
#define ll long long
#define inf(x) (ll)(1e##x)
using namespace std;
template<typename tn> void read(tn &a){
tn x=0,f=1; char c=' ';
for(;!isdigit(c);c=getchar()) if(c=='-') f=-1;
for(;isdigit(c);c=getchar()) x=x*10+c-'0';
a=x*f;
}
int n,m;
vector<int> v[3];
int main(){
read(n);read(m);
for(int i=1;i<=m;i++){
int x;read(x);
v[x&1].push_back(x);
}
if(v[1].size()>2){puts("Impossible");return 0;}
if(m==1){
int p=v[0].size()?v[0][0]:v[1][0];
cout<<p<<'\n';
cout<<p/2+1<<'\n';
if(p&1){
for(int i=1;i<=p/2;i++) cout<<2<<' ';
cout<<1<<'\n';
}
else{
for(int i=1;i<=p/4;i++) cout<<2<<' ';
cout<<1<<' ';
for(int i=1;i<=(p-2)/4;i++) cout<<2<<' ';
cout<<1<<'\n';
}
return 0;
}
if(v[1].size()) v[2].push_back(v[1][0]);
for(int x:v[0]) v[2].push_back(x);
if(v[1].size()>1) v[2].push_back(v[1][1]);
for(int x:v[2]) cout<<x<<' ';cout<<'\n';
cout<<v[2].size()-(v[2].back()==1)<<'\n';
cout<<v[2][0]+1<<' ';
for(int i=1;i+1<v[2].size();i++) cout<<v[2][i]<<' ';
if(v[2].back()>1) cout<<v[2].back()-1<<'\n';
return 0;
} | #include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
int sum, n;
int a[101], odd, evn, pos[101];
int b[101], cnt;
void work()
{
if(n == 1)
{
if(a[1] == 1) b[++cnt] = 1;
else b[++cnt] = 1, b[++cnt] = a[1] - 1;
return;
}
if(a[1] & 1) b[++cnt] = a[1] + 1;
else b[++cnt] = 1, b[++cnt] = a[1];
for(int i=2; i<n; i++) b[++cnt] = a[i];
if(a[n]==1) return;
else b[++cnt] = a[n]-1;
}
int main()
{
scanf("%d%d", &sum, &n);
for(int i=1; i<=n; i++) scanf("%d", &a[i]);
for(int i=1; i<=n; i++)
if(a[i] & 1) pos[++odd] = i;
else evn++;
if(odd > 2) printf("Impossible\n"), exit(0);
if(odd == 0) work();
else if(odd == 1) swap(a[pos[1]], a[1]), work();
else swap(a[pos[1]], a[1]), swap(a[pos[2]], a[n]), work();
for(int i=1; i<=n; i++) printf("%d ", a[i]); putchar('\n');
printf("%d\n", cnt);
for(int i=1; i<=cnt; i++) printf("%d ", b[i]); putchar('\n');
return 0;
} | 1 |
#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/assoc_container.hpp> // Common file
//#include <ext/pb_ds/tree_policy.hpp>
//#include <functional> // for less
#define PI acos(-1.0)
#define eps 1e-9
#define ll long long
#define ull unsigned long long
#define nl printf("\n")
#define sf scanf
#define pf printf
#define INF (ll)1e15
#define mod 1000000007
///#define isValid(n,m,nx,ny)nx>=0&&nx<n&&ny>=0&&ny<m
///int kx[]={1, 1, -1, -1, 2, 2, -2, -2}; //knight moves
///int ky[]={2,-2, 2, -2, 1,-1, 1, -1}; //knight moves
///int dx[]={1,-1,0,0,1,-1,1,-1};//eight direction
///int dy[]={0,0,1,-1,1,-1,-1,1};//eight direction
///using namespace __gnu_pbds;
using namespace std;
///inline double toRad(double deg){return deg*PI/180;}
///inline double toDeg(double rad){return rad*180/PI;}
///typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> new_data_set;
const int S=123456;
int main()
{
#ifndef ONLINE_JUDGE
//freopen("input.txt","r",stdin);
#endif
ll n,a,b;
while(sf("%lld %lld %lld",&n,&a,&b)==3)
{
ll ara[n+5];
for(int i=0;i<n;i++)sf("%lld",&ara[i]);
ll ans=0;
for(int i=0;i<n-1;i++)
{
ll dis=ara[i+1]-ara[i];
if(dis*a<=b)ans+=(dis*a);
else ans+=b;
}
pf("%lld\n",ans);
}
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=2e5+5;
int a[maxn],b[maxn];
int main(){
int n;
vector<int>p;
cin>>n;
for(int i=1;i<=n;++i)scanf("%d",&a[i]);
for(int i=1;i<=n;++i)scanf("%d",&b[i]);
reverse(b+1,b+n+1);
int h1=n,q1=1,mx;
for(int i=1;i<=n;++i){
if(a[i]==b[i]){
mx=a[i];
h1=i;
while(a[i]==b[i]){
i++;
}
q1=i-1;
break;
}
}
for(int i=1;i<=n;++i){
if(a[i]!=mx&&b[i]!=mx&&h1<=q1){
swap(b[i],b[h1]);
h1++;
}
}
if(h1<=q1){ puts("No");return 0;}
puts("Yes");
for(int i=1;i<n;++i)
printf("%d ",b[i]);
printf("%d\n",b[n]);
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef long double louble;
template<typename T1,typename T2> inline T1 max(T1 a,T2 b){return a<b?b:a;}
template<typename T1,typename T2> inline T1 min(T1 a,T2 b){return a<b?a:b;}
namespace ae86
{
const int bufl = 1<<15;
char buf[bufl],*s=buf,*t=buf;
inline int fetch()
{
if(s==t){t=(s=buf)+fread(buf,1,bufl,stdin);if(s==t)return EOF;}
return *s++;
}
inline int ty()
{
int a=0,b=1,c=fetch();
while(!isdigit(c))b^=c=='-',c=fetch();
while(isdigit(c))a=a*10+c-48,c=fetch();
return b?a:-a;
}
}
using ae86::ty;
const int _ = 100007;
const char *YES = "Yes" , *NO = "No";
inline void failure(){puts(NO);exit(0);}
struct tla
{
#define lb(a) ((a)&(-(a)))
int t[_];
void cls(){memset(t,0,sizeof(t));}
inline void add(int x,int d){while(x)t[x]+=d,x-=lb(x);}
inline int sum(int x){int d=0;while(x<_)d+=t[x],x+=lb(x);return d;}
#undef lb
}t;
int n,val[_][3],tar[_],ic[2]={0},fc[2]={0};
int main()
{
n=ty();
for(int i=0;i<3;i++)for(int j=1;j<=n;j++)val[j][i]=ty();
for(int i=1;i<=n;i++)
{
int loc=(val[i][0]-1)/3+1;
if((loc-i)&1)failure();
tar[loc]=i;
int a=loc*3-2,b=a+1,c=b+1;
if(val[i][0]==a && val[i][1]==b && val[i][2]==c)continue;
if(val[i][0]==c && val[i][1]==b && val[i][2]==a)ic[i&1]^=1;
else failure();
}
t.cls();
for(int i=1,x;i<=n;i+=2)x=tar[i]+t.sum(tar[i])*2,fc[1]^=((x-i)/2)&1,t.add(tar[i],1);
t.cls();
for(int i=2,x;i<=n;i+=2)x=tar[i]+t.sum(tar[i])*2,fc[0]^=((x-i)/2)&1,t.add(tar[i],1);
puts((ic[1]==fc[0] && ic[0]==fc[1])?YES:NO);
return 0;
}
| 0 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
bool check(int n){
double rn=sqrt(n);
if(rn==(int)rn)return true;
else return false;
}
int main(){
int n;
cin >> n;
rep(i,n){
if(check(n-i)){
cout << n-i << endl;
return 0;
}
}
cout << 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
using P = pair <int, int>;
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) {return b ? gcd(b,a%b) : a;}
const long long INF = 1LL << 60;
const int mod = 1000000007;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
int main() {
string x;
cin >> x;
int n = x.size();
stack<char> st;
rep(i,n){
if (st.empty()) st.push(x[i]);
else if(st.top()=='S'){
if(x[i]=='T'){
st.pop();
}
else st.push(x[i]);
}
else st.push(x[i]);
}
cout << st.size() <<endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<int, int> mp;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
mp[x] += 1;
}
vector<int> ans;
for (auto p : mp) {
if (p.second >= 4) {
ans.push_back(p.first);
ans.push_back(p.first);
} else if (p.second >= 2) {
ans.push_back(p.first);
}
}
sort(ans.begin(), ans.end(), greater<int>());
if (ans.size() < 2) {
cout << 0 << endl;
} else {
cout << 1LL * ans[0] * ans[1] << endl;
}
return 0;
}
| #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair <int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int mod = 1e9 + 7;
const char nl = '\n';
void solve() {
int n;
cin >> n;
int ara[n];
for(int i = 0; i < n; ++i){
cin >> ara[i];
}
sort(ara, ara + n);
ll a(0), b(0);
ll len = n - 1;
char c(1);
while(len){
if(ara[len] == ara[len - 1]){
if(c){
a = ara[len];
c = 0;
}
else{
b = ara[len];
break;
}
len--;
}
len--;
}
cout << a * b << nl;
}
int main() {
#ifndef ONLINE_JUDGE
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
solve();
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef tuple<int,int,int> tpl;
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define REVERSE(c) reverse((c).begin(),(c).end())
#define LB(a,x) lower_bound((a).begin(), (a).end(), x) - (a).begin()
#define UB(a,x) upper_bound((a).begin(), (a).end(), x) - (a).begin()
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,a,b) for(int i=(a)-1;i>=(b);--i)
#define RREP(i,n) RFOR(i,n,0)
#define en "\n"
constexpr double EPS = 1e-9;
constexpr double PI = 3.141592653589793238462643383279;
constexpr int INF = 2147483647;
constexpr long long LINF = 1LL<<60;
constexpr long long MOD = 1000000007; // 998244353
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
ll dp[1<<16], score[1<<16];
ll a[16][16];
ll rec(int S){
if(dp[S] != -1) return dp[S];
if(S == 0) return dp[S] = 0;
ll ret = score[S];
for(int T=S; T>0; T=T-1&S){
if(S==T) continue;
chmax(ret, rec(T) + rec(S^T));
}
return dp[S] = ret;
}
int main(void){
int N; cin >> N; REP(i,1<<N) dp[i] = -1;
REP(i,N)REP(j,N) cin >> a[i][j];
REP(S,1<<N){
REP(i,N)FOR(j,i+1,N) if(S>>i & S>>j & 1) score[S] += a[i][j];
}
ll ans = rec((1<<N)-1);
cout << ans << en;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#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 pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
const int mod = 1e9 + 7;
const int maxn = 100005;
ll val[1<<16];
ll dp[1<<16];
ll solve(int mask) {
if (~dp[mask]) {
return dp[mask];
}
ll mx = -1e18;
int low = mask & (mask);
for (int s = mask ; s; s = (s - 1) & mask) {
if (!(s & low))continue;
mx = max(mx, solve(mask ^ s) + val[s]);
}
return dp[mask] = mx;
}
void go() {
int n;
cin >> n;
f(n) {
fr(j,0,n) {
int x;
cin >> x;
if (i <= j)continue;
for (int k = 0 ; k < (1<<n) ; k++) {
if ((k & (1<< i)) && (k & (1<<j))) {
val[k] += x;
}
}
}
}
memset(dp, -1, sizeof(dp));
dp[0] = 0;
cout << solve((1 << n) - 1) << '\n';
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int c = 0;
int t;
if (!c) {
t = 1;
}
else {
cin >> t;
}
while (t--) {
go();
}
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll powll(ll b, int e) {
ll result = 1;
while (e) {
if (e & 1) {
result *= b;
}
b *= b;
e >>= 1;
}
return result;
}
bool is_palindrome(const string &s) {
int N = s.size();
int i = 0;
int j = N - 1;
while (i < j) {
if (s[i++] != s[j--]) {
return false;
}
}
return true;
}
ll count_palindromes(string s, bool is_inner) {
int L = s.size();
if (L == 0) {
return 1;
}
if (L == 1) {
int n = stoi(s);
if (is_inner) {
return n + 1;
} else {
return n;
}
}
string t = s.substr(1, L - 2);
int a = stoi(s.substr(0, 1));
int b = stoi(s.substr(L - 1, 1));
ll result = 0;
if (!is_inner) {
for (int k = 1; k < L; ++k) {
result += 9 * powll(10, (k - 1) / 2);
}
}
if (is_inner) {
result += a * powll(10, (L - 1) / 2);
} else {
result += (a - 1) * powll(10, (L - 1) / 2);
}
if (is_inner || a > 0) {
result += count_palindromes(t, true);
if (a > b) {
if (is_palindrome(t)) {
--result;
}
}
}
return result;
}
ll count_palindromes(ll n) {
if (n) {
return count_palindromes(to_string(n), false);
} else {
return 0;
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B;
cin >> A >> B;
int result = count_palindromes(B) - count_palindromes(A - 1);
cout << result << endl;
return 0;
} | //Author- Vaibhav Singh
#include<bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_multiset tree<long long , null_type,less_equal<long long >, rb_tree_tag,tree_order_statistics_node_update>
#define ordered_set tree<long long , null_type,less<long long >, rb_tree_tag,tree_order_statistics_node_update>
*/
using namespace std;
#define ll long long int
#define YES cout<<"YES"<<"\n";
#define NO cout<<"NO"<<"\n";
#define ld long double
#define yes cout<<"yes"<<"\n";
#define no cout<<"no"<<"\n";
#define No cout<<"No"<<"\n";
#define Yes cout<<"Yes"<<"\n";
#define f(i,a) for(i=0;i<a;i++)
#define fo(i,a) for(i=1;i<=a;i++)
#define fa(i,a) for(auto i:a)
#define r(i,a) for(auto i=a.rbegin();i!=a.rend();i++)
#define en cout<<"\n";
#define ull unsigned long long int
#define o(x) cout<<x<<"\n";
#define o1(x) cout<<x<<" ";
#define pb push_back
#define F first
#define in insert
#define mp make_pair
#define S second
#define pre(n) cout<<fixed<<setprecision(n);
#define gcd(a,b) __gcd(a,b)
#define bs binary_search
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
#define test ll t;cin>>t;while(t-->0)
const ll Mod = 998244353;
#define mod 1000000007
#define pi 3.14159265358979323846
#define all(x) x.begin(),x.end()
#define re return 0;
// *#######################################################################################*
/*
bool isp(ll n)
{
ll i;
for(i=2;i*i<=n;i++)
{
if(n%i==0)
{
return false;
}
}
}
*/
ll powerm(ll x, unsigned ll y, ll p)
{
ll res = 1;
x = x % p;
if (x == 0) return 0;
while (y > 0)
{
if (y & 1)
res = (res*x) % p;
y = y>>1; // y = y/2
x = (x*x) % p;
}
return res;
}
long long lcm(long long a, long long b){//?????????
return a * b / gcd(a, b);
}
/*
ll po(ll z,ll z1)
{
ll rer=0;
rer= ((z*(z-1))/2+(z1*(z1-1))/2);
return rer;
}
*/
/*
bool sortbysec(const pair<int,int> &a,
const pair<int,int> &b)
{
return (a.second < b.second);
}
*/
/*
bool is_prime(ll n){
for(ll i = 2;i*i<=n;i++){
if(n%i == 0) return false;
}
return true;
}
*/
int inv(int a){
return powerm(a,mod-2,mod);
}
ll const N=1e5;
ll fact[N], invfact[N];
void precompute(){
fact[0] = 1;
for(int i=1;i<N;i++) fact[i] = (fact[i-1]*i)%mod;
invfact[N-1] = inv(fact[N-1])%mod;
for(int i=N-2;i>=0;i--) invfact[i] = (invfact[i+1]*(i+1))%mod;
}
ll ncr(ll n, ll r){
if(n<r) return 0;
return (((fact[n]*invfact[r])%mod)*invfact[n-r])%mod;
}
ll di(ll n)
{ ll c=0;
string s=to_string(n);
if(s[0]==s[s.size()-1]&&s[1]==s[s.size()-2])
{
c=1;
}
return c;
}
//*88888*********5555555555555555******88888888$$$$$$$$$$******!!!!!!!!!!
int main()
{
//????????
fast
ll a,b,c=0,i;
cin>>a>>b;
string s;
for(i=a;i<=b;i++)
{
c+=di(i);
}
o(c)
//?????????
re} | 1 |
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
const ll LINF=1LL<<60;
const int INF=1<<30;
vector<string> dp(10001," ");
vector<pair<int,char>> a(10);
string string_max(int i,int j){
string s = dp[i];
string t = dp[i + a[j].fs];
char c = a[j].sc;
if(s == "0"){
s = c;
}
else{
auto index = lower_bound(RALL(s),c);
s.insert(index.base(),c);
}
string ans;
// cout << "s" << s << " t " << t << endl;
// cout << (s > t) << endl;
if (t == " "){
ans = s;
}
else{
if(s.size() > t.size()){
ans = s;
}
else if(s > t){
ans = s;
}
else{
ans = t;
}
}
return ans;
}
int main(){
int n,m;cin>>n>>m;
a.resize(m);
int match[9] = {2,5,5,4,5,6,3,7,6};
for(int i = 0; i < m; i++) {
char x;cin>>x;
a[i] = mp(match[x - '0' - 1],x);
}
sort(ALL(a));
// for(int i = 0; i < m; i++) {
// cout << a[i].fs << endl;
// }
dp[0] = "0";
for(int i = 0; i < n; i++) {
for(int j = 0; j < m; j++) {
if(dp[i] != " " && i + a[j].fs <= n){
dp[i + a[j].fs] = string_max(i,j);
// cout << "i " << i << " j " << j << endl;
}
// for(int i = 0; i <= n; i++) {
// cout << dp[i] << " ";
// }
// cout << endl;
}
}
// for(int i = 0; i <= n; i++) {
// cout << dp[n] << endl;
// }
cout << dp[n] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define MAX 2000000
#define MOD 1000000007
int main(){
int N,M;
cin>>N>>M;
vector<int> A(M);
for(int i=0;i<M;i++){
cin>>A.at(i);
}
sort(A.begin(),A.end());
reverse(A.begin(),A.end());
int match[9]={2,5,5,4,5,6,3,7,6};
vector<int> dp(N+1,-10000000);
dp.at(0)=0;
for(int i=1;i<=N;i++){
for(int j=0;j<M;j++){
if(i-match[A.at(j)-1]<0){
continue;
}
dp.at(i)=max(dp.at(i),dp.at(i-match[A.at(j)-1])+1);
}
}
int i=N;
while(i>0){
for(int j=0;j<M;j++){
if(i-match[A.at(j)-1]<0){
continue;
}
if(dp.at(i-match[A.at(j)-1])==dp.at(i)-1){
cout<<A.at(j);
i=i-match[A.at(j)-1];
break;
}
}
}
cout<<endl;
}
| 1 |
#include<iostream>
using namespace std;
int main(){
int x, y, z;
cin >> x >> y >> z;
swap(x, y);
swap(x, z);
cout << x << " " << y << " " << z;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 220000;
vector<int> con[N];
int root[N];
inline int find_root(int u) {
if (u == root[u]) return root[u];
return root[u] = find_root(root[u]);
}
int vis[N];
vector<int> cur;
void dfs(int u) {
vis[u] = 1;
cur.push_back(u);
for (int v : con[u]) if (!vis[v]) dfs(v);
}
int cnt[N];
int ans[N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int n, m, k; cin >> n >> m >> k;
for (int i = 1; i <= n; i++) root[i] = i;
while (m--) {
int u, v; cin >> u >> v;
int a = find_root(u), b = find_root(v);
if (a == b) continue;
root[a] = b;
}
while (k--) {
int u, v; cin >> u >> v;
con[u].push_back(v), con[v].push_back(u);
}
for (int i = 1; i <= n; i++) if (!vis[i]) {
cur.clear();
dfs(i);
for (auto u : cur) cnt[find_root(u)] = 0;
for (auto u : cur) cnt[find_root(u)]++;
for (auto u : cur) ans[u] = cnt[find_root(u)];
}
for (int i = 1; i <= n; i++) cout << ans[i] << " \n"[i == n];
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define INF 1000000007
int main()
{
string s1,s2,s3;
cin>>s1>>s2>>s3;
ll a = 0,b = 0,c = 0;
string ch = "a";
while(1)
{
if(ch == "a")
{
if(s1.size()>a)
{
ch = s1[a];
a++;
}
else
{
cout<<"A"<<endl;
return 0;
}
}
if(ch == "b")
{
if(s2.size()>b)
{
ch = s2[b];
b++;
}
else
{
cout<<"B"<<endl;
return 0;
}
}
if(ch == "c")
{
if(s3.size()>c)
{
ch = s3[c];
c++;
}
else
{
cout<<"C"<<endl;
return 0;
}
}
}
}
| #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
//#pragma warning(disable : 4996)
//#include"atcoder/all"
#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif
#include <limits.h>
#include <math.h>
#include <time.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
//using namespace atcoder;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v, n) reverse(v, v + n);
#define VREVERSE(v) reverse(v.begin(), v.end())
#define ll long long
#define print(x) cout << (x) << endl
#define pe(x) cout << (x) << " "
#define DEBUG(x) cout << #x << ": " << x << endl
#define lb(v, n) lower_bound(v.begin(), v.end(), (n))
#define ub(v, n) upper_bound(v.begin(), v.end(), (n))
#define int long long
//#define double long double
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i, v.size()) cout << v[i] << " \n"[i==(int)v.size()-1]
template <typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }
template <typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
std::random_device rd;
std::mt19937 mt(rd());
constexpr ll MOD = 1e9 + 7;
constexpr int MAX = 500050;
const double pi = acos(-1);
constexpr double EPS = 1e-8;
constexpr ll LINF = 1e18 + 1;
constexpr int INF = 1e9 + 1;
void solve() {
int A, B, C, D; cin >> A >> B >> C >> D;
int K; cin >> K;
int t1 = A * 60 + B;
int t2 = C * 60 + D;
int d = t2 - t1;
print(d - K);
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
//int q;
//cin >> q;
//while (q--)
solve();
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " << var << endl
const ll mod = 1000000007;
vector<int> to[500000];
int tab[1005][1005];
int toID(int i, int j) {
if (i>j) swap(i, j);
return tab[i][j];
}
int dp[500000];
bool used[500000];
bool calculated[500000];
int dfs(int x) {
if (used[x]) {
if (!calculated[x]) return -1;
return dp[x];
}
used[x] = true;
int now = 1;
for (int e: to[x]) {
int res = dfs(e);
if (res<0) return -1;
now = max(res+1, now);
}
dp[x] = now;
calculated[x] = true;
return dp[x];
}
int main(){
int n;
cin >> n;
vector<vector<int>> a(n, vector<int>(n-1));
rep(i, n) rep(j, n-1) {
cin >> a[i][j];
a[i][j]--;
}
int id = 0;
rep(i, n) rep(j, n) {
if (i<j) tab[i][j] = id++;
}
rep(i, n) {
rep(j, n-1) {
a[i][j] = toID(i, a[i][j]);
}
rep(j, n-2) {
to[a[i][j]].push_back(a[i][j+1]);
}
}
int ans = 0;
rep(i, id) {
int res = dfs(i);
ans = max(ans, res);
if (res==-1) {
cout << "-1" << endl;
return 0;
}
}
cout << ans << endl;
return 0;
}
| #include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
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 pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int 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] = {1,-1,0,0,1,-1,1,-1};
ll dx[8] = {0,0,1,-1,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 T> inline void print(T &a){
rep(i,a.size()) cout << a[i] << " ";
cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
cout << a << " " << b << " " << c << "\n";
}
const int mod = 1e9 + 7;
//const int mod = 998244353;
int main(){
int n; cin >> n;
vector<vector<int>> a(n,vector<int>(n));
vector<int> now(n,0);
rep(i,n) rep(j,n-1) cin >> a[i][j], a[i][j]--;
int total = n * (n-1) / 2;
int ans = 0;
queue<int> q;
set<int> se;
rep(i,n){
if(a[a[i][0]][0] == i){
if(se.find(i) == se.end() && se.find(a[i][0]) == se.end()){
q.push(i);
se.insert(i); se.insert(a[i][0]);
}
}
}
while(total > 0){
se.clear();
int m = q.size();
total -= m;
vector<int> wait;
rep(j,m){
int u = q.front(); q.pop();
int v = a[u][now[u]];
wait.push_back(u);
wait.push_back(v);
now[u]++;
now[v]++;
}
for(auto u : wait){
if(se.find(u) != se.end()) continue;
if(now[u] == n-1) continue;
int v = a[u][now[u]];
if(se.find(v) != se.end()) continue;
if(now[v] == n-1) continue;
if(a[v][now[v]] != u) continue;
q.push(u);
se.insert(u);
se.insert(v);
}
if(!m){
puts("-1");
return 0;
}
ans++;
}
cout << ans << "\n";
} | 1 |
#include <stdio.h>
#include <iostream>
using namespace std;
int main() {
int n;
int kaisu;
int team[100][3] = {0};
int teamn[100];
int a,b,c,d;
int kari;
int juni = 1;
int counter = 1;
cin >> n;
kaisu = n * (n - 1) / 2;
for (int i = 0; i < n; i++) {
team[i][0] = i;
}
for (int i = 0; i < kaisu; i++) {
cin >> a >> b >> c >> d;
if (c > d) {
team[a-1][1] += 3;
} else if ( c < d) {
team[b-1][1] += 3;
} else {
team[a-1][1] += 1;
team[b-1][1] += 1;
}
}
for (int i = n-1; i > 0; i--) {
for (int j = 0; j < i; j++) {
if (team[j][1] < team[j+1][1]) {
for (int k = 0; k < 2; k++) {
kari = team[j][k];
team[j][k] = team[j+1][k];
team[j+1][k] = kari;
}
}
}
}
for (int i = 0; i < n; i++) {
team[i][2] = juni;
if (team[i][1] > team[i+1][1]) {
juni += counter;
counter = 1;
} else {
counter++;
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (team[j][0] == i) {
cout << team[j][2] << endl;
break;
}
}
}
return 0;
} | #include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
typedef pair<int,int> P;
const int MAX = 120;
int maze[MAX][MAX];
bool come[MAX][MAX];
P s,g;
int W,H,c;
int dx[4] = {1,0,0,-1};
int dy[4] = {0,1,-1,0};
void init(){
memset(come,false,sizeof(come));
memset(maze,0,sizeof(maze));
}
void input_B(){
int n;
cin >> n;
while(n--){
int c,d,x,y;
cin >> c >> d >> x >> y;
if(d){
for(int i = y; i < y+4; i++)
for(int j = x; j < x+2; j++)
maze[i][j] = c;
}else{
for(int i = y; i < y+2; i++)
for(int j = x; j < x+4; j++)
maze[i][j] = c;
}
}
}
void solve(P p){
if(come[p.second][p.first] == false){
come[p.second][p.first] = true;
for(int i = 0; i < 4; i++)
if(0 < p.first+dx[i] && p.first+dx[i] <= W &&
0 < p.second+dy[i] && p.second+dy[i] <= H &&
maze[p.second+dy[i]][p.first+dx[i]] == c) solve(P(p.first+dx[i],p.second+dy[i]));
}
}
void print(){
for(int i = 1; i < H; i++){
for(int j = 1; j < W; j++)// cout << come[i][j];
cout << maze[i][j];
cout << endl;
}
}
int main(){
while(cin >> W >> H && W+H){
init();
cin >> s.first >> s.second;
cin >> g.first >> g.second;
input_B();
c = maze[s.second][s.first];
solve(s);
//print();
if(come[g.second][g.first] && c) cout << "OK" << endl;
else cout << "NG" << endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define FILL(a,n,x); REP(i,(n)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[i]; }
#define FILL2(a,n,m,x); REP(i,(n)){ REP(j,(m)){(a)[i][j]=(x);} }
#define CINA2(a,n,m); REP(i,(n)){ REP(j,(m)){cin >> (a)[i][j];} }
#define Liny "Yes\n"
#define Linn "No\n"
#define LINY "YES\n"
#define LINN "NO\n"
//cout << setfill('0') << right << setw(4) << 12; // "0012"
int keta(ll x){ if(x<10){return 1;} else{return keta(x/10) + 1;}}
int keta_wa(ll x){ if(x<10){return x;} else{return keta_wa(x/10) + x%10;} }
int ctoi(char c){ return ( (c>='0' && c<='9')? c - '0': 0 );}
int __stoi(string s){ return atoi(s.c_str()); }
ll sum(ll a[],ll N){ return accumulate(a,a+N,0LL);}
ll gcd(ll a,ll b){if(a<b)swap(a,b); return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){if(a<b){swap(a,b);} return a/gcd(a,b)*b;}
template<class T> void chmax(T& a, T b){ if(a<b){a=b;} }
template<class T> void chmin(T& a, T b){ if(a>b){a=b;} }
template<class T> bool isIn(T a,vector<T> v){ for(T x:v){ if(a==x){return true;}} return false;}
string strReplace(string s,string target, string replacement){
if (!target.empty()) {
std::string::size_type pos = 0;
while ((pos = s.find(target, pos)) != std::string::npos) {
s.replace(pos, target.length(), replacement);
pos += replacement.length();
}
}
return s;
}
const ll MOD = 1e9+7;
#define pii pair<int,int>
#define pll pair<ll,ll>
#define MP make_pair
bool DEBUG = 0;
template<class T> void dprint(T s){
if(DEBUG){ cout << s << "\n"; }
}
int main(int argc,char* argv[]){
if(argc>1 && argv[1][0]=='D'){ DEBUG=1;}
dprint("start");
ll N; cin>>N;
ll a[N]; CINA(a,N); reverse(a,a+N);
vector<ll> v;
v.push_back(a[0]);
for(int i=1;i<N;++i){
int m = v.size();
if(a[i]>=v[m-1]){
v.push_back(a[i]);
}else{
auto x = upper_bound(ALL(v),a[i]);
while(*x==a[i]){
++x;
}
*x = a[i];
}
}
if(DEBUG){ for(auto x:v){ cout << x << " ";} cout << "\n"; }
cout << v.size() << "\n";
} | // ░░░░░░░░( •̪●)░░░░░░░░░░░░░░░░░░░░░░░░
// ░░░░░░███████ ]▄▄▄▄▄▄▄▄▃░░░▃░░░░ ▃░
// ▂▄▅█████████▅▄▃▂░░░░░░░░░░░░░░░░░
// [███████████████████].░░░░░░░░░░░░░░
// ◥⊙▲⊙▲⊙▲⊙▲⊙▲⊙▲⊙◤...░░░░░░░░░░░░
//PointBlank's code (⌐■_■)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
ll power(ll x, ll y);
#define repp(I, A, B) for(int I = A; I <= B; I++)
#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 pb emplace_back
#define ff first
#define ss second
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define LB lower_bound
#define UB upper_bound
#define MP make_pair
#define mem(A, B) memset(A, B, sizeof(A));
#define mem0(A) memset(A, 0, sizeof(A));
#define quickio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define debug(this) cerr<<"> "<<#this<<" : "<<this<<"\n"
#define bitcount(n) __builtin_popcountll(n)
#define in_edges(M) repp(I, 1, M){int A, B; cin >> A >> B; v[A].pb(B), v[B].pb(A);}
#define in_edges2(M) repp(I, 1, M){int A, B; cin >> A >> B; v[A].pb(B);}
#define in_edges3(M) repp(I, 1, M){int A, B, C; cin >> A >> B >> C; v[A].pb(B, C), v[B].pb(A, C);}
#define endl "\n"
const ll MOD = 1000000007;
int main() //PointBlank's code ¯\_(ツ)_/¯
{
int n;
cin >> n;
multiset<int> st;
int res = 0;
int inp;
rep(i, 0, n){
cin >> inp;
auto it = st.UB(-inp);
if(it == st.end()){
res++;
st.insert(-inp);
}else{
st.erase(it);
st.insert(-inp);
}
}
cout << res;
}
ll power(ll x, ll y)
{
ll res = 1; x %= MOD;
while(y > 0){if(y & 1) res = (res*x) % MOD; y = y>>1, x = (x*x) % MOD;}
return res;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
vector<int> to[MAXN];
vector<int> d1(MAXN, -1), d2(MAXN, -1);
void dfs(int u, int path, vector<int> &d)
{
if (d[u] != -1)
{
return;
}
d[u] = path;
for (auto v : to[u])
{
dfs(v, path + 1, d);
}
}
int main()
{
int N, u, v, a, b;
cin >> N >> u >> v;
u--, v--;
for (int i = 0; i < N - 1; i++)
{
cin >> a >> b;
a--, b--;
to[a].push_back(b);
to[b].push_back(a);
}
dfs(u, 0, d1);
dfs(v, 0, d2);
int ans = 0, same = (1 << 30);
for (int i = 0; i < N; i++)
{
if (d2[i] < d1[i])
continue;
if (d2[i] == d1[i])
{
same = min(d2[i], same);
}
else
{
ans = max(ans, d2[i] - 1);
}
}
if (ans == 0 && same != (1 << 30))
{
cout << same << endl;
}
else
{
cout << ans << endl;
}
}
| #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
#define int long long
vector<int> G[100010];
int color[100010];
// 頂点を1と-1で塗っていく
bool dfs(int v, int c) {
color[v] = c;
for (int i = 0; i < G[v].size(); i++) {
// 隣接している頂点が同じ色ならfalse
if (color[G[v][i]] == c) return false;
// 隣接している頂点がまだ塗られていないなら-cで塗る
if (color[G[v][i]] == 0 && !dfs(G[v][i], -c)) return false;
}
// すべての頂点を塗れたらtrue
return true;
}
signed main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
rep(i, M) {
int s, t;
cin >> s >> t;
s--; t--;
G[s].push_back(t);
G[t].push_back(s);
}
if(dfs(0, 1)) {
int k1 = 0, k2 = 0;
rep(i, 100010) {
if (color[i] == 1) k1++;
else if (color[i] == -1) k2++;
}
cout << k1 * k2 - M << endl;
} else {
cout << N * (N - 1) / 2 - M << endl;
}
return 0;
}
| 0 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
using namespace std;
int main(){
int a,b,c,d,e,k;
cin>>a>>b>>c>>d>>e>>k;
if(e-a<=k)cout<<"Yay!"<<endl;
else cout<<":("<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
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 gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
int main() {
ll N,M,X,Y;
cin >>N>>M>>X>>Y;
ll XZ=X;
ll YZ=Y;
rep(i,N){
ll x;
cin>>x;
chmax(XZ,x);
}
rep(i,M){
ll y;
cin>>y;
chmin(YZ,y);
}
if(XZ<YZ){
cout<<"No War"<<endl;
}else{
cout<<"War"<<endl;
}
return 0;
} | 0 |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2,tune=native")
#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("trapv")
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pi = pair<ll, ll>;
const int mod = 1000000007;
const ll inf = 1e18;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
using ld = double;
using vec = complex<ld>;
#define x real()
#define y imag()
ld dot(vec a, vec b) {
return (conj(a)*b).x;
}
ld cross(vec a, vec b) {
return (conj(a)*b).y;
}
istream& operator>>(istream& in, vec &v) {
ld a, b;
in >> a >> b;
v = vec(a, b);
return in;
}
bool cw(vector<pair<vec, int>> &hull, vec &v) {
int n = hull.size();
if(n < 2) return true;
return cross(hull[n-1].first-hull[n-2].first, v-hull[n-1].first)<=0;
}
ld ans[100100];
int main() { //DINIC ORZ
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<pair<vec, int>> v;
v.resize(n);
int _T = 0;
for(auto &i : v) {
cin >> i.first;
i.second = ++_T;
}
for(auto &i : v) {
if(i.first.x < v.back().first.x || (i.first.x == v.back().first.x&&i.first.y<v.back().first.y))
swap(v.back(), i);
}
vector<pair<vec, int>> hull {v.back()};
v.pop_back();
sort(all(v), [&](const pair<vec, int> &a, const pair<vec, int> &b) {
if(fabs(cross(a.first-hull[0].first, b.first-hull[0].first))<1e-9)
return abs(a.first-hull[0].first) < abs(b.first-hull[0].first);
return cross(a.first-hull[0].first, b.first-hull[0].first) < 0;
});
for(auto i : v) {
while(!cw(hull, i.first)) hull.pop_back();
hull.pb(i);
}
for(int i = 0; i < hull.size(); i++) {
vec l = (i?hull[i-1]:hull.back()).first;
vec r = (i+1<hull.size()?hull[i+1]:hull[0]).first;
// cout << hull[i].first << "\n";
// cout << hull[i].first << " " << l << " " << r << "\n";
l-=hull[i].first, r-=hull[i].first;
ld angle = M_PI - acos(((dot(l, r)/abs(l))/abs(r)));
// cout << hull[i].first << " " << l << " " << r << "\n";
// cout << dot(l, r) << "\n";
ans[hull[i].second] = angle/(2*M_PI);
}
cout << fixed << setprecision(15);
for(int i = 1; i <=n; i++) cout << ans[i] << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
string s;
vector<pair<ll,ll> > p;
for(ll i=0; i<n; i++) {
cin >> s;
ll x=0, d=0;
for(ll j=0; j<(ll)s.size(); j++) {
if (s[j]=='(') x++;
if (s[j]==')') {
x--;
d = min(d, x);
}
}
if(x<0) d-=x;
p.push_back(make_pair(-d,x));
}
sort(p.begin(), p.end());
ll h=0;
for(ll i=0; i<n; i++) {
if(p[i].second>=0) {
if(h-p[i].first<0) {
cout << "No" << '\n';
return 0;
}
h += p[i].second;
}
}
for(ll i=n-1; i>=0; i--) {
if(p[i].second<0) {
if(h-p[i].first+p[i].second<0) {
cout << "No" << '\n';
return 0;
}
h += p[i].second;
}
}
if(h!=0) {
cout << "No" << '\n';
return 0;
}
cout << "Yes" << '\n';
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//マクロ
//forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
//Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#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--)
//xにはvectorなどのコンテナ
#define ALL(x) (x).begin(),(x).end() //sortなどの引数を省略したい
#define SIZE(x) ((ll)(x).size()) //sizeをsize_tからllに直しておく
#define MAX(x) *max_element(ALL(x)) //最大値を求める
#define MIN(x) *min_element(ALL(x)) //最小値を求める
//定数
#define INF 1000000000000 //10^12:極めて大きい値,∞
#define MOD 1000000007 //10^9+7:合同式の法
#define MAXR 100000 //10^5:配列の最大のrange(素数列挙などで使用)
#define PI 3.14159265359 //πの値
//略記
#define PB push_back //vectorヘの挿入
#define MP make_pair //pairのコンストラクタ
#define F first //pairの一つ目の要素
#define S second //pairの二つ目の要素
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string A, B; cin >> A >> B;
cout << B << A;
} |
#include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define pb push_back
#define mp make_pair
#define s second
#define f first
#define mod 998244353
#define sz(v) (int)(v).size()
#define pii pair<int, int>
#define vi vector<int>
#define ll long long
#define fastio ios_base::sync_with_stdio(false);cin.tie(0)
ll add(ll a,ll b)
{
a%=M;
b%=M;
ll p = (a+b)%M;
return (p+M)%M;
}
ll mul(ll a,ll b)
{
a%=M;
b%=M;
ll p = (a*b)%M;
return (p+M)%M;
}
int main()
{
fastio;
ll i,j,n,ans=0;
cin>>n;
string str;
cin>>str;
ll c1=0,c2=0,c3=0;
for(i=0;i<n;i++)
{
if(str[i]=='R')
c1++;
else if(str[i]=='G')
c2++;
else
c3++;
}
ans = c1*c2*c3;
for(i=0;i<n;i++)
{
for(j=1;(j<=i)&&(i+j<n);j++)
{
if((str[i]!=str[i-j])&&(str[i]!=str[i+j])&&(str[i-j]!=str[i+j]))
ans--;
}
}
cout<<ans<<endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}
template<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>=b)return 0; a=b; return 1;}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
int n;
cin>>n;
int ans = -1;
int l=1,r=n-1;
cout << 0 << endl;
string s;
cin>>s;
string fi = s;
if(s == "Vacant") return 0;
cout << n-1 << endl;
cin>>s;
string la = s;
if(s=="Vacant")return 0;
while(true){
int mid = (l+r)/2;
cout << mid << endl;
cin >> s;
if(s == "Vacant")return 0;
if(mid%2 == 0){
if(s == fi) l = mid;
else r = mid;
}
else{
if(s == la) l = mid;
else r = mid;
}
}
} | /* 実行時間1s制限の場合10^6 1,000,000 : 余裕をもって間に合う10^7
10,000,000 : おそらく間に合う10^8 100,000,000 : 非常にシンプルな処理
でないと厳しい
*/
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long long ll; // long longはデータモデル(LLP64, LP64, ...)によらず64bit.
ll gcd(ll a, ll b) {return b ? gcd(b, a%b) : a;} // Greatest Common Divisor ユークリッドの互除法（aが長辺）
vector<pair<ll,int>> factorize(ll n) { // a,bの公約数 = GCD(a, b)の約数
vector<pair<ll,int>> res;
for (ll i = 2; i*i <= n; i++) { // √nまで探せばよい
if (n%i) continue;
res.emplace_back(i, 0); // 割り切れたら
while (n%i == 0) {
n /= i;
res.back().second++;
}
}
if (n != 1) res.emplace_back(n, 1); // この時点で1でなかったら、残りは素数.
return res;
}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;} // Least Commont Multiple オーバーフローしないように先に割る
ll ceil(ll a, ll b) {return (a+b-1)/b;}
const ll INF = LONG_MAX;
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 argc, char* argv[])
{
#ifdef LOCAL
// 以降 cin の入力元が 'xxx.txt' になる
// std::ifstream in(argv[1]);
//std::cin.rdbuf(in.rdbuf());
//std::ifstream in(string(argv[0]) + ".txt");
std::ifstream in("in.txt");
std::cin.rdbuf(in.rdbuf());
#endif
int n;
cin >> n;
int tmp = sqrt(n);
// cout << tmp << endl;
ll ans = 0;
for (int i = tmp; ; tmp++) {
ll a = tmp * tmp;
if (a > n) break;
ans = a;
}
cout << ans;
return 0;
}
/*
- 1e9 : 10^9
- container一般
- 合計
accumulate(a.begin(), a.end(), 0LL) 0LLはオーバーフロー用
- vector
vector<int> A(N, 0); // 0で初期化(省略可)
vector<vector<int>> vec(n_rows, vector<int>(n_cols, value)); // 2次元配列初期化
- loop
for (int i = 0; i < A.size(); i++) {}
for (int elem : A) {}
- sort
std::sort(v.begin(), v.end()); // 昇順
std::sort(v.begin(), v.end(), std::greater<int>()); //降順
- vector<vector<int>> cnt(h, vector<int>(w))
- sort(struct)
struct st_t {
string name;
int p;
bool operator<(const st_t& another) const {
if (name == another.name)
{
return p > another.p;
}
return name < another.name;
}
};
vector<st_t> st(n);
sort(st.begin(), st.end());
- pair
- pairのソートの定義 : firstが優先的に比較。同じだったらsecond。
- pair<pair<string,int>,int> p[110];
std::sort(p,p+a);
こうすると、first.first -> first.second -> secondの順にソートされる
- sort
- sort(a.begin(), cb.end(), greater<pair<int, int>>());
- map
- for (auto x : map) {} // x.first:key x.second:value.
- priority_queue<int> q;
- q.top()に最大値が入っている
- string
- loop
for (char& c : s) {}
*/
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
typedef long long ll;
#define all(x) (x).begin(),(x).end()
int main(){
ll n; cin>>n;
vector<ll> v(5);
rep(i,5) cin>>v[i];
sort(all(v));
cout<<(n+v[0]-1)/v[0]+4<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
int64_t minimum;
for(int i = 0; i < 5; i++) {
if(i == 0) {
cin >> minimum;
}
else {
int64_t a;
cin >> a;
minimum = min(minimum, a);
}
}
cout << (N - 1) / minimum + 5 << endl;
} | 1 |
#include <iostream>
#include <algorithm>
#include <iomanip>
double avg(int n) {
return (n+1)/2.0;
}
int main() {
int n, k, p[2000010];
std::cin >> n >> k;
for (int i = 0; i < n; ++i)
std::cin >> p[i];
double sum = 0;
for (int i = 0; i < k; ++i) {
sum += avg(p[i]);
}
double ans = sum;
for (int i = k; i < n; ++i) {
sum -= avg(p[i-k]);
sum += avg(p[i]);
ans = std::max(ans, sum);
}
std::cout << std::setprecision(10) << std::fixed << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,K; cin>>N>>K;
vector<int>A(N);
vector<long double>sum(N+K);
for(int i=0;i<N;i++){
cin>>A[i];
sum[i]+=A[i]+1;
sum[i+K]-=A[i]+1;
}
for(int i=1;i<N+K;i++)sum[i]+=sum[i-1];
sort(sum.begin(),sum.end());
cout<<fixed<<setprecision(10)<<sum[N+K-1]/2<<endl;
} | 1 |
#include <stdio.h>
#include <string.h>
#include <string>
#include <iostream>
#include <vector>
#include <sstream>
#include <memory>
#include <iomanip>
std::vector<int> parse_line(std::string const& line) {
using namespace std;
vector<int> result;
istringstream s(line);
string element;
while (getline(s, element, ' ')) {
stringstream buf;
int value = 0;
buf << element;
buf >> value;
result.push_back(value);
}
return std::move(result);
}
int main(int argc, char* argv[])
{
using namespace std;
while (true) {
string line;
getline(std::cin, line);
auto elements = parse_line(line);
auto length = elements[0];
if (length == 0) break;
vector<int> total(length + 1);
size_t width = length + 1;
for (size_t i = 0; i < length; ++i) {
getline(cin, line);
elements = parse_line(line);
int sum = 0;
for (size_t n = 0; n < length; ++n) {
int val = elements[n];
sum += val;
total[n] += val;
cout << setw(5) << val;
}
cout << setw(5) << sum << endl;
total[length] += sum;
}
for (size_t i = 0; i < width; ++i) {
cout << setw(5) << total[i];
}
cout << endl;
}
return 0;
} | #include <iostream>
#include <cstdio>
#include <string>
using namespace std;
int main()
{
int data[10][10];
int n;
while (cin >> n, n) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> data[i][j];
}
}
int ans;
for (int i = 0; i < n; i++) {
ans = 0;
for (int j = 0; j < n; j++) {
printf("%5d", data[i][j]);
ans += data[i][j];
}
printf("%5d\n", ans);
}
int s = 0;
for (int i = 0; i < n; i++) {
int sum = 0;
for (int j = 0; j < n; j++) {
sum += data[j][i];
}
printf("%5d", sum);
s += sum;
}
printf("%5d\n", s);
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m,mx=0,mn=999999;
cin>>n>>m;
vector<pair<int,int>> v(m);
for(int i=0;i<m;i++){
cin>>v[i].first>>v[i].second;
mx=max(v[i].first,mx);
mn=min(v[i].second,mn);
}
cout<<max(mn-mx+1,0);
return 0;
}
| #include<bits/stdc++.h>
using ll = long long;
using namespace std;
const ll INF = 10000000000000000;
const ll mod = 1000000007;
//printf("%.10f\n", n);
ll n, W; ll w[345678], v[345678], dp1[5000][23456], dp2[5000][23456];
void solve1() {
for (int i = 0; i < n; i++) {
for (int j = 0; j <= W; j++) {
if (i == 0) {
if (j >= w[i]) { dp1[i][j] = v[i]; }
continue;
}
if (j < w[i]) {
dp1[i][j] = dp1[i - 1][j];
}
else {
dp1[i][j] = max(dp1[i - 1][j], dp1[i - 1][j - w[i]] + v[i]);
}
}
}
return;
}
void solve2() {
for (int i = n - 1; i >= 0; i--) {
for (int j = 0; j <= W; j++) {
if (j < w[i]) {
dp2[i][j] = dp2[i + 1][j];
}
else {
dp2[i][j] = max(dp2[i + 1][j], dp2[i + 1][j - w[i]] + v[i]);
}
}
}
return;
}
signed main() {
ll m, a = 0, b = 0, cnt = 0, ans = 0; cin >> n >> W;
for (int i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
W--; solve1(); solve2();
for (int h = 0; h < n; h++) {
if (h == 0) { ans = max(dp2[1][W] + v[0], ans); continue; }
if (h == n - 1) { ans = max(ans, dp1[n - 2][W] + v[n - 1]); continue; }
for (int i = 0; i <= W; i++) {
ans = max(ans, dp1[h - 1][i] + dp2[h + 1][W - i] + v[h]);
}
}
cout << ans << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const ll N=1e5+5;
ll n;
vector< pair<ll,ll> > adj[N];
vector< pair< pair<ll,ll> , ll > >wt;
bool cmp( pair< pair<ll,ll> , ll > a,pair< pair<ll,ll> ,ll >b){
return a.second<b.second;
}
ll par[N],sz[N];
void init(){
for(ll i=0;i<N;i++)par[i]=i,sz[i]=1;
}
ll dsu_parent(ll node){
if(node==par[node])return node;
return par[node]=dsu_parent(par[node]);
}
void dsu_union(ll a,ll b){
a=dsu_parent(a);
b=dsu_parent(b);
if(a==b)return;
if(sz[a]<sz[b])swap(a,b);
sz[a]+=sz[b];
par[b]=a;
}
ll func(){
ll ans = 0;
for(ll i=1;i<=n;i++)for(auto &ele:adj[i])wt.push_back( { {i,ele.second} , ele.first} );
sort(wt.begin(),wt.end(),cmp);
init();
for(auto &edges:wt){
// cout<<edges.first.first<<" "<<edges.first.second<<" "<<edges.second<<endl;
ll u=edges.first.first,v=edges.first.second,w=edges.second;
if(dsu_parent(u)==dsu_parent(v))continue;
ans+=w;
dsu_union(u,v);
}
return ans;
}
int main(){
cin.tie(NULL); cout.tie(NULL);
ios_base:: sync_with_stdio(false);
cin>>n;
pair<ll,ll> x[n],y[n];
for(ll i=0;i<n;i++)cin>>x[i].first>>y[i].first,x[i].second=y[i].second=i+1;
sort(x,x+n);
sort(y,y+n);
for(ll i=1;i<n;i++){
adj[x[i].second].push_back({x[i].first-x[i-1].first , x[i-1].second});
adj[x[i-1].second].push_back({x[i].first-x[i-1].first , x[i].second});
adj[y[i].second].push_back({y[i].first-y[i-1].first , y[i-1].second});
adj[y[i-1].second].push_back({y[i].first-y[i-1].first , y[i].second});
}
cout<<func();
}
| #include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
typedef long long ll;
typedef long double ld;
const int N = (int) 1e6 + 7;
int n, sumtop;
struct T {
int top;
int mn;
};
bool cmp1(T a, T b) {
return a.mn > b.mn;
}
bool cmp2(T a, T b) {
return min(a.mn, a.top + b.mn) > min(b.mn, b.top + a.mn);
///return a.top - a.mn > b.top - b.mn;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
vector<T> a, b;
cin >> n;
for (int i = 1; i <= n; i++) {
string s;
cin >> s;
int top = 0, mn = 0;
for (auto &ch : s) {
if (ch == '(') {
top++;
} else {
top--;
}
mn = min(mn, top);
}
if (top >= 0) {
a.push_back({top, mn});
} else {
b.push_back({top, mn});
}
sumtop += top;
}
if (sumtop != 0) {
cout << "No\n";
return 0;
}
sort(a.begin(), a.end(), cmp1);
sort(b.begin(), b.end(), cmp2);
int cur = 0;
for (auto &it : a) {
if (cur + it.mn < 0) {
cout << "No\n";
return 0;
}
cur += it.top;
}
for (auto &it : b) {
if (cur + it.mn < 0) {
cout << "No\n";
return 0;
}
cur += it.top;
}
cout << "Yes\n";
return 0;
}
| 0 |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
int m,n;
while(cin>>n>>m,n){
int plz[1050]={0},total=0,cnt=1;
for(int i=0;i<n;i++){
cin>>plz[i];
}
sort(plz,plz+n);
reverse(plz,plz+n);
for(int i=0;i<n;i++){
if(cnt!=m){
total+=plz[i];
cnt++;
}
else if(cnt==m){
cnt=1;
}
}
cout<<total<<endl;
}
return 0;
} | #include <iostream>
using namespace std;
int sum,h,w,a,b;
int main(){
while(1){
cin >> h>>w;
if(!(h||w))break;
sum=h*h+w*w;
a=h+1;
while(1){
while(a*a<sum){
b=a+1;
while(a*a+b*b<=sum){
if(a*a+b*b==sum)goto END;
b++;
}
a++;
}
sum++;
a=1;
}
END:;
cout <<a <<" " <<b <<endl;
}
} | 0 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main()
{
int N; cin >> N;
ll ans = 0;
int k;
ll r = 0, g = 0, b = 0;
vector<char> S(N+1);
FOR(i,1,N+1){
cin >> S[i];
if(S[i] == 'R') r++;
if(S[i] == 'G') g++;
if(S[i] == 'B') b++;
}
ans = r * g * b;
FOR(i,1,N-1){
FOR(j,i+1,N){
k = 2 * j - i;
if(k > N) break;
if(S[i] != S[j] && S[i] != S[k] && S[k] != S[j])
ans--;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>> vec_p; //vector<pair<ll, ll>> pairs(n) ,pairs.at(i) = make_pair(i*i, i)
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int N;
string S;
cin >> N >> S;
vector<int> G;
vector<int> R;
vector<int> B;
for (int i = 0; i < N; i++)
{
if (S.at(i) == 'R')
{
R.push_back(i + 1);
}
else if (S.at(i) == 'G')
{
G.push_back(i + 1);
}
else if (S.at(i) == 'B')
{
B.push_back(i + 1);
}
}
int tmp1, tmp2, tmp3;
ll ans = 0;
for (ll i = 0; i < N; i++)
{
for (ll j = 1; i + 2 * j < N; j++)
{
if(i+2*j<N){
if(S.at(i)=='R'){
tmp1 = 1;
}
else if(S.at(i)=='G'){
tmp1 = 2;
}
else if(S.at(i)=='B'){
tmp1 = 4;
}
if (S.at(i+j) == 'R')
{
tmp2 = 1;
}
else if (S.at(i+j) == 'G')
{
tmp2 = 2;
}
else if (S.at(i+j) == 'B')
{
tmp2 = 4;
}
if (S.at(i + 2*j) == 'R')
{
tmp3 = 1;
}
else if (S.at(i + 2*j) == 'G')
{
tmp3 = 2;
}
else if (S.at(i + 2*j) == 'B')
{
tmp3 = 4;
}
if(tmp1+tmp2+tmp3==7){
ans++;
}
}
}
}
cout << R.size()*G.size()*B.size()-ans << endl;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int y,z;
cin>>y>>z;
if(y%z==0) cout<<0<<endl;
else cout<<1<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (int)1e9+7
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,a,b) for(int i=a;i>b;--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 mp make_pair
#define PI 3.1415926535897932384626433832795
#define fix(f,n) fixed<<setprecision(n)<<f
#define all(x) x.begin(),x.end()
ll powM(ll a,ll b,ll m )
{
a%=m;
ll ans=1;
while(b>0)
{
if(b&1)ans=ans*a%m;
a=a*a%m;
b>>=1;
}
return ans;
}
ll c(ll a,ll b)
{
if(a==0)return b==0?1:0;
if(b>a)return 0;
ll val=1;
ll fac=1;
for(int i=1;i<=b;i++)fac*=i;
for(int i=a;i>=a-b+1;i--)val*=i;
return val/fac;
}
ll f(ll n)
{
ll ans=1LL;
while(ans<=n)ans<<=1;
return ans;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,k;
cin>>n>>k;
ll ans=0;
if(n%k)ans=1;
cout<<ans<<"\n";
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int A,B,C,D,a;
cin>>A>>B>>C>>D;
a=min(min(min(A+C,A+D),B+C),B+D);
cout<<a<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define INF 1001001001
#define LINF 1001001001001001001
#define MOD 1000000007
#define MOD2 998244353
template<class T,class U>bool chmax(T &a, const U &b){if(a<b){a=b;return 1;}return 0;}
template<class T,class U>bool chmin(T &a, const U &b){if(b<a){a=b;return 1;}return 0;}
#define rep(i,n) for(int i=0,_i=(n);i<_i;++i)
#define rep1(i,a,b) for(int a_=(a),b_=(b),i=a_;i<b_;++i)
#define repr(i,n) for(int _i=(n),i=_i;i>0;--i)
#define db(x) cerr<<#x<<" = "<<x<<" ";
#define db2(x,y) cerr<<"("<<#x<<", "<<#y<<") = ("<<x<<", "<<y<<") ";
#define db3(x,y,z) cerr<<"("<<#x<<", "<<#y<<", "<<#z<<") = ("<<x<<", "<<y<<", "<<z<<") ";
#define ln cout<<endl;
#define all(a) (a).begin(),(a).end()
#define dig(n) to_string(n).length()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define se second
#define fi first
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> iP;
typedef pair<P,P> PP;
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);}
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int main(){
bool flag=false;
long double ans=0,d,n,m;
cin>>n>>m>>d;
if(d == 0){
ans = (m-1)/n;
}else{
ans = (m-1)*(((n-d)*2)/(n*n));
}
cout <<fixed<<setprecision(16)<<ans << endl;
//if(flag)cout << "Yes" <<endl;
//else cout << "No" <<endl;
return 0;
}
| 0 |
#include <iostream>
#include <cstring>
#include <string>
#include <cstdlib>
#include <queue>
#include <set>
#include <algorithm>
using namespace std;
const int MAXN = 100005;
const int MAXE = 200005;
const int NIL = -1;
typedef long long ll;
const ll INF = 0x3f3f3f3f3f3f3f3f;
bool vis[MAXN];
struct Edge {
int to, next, w;
Edge() { next = -1; }
} edge[MAXE];
int N;
int prenum[MAXN], parent[MAXN], lowest[MAXN], head[MAXE], timer, cnt;
void dfs(int cur, int pre)
{
prenum[cur] = lowest[cur] = timer++;
vis[cur] = true;
int next;
for (int i = head[cur]; i != NIL; i = edge[i].next)
{
next = edge[i].to;
if (!vis[next])
{
parent[next] = cur;
dfs(next, cur);
lowest[cur] = min(lowest[cur], lowest[next]);
}
else if (next != pre)
{
lowest[cur] = min(lowest[cur], prenum[next]);
}
}
}
void art_points()
{
for (int i = 0; i < N; ++i)
vis[i] = false;
timer = 1;
dfs(0, NIL);
set<int> ans;
int flag = 0; //?????????
for (int i = 1; i < N; ++i)
{
int p = parent[i];
if (p == 0)
++flag;
else if (prenum[p] <= lowest[i])
ans.insert(p);
}
if (flag > 1)
ans.insert(0);
for (set<int>::iterator it = ans.begin(); it != ans.end(); ++it)
cout << *it << endl;
}
void add(int u, int v, int w)
{
edge[cnt].to = v;
edge[cnt].w = w;
edge[cnt].next = head[u];
head[u] = cnt++;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int m, s, t;
cin >> N >> m;
memset(head, NIL, sizeof(int) * 2 * (m + 1));
cnt = 0;
for (int i = 0; i < m; ++i)
{
cin >> s >> t;
add(s, t, 0);
add(t, s, 0);
}
art_points();
return 0;
} | // https://atcoder.jp/contests/abc106/tasks/abc106_d
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
#define CEIL(a, b) ((a - 1) / b + 1)
// https://github.com/drken1215/algorithm/blob/master/DataStructure/binary_indexed_tree_2D.cpp
template <class Abel> struct BIT2D {
const Abel UNITY_SUM = 0; // to be set
vector<vector<Abel>> dat;
BIT2D(int n = 1, int m = 1) : dat(n + 1, vector<Abel>(m + 1, UNITY_SUM)) {}
void init(int n, int m) {
dat.assign(n + 1, vector<Abel>(m + 1, UNITY_SUM));
}
/* add x on the point (a, b) */
inline void add(int a, int b, Abel x) {
for (int i = a; i < (int)dat.size(); i += i & -i)
for (int j = b; j < (int)dat[0].size(); j += j & -j)
dat[i][j] = dat[i][j] + x;
}
inline Abel sum(int p, int q) {
Abel res = UNITY_SUM;
for (int i = p; i > 0; i -= i & -i)
for (int j = q; j > 0; j -= j & -j)
res = res + dat[i][j];
return res;
}
/* a1 <= x < b1, a2 <= y < b2, 1-indexd */
inline Abel sum(int a1, int a2, int b1, int b2) {
return sum(b1 - 1, b2 - 1) - sum(a1 - 1, b2 - 1) - sum(b1 - 1, a2 - 1) +
sum(a1 - 1, a2 - 1);
}
/* debug */
void print() {
for (int i = 1; i < (int)dat.size(); ++i) {
for (int j = 1; j < (int)dat[0].size(); ++j)
cout << sum(i, j, i + 1, j + 1) << ",";
cout << endl;
}
}
};
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M, Q;
cin >> N >> M >> Q;
BIT2D<int> ft(N, N);
REP(i, M) {
int l, r;
cin >> l >> r;
ft.add(l, r, 1);
}
while (Q--) {
int l, r;
cin >> l >> r;
// [l, r)の半開区間なので右側は+1する
cout << ft.sum(l, l, r + 1, r + 1) << "\n";
}
return 0;
}
| 0 |
#include <iostream>
#include <stdlib.h>
#include <string.h>
using namespace std;
int main() {
string x;
cin >> x;
for (int j = 97; j <= 122; j++) {
bool a = 0;
for (int i = 0; i < x.size(); i++) {
if (char(j) == x[i]) {
a = 1;
continue;
}
}
if (a == 0) {
cout << char(j);
return 0;
}
}
cout << "None";
return 0;
} | #include<iostream>
#include<vector>
using namespace std;
string in;
vector<string> V;
string change(string in){
for(int i = 0; i < in.length(); i++){
if(in[i] != 'a') in[i]--;
else in[i] = 'z';
}
return in;
}
string solve(){
int status = 0;
while(1){
for(int i = 0; i < V.size(); i++){
string str = V[i];
if(str != "." && str != " ") V[i] = change(str);
if(V[i] == "the" || V[i] == "this" || V[i] == "that") status = 1;
}
if(status)break;
}
string out;
for(int i = 0; i < V.size(); i++){
out += V[i];
}
return out;
}
int main(){
while(getline(cin,in)){
V.clear();
in += "\n";
string str;
for(int i = 0; i < in.length(); i++){
if(in[i] < 'a' || in[i] > 'z'){
V.push_back(str);
str = "";
if(in[i] == '.') V.push_back(".");
if(in[i] == ' ') V.push_back(" ");
}else str += in[i];
}
cout << solve() << endl;
}
return 0;
} | 0 |
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << " = " << (x) << endl;
#define fs first
#define sc second
#define pb push_back
#define eb emplace_back
#define SP << " " <<
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
typedef vector<ll> vec;
typedef vector<P> pvec;
typedef vector<vector<ll>> vvec;
typedef vector<vector<P>> pvvec;
typedef priority_queue<ll> PQI;
typedef priority_queue<P> PQP;
typedef priority_queue<ll,vector<ll>,greater<ll>> PQIG;
typedef priority_queue<P,vector<P>,greater<P>> PQPG;
const vector<int> dx = {0, -1, 0, 1, 1, 1, -1, -1};
const vector<int> dy = {1, 0, -1, 0, 1, -1, 1, -1};
constexpr int MOD = (1000000007);
// const int MOD = (998244353);
// const int INF = (1 << 30); // 1073741824
const int INF = (1LL << 60); // 1152921504606846976
const double EPS = (1 >> 30);
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return 1;} return 0;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return 1;} return 0;}
template<class T> inline T ceil(T a, T b) {return T((a + b - 1) / b);}
template<class T> inline T round(T a, T b) {return T(a / b);}
template< typename T1, typename T2 > istream &operator>>(istream &is, pair< T1, T2 > &p) { is >> p.first >> p.second; return is; }
template <class T> inline void out(T &a) { bool flag=true; for(auto&x:a){if(flag) {flag=false;} else{ cout << ' '; } cout<<x; } cout << endl; }
//----------------------------------------------------------------
int nmax=200000; // 2*(10^5)
vvec g(nmax);
void solve4ts()
{
int N; cin >> N;
cout << 0 << endl;
string first; cin >> first;
int l = 0, r = N;
if(first!="Vacant")while (1) {
int m = (l + r) / 2;
cout << m << endl;
string s; cin >> s;
if (s == "Vacant")break;
if (m % 2 && s != first || m % 2 == 0 && s == first)l = m + 1;
else r = m;
}
}
//-----------------------------------------------------------------
signed main(){ ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(15);
int repeat = 1;
// cin >> repeat;
while(repeat--) solve4ts();
} | #include <bits/stdc++.h>
#define int long long
#define x first
#define y second
#define getbit(x, i) (((x) >> (i)) & 1)
using namespace std;
typedef pair<int, int> pii;
#define hashset unordered_set
#define hashmap unordered_map
#define newline fast_writechar('\n')
#define unify(arr) arr.resize(unique(arr.begin(), arr.end()) - arr.begin())
#define getbit(x, i) (((x) >> (i)) & 1)
template <typename T>
vector<T> readvector(size_t sz) {
vector<T> res(sz);
for (size_t i = 0; i < sz; ++i) {
cin >> res[i];
}
return res;
}
template <typename T>
std::ostream &operator<<(std::ostream &out, const std::vector<T> &v) {
std::copy(v.begin(), v.end(), std::ostream_iterator<T>(out, " "));
return out;
}
int mylog(int n) {
return 63 - __builtin_clzll(n);
}
inline int binPow(int x, int deg, int mod) {
int ans = 1;
for (int i = sizeof(deg) * CHAR_BIT - 1; i >= 0; i--) {
ans *= ans;
ans %= mod;
if (getbit(deg, i)) ans *= x;
ans %= mod;
}
return ans;
}
/** Interface */
inline int readInt();
inline int readUInt();
inline void readWord(char *s);
inline int fast_readchar(); // you may use readchar() instead of it
inline void writeInt(int x);
inline void fast_writechar(int x); // you may use putchar() instead of it
inline void writeWord(const char *s);
inline void fast_flush();
// ====================== END ======================
const int MAXN = 2e6 + 10;
const int MOD = 1e9 + 7;
const int INF = 1e18;
void solve() {
int n, k;
cin >> n >> k;
auto arr =readvector<int>(n);
arr.insert(arr.begin(), 0);
for (int i = 1; i <= n; i++) arr[i] += arr[i - 1];
int ans = 0;
for (int i = 0; i + k <= n; i++) {
ans = max(ans, arr[i + k] - arr[i] + k);
}
cout << fixed << setprecision(1) << ans / 2. << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
// t = readInt();
// cin >> t;
for (int i = 1; i <= t; ++i) {
// cout << "Case #" << i << ": ";
solve();
}
// fast_flush();
return 0;
}
/** Read */
static const int buf_size = 4096;
inline int fast_readchar() {
static char buf[buf_size];
static int len = 0, pos = 0;
if (pos == len) pos = 0, len = fread(buf, 1, buf_size, stdin);
if (pos == len) return -1;
return buf[pos++];
}
inline int readUInt() {
int c = fast_readchar(), x = 0;
while (c <= 32) c = fast_readchar();
while ('0' <= c && c <= '9') x = x * 10 + c - '0', c = fast_readchar();
return x;
}
inline int readInt() {
int s = 1, c = fast_readchar();
int x = 0;
while (c <= 32) c = fast_readchar();
if (c == '-') s = -1, c = fast_readchar();
while ('0' <= c && c <= '9') x = x * 10 + c - '0', c = fast_readchar();
return x * s;
}
inline void readWord(char *s) {
int c = fast_readchar();
while (c <= 32) c = fast_readchar();
while (c > 32) *s++ = c, c = fast_readchar();
*s = 0;
}
/** Write */
static int write_pos = 0;
static char write_buf[buf_size];
inline void fast_writechar(int x) {
if (write_pos == buf_size) fwrite(write_buf, 1, buf_size, stdout), write_pos = 0;
write_buf[write_pos++] = x;
}
inline void fast_flush() {
if (write_pos) fwrite(write_buf, 1, write_pos, stdout), write_pos = 0;
}
inline void writeInt(int x) {
if (x < 0) fast_writechar('-'), x = -x;
char s[24];
int n = 0;
while (x || !n) s[n++] = '0' + x % 10, x /= 10;
while (n--) fast_writechar(s[n]);
}
inline void writeWord(const char *s) {
while (*s) fast_writechar(*s++);
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;
//繰り返し二乗法
ll mod_pow(ll a, ll n, ll m) {
ll res = 1;
while (n) {
if (n & 1)res = res * a%m;
a = a * a%m; n >>= 1;
}
return res;
}
struct modint {
ll n;
modint() :n(0) { ; }
modint(ll m) :n(m) {
if (n >= mod)n %= mod;
else if (n < 0)n = (n%mod + mod) % mod;
}
operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
if (n == 0)return modint(1);
modint res = (a*a) ^ (n / 2);
if (n % 2)res = res * a;
return res;
}
//逆元(Eucledean algorithm)
ll inv(ll a, ll p) {
return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
fact[0] = modint(1);
for (int i = 0; i < max_n - 1; i++) {
fact[i + 1] = fact[i] * modint(i + 1);
}
factinv[max_n - 1] = modint(1) / fact[max_n - 1];
for (int i = max_n - 2; i >= 0; i--) {
factinv[i] = factinv[i + 1] * modint(i + 1);
}
}
modint comb(int a, int b) {
if (a < 0 || b < 0 || a < b)return 0;
return fact[a] * factinv[b] * factinv[a - b];
}
using mP = pair<modint, modint>;
int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };
vec memo(1005);
queue<int> v[1005];
void solve() {
int N; cin >> N;
auto tmemo = memo;
rep1(i, N){
rep(j, N-1){
int a; cin >> a;
v[i].push(a);
}
}
int res = 0;
while(1){
bool f = false;
memo = tmemo;
rep1(i, N){
if(v[i].empty()) continue;
int tmp = v[i].front();
if(memo[i] || memo[tmp]) continue;
if(v[tmp].front() == i){
f = true;
v[i].pop(); v[tmp].pop();
memo[i] = memo[tmp] = 1;
}
}
if(!f) break;
res++;
}
rep1(i, N){
if(!v[i].empty()){
cout << -1 << endl;
return;
}
}
cout << res << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
//cout << fixed << setprecision(10);
//init_f();
//init();
//int t; cin >> t; rep(i, t)solve();
solve();
// stop
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " << var << endl
const ll mod = 1000000007;
vector<int> to[500000];
int tab[1005][1005];
int toID(int i, int j) {
if (i>j) swap(i, j);
return tab[i][j];
}
int dp[500000];
bool used[500000];
bool calculated[500000];
int dfs(int x) {
if (used[x]) {
if (!calculated[x]) return -1;
return dp[x];
}
used[x] = true;
int now = 1;
for (int e: to[x]) {
int res = dfs(e);
if (res<0) return -1;
now = max(res+1, now);
}
dp[x] = now;
calculated[x] = true;
return dp[x];
}
int main(){
int n;
cin >> n;
vector<vector<int>> a(n, vector<int>(n-1));
rep(i, n) rep(j, n-1) {
cin >> a[i][j];
a[i][j]--;
}
int id = 0;
rep(i, n) rep(j, n) {
if (i<j) tab[i][j] = id++;
}
rep(i, n) {
rep(j, n-1) {
a[i][j] = toID(i, a[i][j]);
}
rep(j, n-2) {
to[a[i][j]].push_back(a[i][j+1]);
}
}
int ans = 0;
rep(i, id) {
int res = dfs(i);
ans = max(ans, res);
if (res==-1) {
cout << "-1" << endl;
return 0;
}
}
cout << ans << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
double const PI = 3.1415926535897932384626433;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> A(5);
for(int i=0; i<5; i++) cin >> A.at(i);
int k, ans=0;
cin >> k;
for(int i=0; i<5; i++) {
for(int j=i+1; j<5; j++) {
if(A.at(j) - A.at(i) > k) ans = 1;
}
}
if(ans == 0) cout << "Yay!" << endl;
else cout << ":(" << endl;
} | 1 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
// output
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
// utility
#define ALL(i) (i).begin(), (i).end()
#define FOR(i, a, n) for(int i=(a);i<(n);++i)
#define RFOR(i, a, n) for(int i=(n)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#define IN(a, x, b) (a<=x && x<b)
#define OUT(a, x, b) (x<a || b<=x)
template<class T> inline T chmax(T & a, const T b) { return a = (a < b) ? b : a; }
template<class T> inline T chmin(T& a, const T b) { return a = (a > b) ? b : a; }
// type/const
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const int MOD = 1000000007;
/* const int MOD = 1000000007; */
const int INF = 1e18;
const double PI = acos(-1);
using namespace std;
signed main() {
int N, M;
cin >> N >> M;
vector<vector<int>> A(N, vector<int>(M));
REP(i, N) REP(j, M){
cin >> A[i][j];
A[i][j]--;
}
int ans = N;
vector<int> cnt(N, 0);
vector<int> ng;
while((int)ng.size() < M-1){
vector<int> num(M, 0);
REP(i, N){
num[A[i][cnt[i]]]++;
}
int ret = 0;
REP(i, M) if(num[i] != 0) chmax(ret, num[i]);
chmin(ans, ret);
pair<int, int> p(0, 0);
REP(i, M){
if(p.first < num[i]){
p.first = num[i];
p.second = i;
}
}
ng.emplace_back(p.second);
REP(i, N){
REP(j, ng.size()){
if(A[i][cnt[i]] == ng[j]){
cnt[i]++;
j = -1;
}
}
}
}
cout << ans << endl;
return 0;
} | #pragma GCC optimize ("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse4")
#include"bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int ll
#define sz(x) (int)(x).size();
#define all(x) x.begin(), x.end()
#define trav(i,a) for(auto &i:a)
inline int in(){int x;scanf("%lld",&x);return x;}
int32_t main()
{
int n=in();
map<int,int> f;
int x;
vector<int> a;
for(int i=0;i<n;i++){x=in();f[x]++;}
for(auto i:f)
{
int t=i.second;
t/=2;
for(int _=0;_<t;_++)a.push_back(i.first);
}
sort(a.rbegin(),a.rend());
if(a.size()<=1)cout<<0;
else cout<<a[0]*a[1];
} | 0 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define space putchar(' ')
#define enter putchar('\n')
#define mp make_pair
#define pb push_back
//#define ivorysi
#define MAXN 300005
using namespace std;
typedef long long int64;
typedef double db;
template<class T>
void read(T &res) {
res = 0;char c = getchar();T f = 1;
while(c < '0' || c > '9') {
if(c == '-') f = -1;
c = getchar();
}
while(c >= '0' && c <= '9') {
res = res * 10 + c - '0';
c = getchar();
}
res *= f;
}
template<class T>
void out(T x) {
if(x < 0) {x = -x;putchar('-');}
if(x >= 10) {
out(x / 10);
}
putchar('0' + x % 10);
}
const int MOD = 1000000007;
int dp[MAXN][3][2][2],sum[MAXN],ans,N;
char s[MAXN];
int inc(int a,int b) {
return a + b >= MOD ? a + b - MOD : a + b;
}
int mul(int a,int b) {
return 1LL * a * b % MOD;
}
void update(int &x,int y) {
x = inc(x,y);
}
int fpow(int x,int c) {
int res = 1,t = x;
while(c) {
if(c & 1) res = mul(res,t);
t = mul(t,t);
c >>= 1;
}
return res;
}
void Solve() {
scanf("%s",s + 1);
N = strlen(s + 1);
for(int i = N ; i >= 1 ; --i) {
sum[i] = sum[i + 1] + (s[i] == '?');
}
dp[0][0][0][0] = 1;
for(int i = 1 ; i <= N ; ++i) {
int t = 0;
for(int j = 0 ; j <= 2 ; ++j) {
for(int h = 0 ; h <= 1 ; ++h) {
for(int k = 0 ; k <= 1 ; ++k) {
if(!dp[i - 1][j][h][k]) continue;
if(s[i] == '0' || s[i] == '?') {
if(k) update(dp[i][1][h][0],dp[i - 1][j][h][k]);
else {
if(j == 1) update(dp[i][2][h][0],dp[i - 1][j][h][k]);
else update(dp[i][1][h][0],dp[i - 1][j][h][k]);
}
}
if(s[i] == '1' || s[i] == '?') {
if(k) {
if(h) update(t,dp[i - 1][j][h][k]);
else update(dp[i][0][h + 1][0],dp[i - 1][j][h][k]);
}
else {
if(j == 1) update(dp[i][0][h][1],dp[i - 1][j][h][k]);
if(j == 2) update(dp[i][1][h][0],dp[i - 1][j][h][k]);
if(j == 0) {
if(h) update(t,dp[i - 1][j][h][k]);
else update(dp[i][0][h + 1][0],dp[i - 1][j][h][k]);
}
}
}
}
}
}
update(ans,mul(t,fpow(2,sum[i + 1])));
}
update(ans,inc(dp[N][0][1][1],dp[N][0][1][0]));
out(ans);enter;
}
int main() {
#ifdef ivorysi
freopen("f1.in","r",stdin);
#endif
Solve();
return 0;
}
| #ifndef VS
#include<bits/stdc++.h>
#endif
using namespace std;
typedef long long LL;
#ifdef BTK
#define DEBUG if(1)
#else
#define CIN_ONLY if(1)
struct cww {cww() {CIN_ONLY{ios::sync_with_stdio(false); cin.tie(0);}}
}star;
#define DEBUG if(0)
#endif
#define ALL(v) (v).begin(),(v).end()
#define REC(ret, ...) std::function<ret (__VA_ARGS__)>
template <typename T>inline bool chmin(T &l, T r){bool a = l>r; if (a)l = r; return a;}
template <typename T>inline bool chmax(T &l, T r){bool a = l<r; if (a)l = r; return a;}
template <typename T>istream& operator>>(istream &is, vector<T> &v){for (auto &it : v)is >> it;return is;}
class range {private: struct I { int x; int operator*() { return x; }bool operator!=(I& lhs) { return x<lhs.x; }void operator++() { ++x; } }; I i, n;public:range(int n) :i({ 0 }), n({ n }) {}range(int i, int n) :i({ i }), n({ n }) {}I& begin() { return i; }I& end() { return n; }};
const int mod = 1e9 + 7;
typedef vector<LL> V;
typedef vector<V> VV;
int main() {
string s;
while (cin >> s) {
VV dp(4, V(3, 0));
dp[0][0] = 1;
for (auto c : s) {
VV nxt(4, V(3, 0));
if (c == '0' || c == '?') {
for (int i : range(4)) {
nxt[i][1] += dp[i][0];
nxt[i][2] += dp[i][1];
nxt[i][1] += dp[i][2];
}
}
if (c == '1' || c == '?') {
for (int i : range(4)) {
nxt[min(i + 1, 3)][0] += dp[i][0];
nxt[i][0] += dp[i][1];
nxt[i][1] += dp[i][2];
}
}
for (auto &a : nxt)for (auto &b : a)b %= mod;
swap(dp, nxt);
}
cout << (dp[3][0] + dp[3][1] + dp[3][2] + dp[2][0] + dp[2][1] + dp[1][0]) % mod << endl;
}
return 0;
}
| 1 |
using namespace std;
#include <iostream>
#include <vector>
int A,B,C;
int main() {
cin >> A >> B >> C;
string ans = (A < C) ^ (B < C)?"Yes":"No";
cout << ans << endl;
return 0;
} | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include<stdio.h>
#include<queue>
#include <climits>
#include <map>
#include <set>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int mod = 1e9 + 7;
const long long INF = 1LL << 60;
int main()
{
int n; cin >> n;
if(n==2){
int a,b;
cin >> a >> b;
for(int i = 1; i <= min(a,b); i++){
if(a % i == 0 && b % i == 0){
cout << i << endl;
}
}
}else{
int a,b,c;
cin >> a >> b >> c;
for(int i = 1; i <= min({a,b,c}); i++){
if(a % i == 0 && b % i == 0 && c % i == 0){
cout << i << endl;
}
}
}
}
| 0 |
#include<iostream>
#include<cstdio>
using namespace std;
char s[20][20];
int ans,dx[]={0,0,1,-1},dy[]={1,-1,0,0};
void func(int y,int x){
s[y][x]='0';
int q,p;
for(int i=0;i<4;i++){
q=x+dx[i];
p=y+dy[i];
if(q>=0&&q<12&&p>=0&&p<12){
if(s[p][q]=='1')
func(p,q);
}
}
}
int main(){
while(cin>>s[0]){
ans=0;
for(int i=1;i<12;i++)
cin>>s[i];
for(int i=0;i<12;i++)
for(int j=0;j<12;j++)
if(s[i][j]=='1'){
ans++;
func(i,j);
}
cout<<ans<<endl;
}
return 0;
} | #include <iostream>
#include <utility>
static int bsort(int *a, int n) {
bool f = true;
int c = 0;
while (f) {
f = false;
for (int i = n - 1; i > 0; --i) {
if (a[i] < a[i - 1]) {
std::swap(a[i], a[i - 1]);
f = true;
++c;
}
}
}
return c;
}
int main() {
int n, a[100];
std::cin >> n;
for (int i = 0; i < n; ++i) {
std::cin >> a[i];
}
int c = bsort(a, n);
for (int i = 0; i < n; ++i) {
std::cout << ((i == 0) ? "" : " ") << a[i];
}
std::cout << std::endl << c << std::endl;
}
| 0 |
// 解き直し.
// https://img.atcoder.jp/cf17-final/editorial.pdf
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using P = pair<LL, LL>;
#define pb push_back
#define a first
#define b second
#define repx(i, a, b) for(int i = a; i < b; i++)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
const LL INF = 2020202020;
const int MAX = 5050;
LL dp[MAX][MAX];
int main(){
// 1. 入力情報.
int N;
scanf("%d", &N);
vector<P> v;
LL h, p;
v.pb({0, 0});
rep(i, N){
scanf("%lld %lld", &h, &p);
v.pb({h, p});
}
rep(i, MAX) rep(j, MAX) dp[i][j] = INF;
// 2. h + p を 小さい順に, sort.
// ex.
// 6
// 1 6
// 2 5
// 3 4
// 4 3
// 5 2
// 6 1
//
// -> 以下のようにsortする必要があるはず.
// h=0 p=0
// h=6 p=1
// h=5 p=2
// h=4 p=3
// h=3 p=4
// h=2 p=5
// h=1 p=6
// -> この場合, 3人(sort後 の 1番目, 2番目, 3番目, もしくは, sort前 の 6番目, 5番目, 4番目)が座布団を積める.
sort(v.begin(), v.end(), [](const P &x, const P &y){
if(x.a + x.b < y.a + y.b) return true;
else if(x.a + x.b == y.a + y.b && x.b < y.b) return true;
else return false;
});
// for(auto &p : v) printf("h=%lld p=%lld\n", p.a, p.b);
// 3. dp更新.
dp[1][1] = v[1].b;
repx(i, 2, N + 1){
repx(j, 1, i + 1){
if(dp[i - 1][j - 1] > v[i].a) dp[i][j] = dp[i - 1][j];
else dp[i][j] = min(dp[i - 1][j], dp[i - 1][j - 1] + v[i].b);
}
}
// rep(i, N + 1){
// rep(j, N + 1){
// printf("%lld ", dp[i][j]);
// }
// printf("\n");
// }
// 4. 出力.
int ans = 0;
rep(i, N + 1) if(dp[N][i] != INF) ans++;
printf("%d\n", ans);
return 0;
} | /**
* author: tourist
* created: 22.01.2020 00:01:26
**/
#include <bits/stdc++.h>
using namespace std;
class dsu {
public:
vector<int> p;
int n;
dsu(int _n) : n(_n) {
p.resize(n);
iota(p.begin(), p.end(), 0);
}
inline int get(int x) {
return (x == p[x] ? x : (p[x] = get(p[x])));
}
inline bool unite(int x, int y) {
x = get(x);
y = get(y);
if (x != y) {
p[x] = y;
return true;
}
return false;
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
dsu d(2 * n);
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
--x; --y;
d.unite(x, y + n);
d.unite(x + n, y);
}
vector<int> cnt(n, 0);
for (int i = 0; i < n; i++) {
cnt[d.get(i) % n] += 1;
}
long long iso = 0;
long long bip = 0;
long long non = 0;
for (int i = 0; i < n; i++) {
if (cnt[i] == 1) {
iso += 1;
}
if (cnt[i] > 1) {
if (d.get(i) == d.get(i + n)) {
non += 1;
} else {
bip += 1;
}
}
}
long long ans = iso * iso + iso * (n - iso) + (n - iso) * iso;
ans += (non + bip) * (non + bip);
ans += bip * bip;
cout << ans << '\n';
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 110;
int n, m, ex, ey;
int dp[2][MAXN][MAXN][MAXN];
int C[MAXN][MAXN], R[MAXN][MAXN];
char s[MAXN][MAXN];
inline int QR(int p, int l, int r) {
if(l >= r) return 0;
return R[p][r]-R[p][l];
}
inline int QC(int p, int l, int r) {
if(l >= r) return 0;
return C[p][r]-C[p][l];
}
inline void chkmax(int &cur, int val) {
if(cur < val) cur = val;
}
int main() {
scanf("%d%d", &n, &m);
for(int i = 1; i <= n; i++) scanf("%s", s[i]+1);
for(int i = 1; i <= n; i++) {
C[i][0] = 0;
for(int j = 1; j <= m; j++) {
C[i][j] = C[i][j-1]+(s[i][j]=='o');
if(s[i][j] == 'E') ex = i, ey = j;
}
}
for(int i = 1; i <= m; i++) {
R[i][0] = 0;
for(int j = 1; j <= n; j++)
R[i][j] = R[i][j-1]+(s[j][i]=='o');
}
for(int l = 0; l < ex; l++) {
for(int d = 0; d < ey; d++)
for(int r = 0; r <= n-ex; r++)
for(int u = 0; u <= m-ey; u++) {
int val = dp[l&1][d][r][u];
if(l != ex-1) {
if(ex-l-1 <= r) chkmax(dp[l&1^1][d][r][u], val);
else {
int lef = max(ey-d, u+1), rig = min(ey+u, m-d);
chkmax(dp[l&1^1][d][r][u], val+QC(ex-l-1, lef-1, rig));
}
}
if(d != ey-1) {
if(ey-d-1 <= u) chkmax(dp[l&1][d+1][r][u], val);
else {
int lef = max(ex-l, r+1), rig = min(ex+r, n-l);
//if(d == 0 && r == 1 && u == 1) printf("!\n");
chkmax(dp[l&1][d+1][r][u], val+QR(ey-d-1, lef-1, rig));
}
}
if(r != n-ex) {
if(ex+r+1 > n-l) chkmax(dp[l&1][d][r+1][u], val);
else {
int lef = max(ey-d, u+1), rig = min(ey+u, m-d);
//if(d == 1 && r == 0 && u == 1) printf("!!\n");
chkmax(dp[l&1][d][r+1][u], val+QC(ex+r+1, lef-1, rig));
}
}
if(u != m-ey) {
if(ey+u+1 > m-d) chkmax(dp[l&1][d][r][u+1], val);
else {
int lef = max(ex-l, r+1), rig = min(ex+r, n-l);
//if(d == 1 && r == 1 && u == 0) printf("!!!\n");
chkmax(dp[l&1][d][r][u+1], val+QR(ey+u+1, lef-1, rig));
}
}
}
if(l == ex-1) break;
for(int d = 0; d < ey; d++)
for(int r = 0; r <= n-ex; r++)
for(int u = 0; u <= m-ey; u++)
dp[l&1][d][r][u] = 0;
}
printf("%d\n", dp[(ex-1)&1][ey-1][n-ex][m-ey]);
return 0;
}
| #include <iostream>
#include <vector>
#include <deque>
#include <algorithm>
#include <numeric>
#include <string>
#include <cstring>
#include <list>
#include <unordered_set>
#include <tuple>
#include <cmath>
#include <limits>
#include <type_traits>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <set>
#include <bitset>
#include <regex>
#include <random>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n)for(ll i=0;i<n;++i)
#define exout(x) printf("%.10f\n", x)
const double pi = acos(-1.0);
const ll MOD = 1000000007;
const ll INF = 1e18;
const ll MAX_N = 201010;
//最大公約数
ll gcd(ll x, ll y) {
return y ? gcd(y, x % y) : x;
}
ll lcm(ll x, ll y) {
if (x == 0 || y == 0)return 0;
return (x / gcd(x, y) * y);
}
ll dx[4] = { 0,0,-1,1 };
ll dy[4] = { -1,1,0,0 };
ll ans[110][110];
bool flag[2][110];
//long longしか使わない
//素数は1より大きい
//lower_boundは指定したkey以上の要素の一番左のイテレータをかえす
//upper_boundは指定したkeyより大きい要素の一番左のイテレータをかえす
int main() {
ll n, k;
cin >> n >> k;
vector<ll>a(n);
bool flag = false;
rep(i, n) {
cin >> a[i];
if (a[i] >= k)flag = true;
}
ll res = a[0];
rep(i, n - 1) {
res = gcd(res, a[i + 1]);
}
sort(a.begin(), a.end());
if (flag == false) {
puts("IMPOSSIBLE");
return 0;
}
else {
if (k % res) {
puts("IMPOSSIBLE");
}
else {
puts("POSSIBLE");
}
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#define ri register
#define int long long
#define E (n+1)
using namespace std; const int N=200010;
inline int read()
{
int s=0, w=1; ri char ch=getchar();
while(ch<'0'||ch>'9') { if(ch=='-') w=-1; ch=getchar(); }
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48), ch=getchar();
return s*w;
}
signed main()
{
int n=read();
printf("%lld\n",n/3);
return 0;
} | #include<iostream>
using namespace std;
int main()
{
int n;
cin >> n;
if(n / 3. >= 1)
cout << n / 3;
else cout << 0;
return 0;
}
| 1 |
#include<iostream>
#include<string.h>
using namespace std;
int main(){
string str;
cin>>str;
for(int i=0;i<str.length();i++)
cout<<str[str.length()-i-1];
cout<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll, vl/*, greater<ll>*/> pql; //降順(/*昇順*/)
typedef set<ll> sl;
typedef pair<ll, ll> pl;
typedef vector<vl> vvl;
typedef vector<pl> vpl;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define rep2(i, n) for(ll i = 1; i <= ll(n); i++)
//#define rep(i, k, n) for(ll i = k-1; i < ll(n); i++)
//#define rep2(i, k, n) for(ll i = k; i <= ll(n); i++)
#define all(v) (v).begin(), (v).end()
bool chmin(ll &a, ll b) {if(b < a) {a = b; return 1;} return 0;}
bool chmax(ll &a, ll b) {if(b > a) {a = b; return 1;} return 0;}
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
//const ll MOD = 998244353;
const ll MAX = 1e9;
const char newl = '\n';
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll a, b;
cin >> a >> b;
cout << max(a+b, max(a-b, a*b)) << newl;
return 0;
} | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
#define ENDL "\n"
typedef long long int llint;
int intinput()
{
int x;
scanf("%d", &x);
return x;
}
llint dp[300][300 * 300 + 1];
void code()
{
llint MOD = 998244353;
int N = intinput();
vector<int> a(N);
for (int i = 0; i < N; i++)
{
a[i] = intinput();
}
llint S = 0;
for (int i = 0; i < N; i++)
{
S += a[i];
}
// すべての配置パターン
llint ans = 1;
for (int i = 0; i < N; i++)
{
ans *= 3;
ans %= MOD;
}
// R, G, Bの長さがS/2を超えるパターンを除外
// dp[i個目まで使う][Rの長さ] = パターン数
dp[0][0] = 2; //Gに使うかBに使うか
dp[0][a[0]] = 1;
for (int i = 1; i < N; i++)
{
for (int s = 0; s <= S; s++)
{
dp[i][s] = 2 * dp[i - 1][s] + (s - a[i] >= 0 ? dp[i - 1][s - a[i]] : 0);
dp[i][s] %= MOD;
}
}
for (int s = (S + 1) / 2; s <= S; s++)
{
ans -= dp[N - 1][s] * 3;
while (ans < 0)
{
ans += MOD;
}
}
// R==G==S/2の場合が引かれすぎている
// dp[i個目まで使う][Rの長さ] = パターン数 ・・・今度はRとGのみに使い、R==G==S/2のパターン数を計算する
if((S&1)==0){ //合計が偶数でないと起こり得ない
for (int s = 0; s <= S/2; s++){
dp[0][s] = 0; //リセット
}
//
dp[0][0] = 1; //Gに使う(Bには使えないので1)
dp[0][a[0]] = 1; //Rに使う
for (int i = 1; i < N; i++)
{
for (int s = 0; s <= S/2; s++){
dp[i][s] = dp[i-1][s] + (s-a[i] >= 0 ? dp[i-1][s-a[i]] : 0);
dp[i][s] %= MOD;
}
}
ans += dp[N-1][S/2] * 3;
ans %= MOD;
}
//
ans %= MOD;
cout << ans << ENDL;
}
int main()
{
code();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 305;
const int S = N * N;
const int mod = 998244353;
void add(int &x,int y) {
x += y;
if (x >= mod) x -= mod;
}
void sub(int &x,int y) {
x -= y;
if (x < 0) x += mod;
}
int mul(int x,int y) {
return (long long) x * y % mod;
}
int a[N];
int f[S], g[S];
int nf[S], ng[S];
int main() {
int n;
scanf("%d", &n);
f[0] = 1;
g[0] = 1;
int sum = 0;
for (int i = 1; i <= n; ++i) {
int x;
scanf("%d", &x);
for (int j = 0; j <= sum; ++j) {
add(nf[j], f[j]);
add(nf[j + x], f[j]);
add(ng[j], mul(g[j], 2));
add(ng[j + x], g[j]);
}
sum += x;
for (int j = 0; j <= sum; ++j) {
f[j] = nf[j], nf[j] = 0;
g[j] = ng[j], ng[j] = 0;
}
}
int ans = 1;
for (int i = 1; i <= n; ++i) ans = mul(ans, 3);
for (int i = 0; i <= sum; ++i) if (i + i >= sum) {
sub(ans, mul(g[i], 3));
}
if (sum % 2 == 0) add(ans, mul(f[sum / 2], 3));
printf("%d\n", ans);
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
reverse (s.begin(),s.end());
cout<<s<<endl;
return 0;
}
| //Reverse Sequence
#include<bits/stdc++.h>
using namespace std;
int main(){
char str[21];
scanf("%s", str);
for(int i=0; i<strlen(str); i++){
printf("%c", str[strlen(str)-i-1]);
}
puts("");
return 0;
} | 1 |
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const int MOD = 998244353;
ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
int ddx[]={2,2,-2,-2,1,1,-1,-1},ddy[]={1,-1,1,-1,2,-2,2,-2};
int k,d[305][305][305];
char s[305];
int go(int l,int r,int K)
{
if(K<0)return -INF;
if(l==r)return 1;
if(l>r)return 0;
int &ret=d[l][r][K];
if(~ret)return ret;
ret=max({go(l+1,r-1,K-(s[l]!=s[r]))+2,go(l+1,r,K),go(l,r-1,K)});
return ret;
}
int main(){
MEM_1(d);
scanf("%s%d",s,&k);
printf("%d",go(0,strlen(s)-1,k));
} | #include <bits/stdc++.h>
#define ll long long
#define maxn 100005 /*rem*/
#define mod 998244353
#define db double
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define pi pair<int, int>
#define fi first
#define se second
using namespace std;
int a[maxn];
int n, m;
int f[maxn], cnt = 0;
bool cmp(int a, int b) {
return (a % 2) > (b % 2);
}
int pl;
void push(int a) {
if (pl + a - 1 >= n) a = n + 1 - pl;
f[cnt++] = a, pl += a;
}
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++)
cin >> a[i];
sort(a, a + m, cmp);
int ans = 0;
for (int i = 0; i < m; i++)
ans += a[i] % 2;
if (n % 2 == 0 && ans > 2) cout << "Impossible" << endl;
else if (n % 2 == 1 && ans > 1) cout << "Impossible" << endl;
else {
pl = 1;
if (a[1] % 2) swap(a[1], a[m - 1]);
for (int i = 0; i < m; i++) {
if (a[i] % 2) {
if (i == 0)
for (int j = 0; j < a[i] / 2 + 1; j++)
push(2);
else for (int j = 0; j < a[i] / 2; j++)
push(2);
}
else {
if (i == 0) push(1);
push(a[i]);
}
}
for (int i = 0; i < m; i++)
cout << a[i] << ' ';
cout << endl;
cout << cnt << endl;
for (int i = 0; i < cnt; i++)
printf("%d ", f[i]);
printf("\n");
}
return 0;
}
| 0 |
#include<iostream>
#include<cmath>
#include <iomanip>
using namespace std;
int main() {
long double n,m,x,y,w,z;
cin >> x>>y>>w>>z;
n = x-w;
m = y-z;
cout << setprecision(10) <<sqrt(n*n+m*m) << endl;
return 0;
}
| #include<cstdio>
#include<cctype>
#include<cstdlib>
#include<algorithm>
typedef signed long long int int64;
inline unsigned getint() {
register char ch;
while(!isdigit(ch=getchar()));
register unsigned x=ch^'0';
while(isdigit(ch=getchar())) x=(((x<<2)+x)<<1)+(ch^'0');
return x;
}
inline int64 min(const int64 &a,const int64 &b) {
return a<b?a:b;
}
const int64 inf=0x7ffffffffffffff;
const int N=200001;
int n;
class FenwickTree {
private:
int64 val[N];
int lowbit(const int &x) const {
return x&-x;
}
public:
FenwickTree() {
std::fill(&val[0],&val[N],inf);
}
void modify(int p,const int64 &x) {
while(p<=n) {
if(x<val[p]) {
val[p]=x;
} else
p+=lowbit(p);
}
}
int64 query(int p) const {
int64 ret=inf;
while(p) {
ret=min(ret,val[p]);
p-=lowbit(p);
}
return ret;
}
};
FenwickTree ta;
class RevFenwickTree {
private:
int64 val[N];
int lowbit(const int &x) const {
return x&-x;
}
public:
RevFenwickTree() {
std::fill(&val[0],&val[N],inf);
}
void modify(int p,const int64 &x) {
while(p) {
if(x<val[p]) {
val[p]=x;
}
p-=lowbit(p);
}
}
int64 query(int p) const {
int64 ret=inf;
while(p<=n) {
ret=min(ret,val[p]);
p+=lowbit(p);
}
return ret;
}
};
RevFenwickTree tb;
int64 f[N];
inline void modify(const int &p,const int64 x) {
if(1) {
f[p]=x;
ta.modify(p,x-p);
tb.modify(p,x+p);
}
}
int main() {
n=getint();
int q=getint(),a=getint(),b=getint();
std::fill(&f[0],&f[N],inf);
modify(a,0);
int64 sum=0;
while(q--) {
a=b;
b=getint();
sum+=abs(a-b);
int64 t1=ta.query(b)+b,t2=tb.query(b)-b;
modify(a,min(t1,t2)-abs(a-b));
}
int64 tmp=inf;
for(register int i=1;i<=n;i++) {
tmp=min(tmp,f[i]);
}
printf("%lld\n",tmp+sum);
return 0;
}
| 0 |
#include <iostream>
#include <limits>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n, a;
long long int mina, maxa, suma;
cin>>n>>a;
mina=maxa=suma=a;
for(int i=1; i<n; i++) {
cin>>a;
if(mina>a) mina=a;
if(maxa<a) maxa=a;
suma+=a;
}
cout<<mina<<' '<<maxa<<' '<<suma<<'\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define faster ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pi acos(-1.0)
#define nl '\n'
///Library
#define mem(a,b) memset(a,b,sizeof(a))
#define all(a) a.begin(),a.end()
#define Sort(x) sort(x.begin(),x.end())
#define Reverse(x) reverse(x.begin(),x.end())
#define SortA(ar,s) sort(ar,ar+s)
#define SortD(ar,s) sort(ar,ar+s,greater<int>())
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*(b/gcd(a,b)))
#define sq(x) (x)*(x)
#define min3(a,b,c) min(a,min(b,c))
#define min4(a,b,c,d) min(a,min(b,min(c,d)))
#define max3(a,b,c) max(a,max(b,c))
#define max4(a,b,c,d) max(a,max(b,max(c,d)))
#define ABS(x) ((x)<0?-(x):(x))
#define pb push_back
#define mod 1000000007
#define end printf("\n")
#define yes printf("YES\n")
#define no printf("NO\n")
///data type
typedef long long int ll;
typedef unsigned long long int llu;
int main()
{
faster
ll n,sum=0;
cin>>n;
int A[n+n];
for(int i=0; i<(n+n); i++)
cin>>A[i];
sort(A,A+n+n);
for(int i=0; i<n+n; i=i+2)
{
sum+=A[i];
}
cout<<sum<<nl;
return 0;
}
| 0 |
#include<cstdio>
#include<iostream>
#include<string>
using namespace std;
int main(void){
string roman;
string fig("IVXLCDM");
int ure[]={1,5,10,50,100,500,1000};
int sum;
while(cin>>roman){
sum=0;
for(int i=1;i<roman.length();i++){
if(ure[fig.find(roman[i])]>ure[fig.find(roman[i-1])]) sum+=-1*ure[fig.find(roman[i-1])];
else sum+=ure[fig.find(roman[i-1])];
}
sum+=ure[fig.find(roman[roman.length()-1])];
cout<<sum<<endl;
}
return 0;
} | #include <iostream>
using namespace std;
int gcd(int a, int b){
if(a < b) swap(a,b);
if(b == 0) return a;
else return gcd(b, a%b);
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int N; cin >> N;
if(N == 2){
int a, b;
cin >> a >> b;
for(int i = 1; i < max(a,b) + 1; ++i){
if(a%i == 0 && b%i == 0) cout << i << endl;
}
}
else {
int a, b , c;
cin >> a >> b >> c;
for(int i = 1; i < max(a,max(b,c)) + 1; ++i){
if(a%i == 0 && b%i == 0 && c%i == 0) cout << i << endl;
}
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
int main() {
int N, K; cin >> N >> K;
set<char> D;
for(int i = 0; i < K; i++) {
char d; cin >> d;
D.insert(d);
}
int ans = N;
while(true) {
string n = to_string(ans);
bool flag = true;
for(int i = 0; i < n.size(); i++) {
if(D.count(n[i])) {
flag = false;
break;
}
}
if(flag) {
cout << ans << endl;
return 0;
}
ans++;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const ld EPS = 1e-10;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};
int main(){
int H, W, A, B;
cin >> H >> W >> A >> B;
char s[H][W];
rep(i, H){
rep(j, W){
if((i < B && j < A) || (i >= B && j >= A)) s[i][j] = '1';
else s[i][j] = '0';
}
}
rep(i, H){
rep(j, W) cout << s[i][j]; cout << endl;
}
} | 0 |
#include <bits/stdc++.h>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define dump_1(x1) cerr << #x1 << ": " << x1 << endl
#define dump_2(x1, x2) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define dump_3(x1, x2, x3) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \
<< x3 << endl
#define dump_4(x1, x2, x3, x4) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \
<< x3 << ", " #x4 << ": " << x4 << endl
#define dump_5(x1, x2, x3, x4, x5) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \
<< x3 << ", " #x4 << ": " << x4 << ", " #x5 << ": " << x5 << endl
#define dump(...) \
CHOOSE((__VA_ARGS__, dump_5, dump_4, dump_3, dump_2, dump_1, ~))(__VA_ARGS__)
#define check(s) cerr << s << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define unique(v) v.erase(unique(v.begin(), v.end()), v.end());
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
using ll = long long;
vector<int> dx = {0, 1, 0, -1};
vector<int> dy = {1, 0, -1, 0};
const ll LINF = 2e18;
const int INF = 1e9;
// Binary Indexed Tree (Fenwick Tree)
// https://youtu.be/lyHk98daDJo?t=7960
template <typename T>
struct BIT {
int n;
vector<T> d;
BIT(int n = 0) : n(n), d(n + 1) {}
void add(int i, T x = 1) {
for (i++; i <= n; i += i & -i) {
d[i] += x;
}
}
T sum(int i) {
T x = 0;
for (i++; i; i -= i & -i) {
x += d[i];
}
return x;
}
T sum(int l, int r) { return sum(r - 1) - sum(l - 1); }
};
void solve(ll N, ll Q, std::vector<ll> c, std::vector<ll> l,
std::vector<ll> r) {
vector<int> pi(N + 1, -1);
vector<vector<int>> ps(N);
rep(i, N) {
int l = pi.at(c.at(i));
if (l != -1) ps.at(l).push_back(i);
pi.at(c.at(i)) = i;
}
vector<vector<pair<int, int>>> qs(N);
rep(i, Q) { qs.at(l.at(i)).emplace_back(r.at(i), i); }
BIT<int> d(N);
vector<int> ans(Q);
for (int x = N - 1; x >= 0; --x) {
for (int y : ps.at(x)) d.add(y, 1);
for (auto query : qs.at(x)) {
int r = query.first, i = query.second;
ans.at(i) = (r - x + 1) - d.sum(r);
}
}
rep(i, Q) { cout << ans.at(i) << endl; }
return;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
ll N;
scanf("%lld", &N);
ll Q;
scanf("%lld", &Q);
std::vector<ll> c(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &c[i]);
}
std::vector<ll> l(Q);
std::vector<ll> r(Q);
for (int i = 0; i < Q; i++) {
scanf("%lld", &l[i]);
scanf("%lld", &r[i]);
l[i]--; // 0-indexed
r[i]--; // 0-indexed
}
solve(N, Q, std::move(c), std::move(l), std::move(r));
return 0;
}
| // Aizu Vol-5 0533: Contest
// 2017.8.30 bal4u@uu
#include <stdio.h>
int max[2][3];
int main()
{
int i, j, p, s[2];
for (j = 0; j < 2; j++) {
for (i = 0; i < 10; i++) {
scanf("%d", &p);
if (p > max[j][0]) max[j][2] = max[j][1], max[j][1] = max[j][0], max[j][0] = p;
else if (p > max[j][1]) max[j][2] = max[j][1], max[j][1] = p;
else if (p > max[j][2]) max[j][2] = p;
}
for (s[j] = i = 0; i < 3; i++) s[j] += max[j][i];
}
printf("%d %d\n", s[0], s[1]);
return 0;
} | 0 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#define lol(i,n) for(ll i=0;i<n;i++)
#define mod 1000000007
typedef long long ll;
using namespace std;
#define X 610
ll n;
class Con{
public:
vector<pair<ll,ll> > g[X][X];
ll s[X][X];
void dfs(ll x,ll y,ll c){
if(~s[x][y])return;
s[x][y]=c;
for(auto t:g[x][y]){
dfs(t.first,t.second,1^c);
}
}
void main(ll d){
vector<ll> x,y;
for(int i=-X;i<X;i++)for(int j=-X;j<X;j++){
if(i*i+j*j==d){
x.push_back(i); y.push_back(j);
}
}
lol(i,n)lol(j,n){
for(int k=0;k<x.size();k++){
ll xx=i+x[k],yy=j+y[k];
if(xx<0||yy<0||xx>=n||yy>=n)continue;
g[i][j].push_back(make_pair(xx,yy));
}
}
lol(i,n)lol(j,n)s[i][j]=-1;
lol(i,n)lol(j,n)dfs(i,j,0);
}
};Con co[2];
int main(){
cin>>n;n*=2;
lol(i,2){
ll d;
cin>>d;
co[i].main(d);
}
vector<pair<ll,ll> >v[2][2];
lol(i,n)lol(j,n){
v[co[0].s[i][j]][co[1].s[i][j]].push_back(make_pair(i,j));
}
lol(i,2)lol(j,2)if(v[i][j].size()>=n*n/4){
for(int k=0;k<n*n/4;k++){
cout<<v[i][j][k].first<<" "<<v[i][j][k].second<<endl;
}
return 0;
}
return 0;
}
| #include <bits/stdc++.h>
int read(){
int x=0,f=1;
char ch=getchar();
while (ch<'0' || ch>'9'){
if (ch=='-') f=-1;
ch=getchar();
}
while (ch>='0' && ch<='9'){
x=x*10+ch-'0';ch=getchar();
}
return x*f;
}
const int N=600;
int n,d1,d2,col[2][N*N];
std::vector< std::pair<int,int> > v[2];
inline int id(const int &x,const int &y) {
return x*N+y;
}
inline bool check(const int &x) {
return 0<=x && x<n*2;
}
void dfs(const int &x,const int &t) {
const int i=x/N,j=x%N;
for (auto &d:v[t]) {
const int nx=i+d.first,ny=j+d.second;
if (!check(nx)||!check(ny)) continue;
const int y=id(i+d.first,j+d.second);
if (!col[t][y]) {
col[t][y]=col[t][x]==1?2:1;
dfs(y,t);
}
}
}
int main() {
n=read(),d1=read(),d2=read();
for (register int i=0;i<=d1;i++) {
const int j=sqrt(d1-i*i);
if (i*i+j*j!=d1) continue;
v[0].emplace_back(std::make_pair(i,j));
v[0].emplace_back(std::make_pair(-i,j));
v[0].emplace_back(std::make_pair(i,-j));
v[0].emplace_back(std::make_pair(-i,-j));
}
for (register int i=0;i<=d2;i++) {
const int j=sqrt(d2-i*i);
if (i*i+j*j!=d2) continue;
v[1].emplace_back(std::make_pair(i,j));
v[1].emplace_back(std::make_pair(-i,j));
v[1].emplace_back(std::make_pair(i,-j));
v[1].emplace_back(std::make_pair(-i,-j));
}
for (register int i=0;i<n*2;i++) {
for (register int j=0;j<n*2;j++) {
if (!col[0][id(i,j)]) {
col[0][id(i,j)]=1;
dfs(id(i,j),0);
}
if (!col[1][id(i,j)]) {
col[1][id(i,j)]=1;
dfs(id(i,j),1);
}
}
}
for (register int i=0,cnt=0;i<n*2;i++){
for (register int j=0;j<n*2;j++) {
if (col[0][id(i,j)]==1 && col[1][id(i,j)]==1) {
printf("%d %d\n",i,j);
if (++cnt==n*n) return 0;
}
}
}
}
| 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <string>
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <iomanip>
using ll = long long;
using ull = unsigned long long;
using namespace std;
#define FALSE printf("false\n");
#define TRUE printf("true\n");
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i = 0;(i) < ((int)(n));++(i))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() )
#define test(a) cout<<"line:"<<__LINE__<<"["<<(#a)<<": "<<(a)<<"]"<<endl
const int INF = 1e9+7;
const ll INFL = 9*1e18;
// const int dx[4] = { 1, 0, -1, 0 };
// const int dy[4] = { 0, 1, 0, -1 };
const int dx[8] = {1, 1, 0,-1,-1,-1, 0, 1};
const int dy[8] = {0, 1, 1, 1, 0,-1,-1,-1};
ll inline digit(ll num){int tmp = 0;while(num){tmp++;num/=10;}return tmp;} // 桁数
template<typename T>inline void print(T&& x){cout<<x<<endl;}// 改行付き出力
template<typename T>inline T SUM(vector<T> vec){return accumulate(all(vec),(T)0);} // vectorの中身を全部足す
template<typename T>inline T digitSum(T num){T sum = 0;while(num){sum+=num%10;num/=10;}return sum;} // 各桁の和
template<typename T>inline T gcd(T a,T b){if(b == 0)return a;return gcd(b,a%b);} // 最大公約数
template<typename T>inline T lcm(T a, T b){T g = gcd(a,b);return a/g*b;} // 最小公倍数
template<typename T>inline T power(T a,T b){T tmp=1;rep(i,b){tmp*=a;}return tmp;} // 累乗
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 ctoi(char c){return c-'0';}
vector<long long> primes(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
if (N/i != i) res.push_back(N/i);
}
}
sort(res.begin(), res.end());
return res;
}
// TODO: write
int main() {
int n;cin>>n;
vector<int> a(n+1);rep(i,n)cin>>a[i+1];
vector<int> b(n+1,0);
vector<int> ans;
for(int i = n;i > 0;--i){
if(b[i]%2 == a[i])continue;
auto p = primes(i);
ans.pb(i);
for(auto&& one: p){
b[one]++;
}
}
print(ans.size());
for(auto&& one: ans){
cout<<one<<" ";
}
cout<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
long long int power(int a,int b)
{
if(b==0)
return 1;
long long int k=power(a,b/2);
if(b%2==0)
return ((k%M)*(k%M))%M;
else
return ((k%M)*(k%M)*(a%M))%M;
}
long long int fact(long long int n)
{
if(n==1 || n==0)
return 1;
else
return ((n%M)*(fact(n-1)%M))%M;
}
int div(int n)
{ int c=0;
for(int i=1;i<sqrt(n);i++)
{
if(n%i==0)
{
c++;
}
}
c=c*2;
if(pow(sqrt(n),2)==(sqrt(n)*sqrt(n)))
c++;
return c;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int n;
cin>>n;
int cmin=32;
for(int i=0;i<n;i++)
{
int h;
cin>>h;
int j;
for(j=0;j<32;j++)
{
if(h&(1<<j))
break;
}
cmin=min(cmin,j);
}
cout<<cmin;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
#define all(x) (x).begin(), (x).end()
#define fsp(x) fixed << setprecision(x)
const ll inf = LLONG_MAX;
const long double pi = acos(-1);
void Yes() {cout << "Yes" << endl;}
void No() {cout << "No" << endl;}
void YES() {cout << "YES" << endl;}
void NO() {cout << "NO" << endl;}
int main() {
//ios::sync_with_stdio(false);
//cin.tie(nullptr);
const ll p = 1e9 + 7;
//const ll p = 998244353;
ll n, a, b;
cin >> n >> a >> b;
vll x(n);
for (ll i = 0; i < n; i++) cin >> x[i];
ll ans = 0;
for (ll i = 0; i < n - 1; i++) ans += min(a * (x[i + 1] - x[i]), b);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long int
main() {
int n;
cin>>n;
int arr[2*n];
for(int i=0; i<2*n; i++){
cin>>arr[i];
}
sort(arr, arr+2*n);
int sum=0;
for(int i=0; i<2*n; i=i+2){
sum+=arr[i];
}
cout<<sum;
return 0;
} | 0 |
#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
int N, K;
vector<int> A;
void simulate() {
int RUI[N + 1];
memset(RUI, 0, sizeof(RUI));
for (int i = 0; i < N; ++i) {
int a = A[i];
int left = max(0, i - a);
int right = min(N - 1, i + a);
RUI[left]++;
RUI[right + 1]--;
}
int sum = 0;
for (int i = 0; i < N; ++i) {
sum += RUI[i];
A[i] = sum;
}
}
int main() {
cin >> N >> K;
int a;
for (int i = 0; i < N; ++i) {
cin >> a;
A.push_back(a);
}
for (int i = 0; i < min(100, K); ++i) {
simulate();
}
for (int i = 0; i < N; ++i) {
cout << A[i];
if (i != N - 1) {
cout << " ";
}
}
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define str string
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define vc vector<char>
#define vvc vector<vc>
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define vvll vector<vll>
#define vvvll vector<vvll>
#define vs vector<str>
#define vvs vector<vs>
#define vpii vector<pii>
#define vvpii vector<vpii>
#define vpll vector<pll>
#define vvpll vector<vpll>
#define vb vector<bool>
#define vvb vector<vb>
#define rep(i, a, b) for (int i = (a); i < int(b); i++)
#define repi(i, a, b) for (int i = (a); i <= int(b); i++)
using namespace std;
ll INF = LONG_LONG_MAX;
ll mod = 1000000000 + 7;
template <typename T, typename L>
void readVector(vector<T> & _data, L & _size, bool _shift) {
_data.resize(_size + (ll)_shift);
for (ll i = (ll)_shift; i < _size + (ll)_shift; i++)
cin >> _data[i];
}
template <typename T, typename L>
void readMatrix(vector<vector<T>> & _data, L & _rows, L & _cols, bool _shiftRows, bool _shiftCols) {
_data.resize(_rows + (ll)_shiftRows);
for (ll i = 0; i < _rows + (ll)_shiftRows; i++)
_data[i].resize(_cols + (ll)_shiftCols);
for (ll i = (ll)_shiftRows; i < _rows + (ll)_shiftRows; i++)
for (ll j = (ll)_shiftCols; j < _cols + (ll)_shiftCols; j++)
cin >> _data[i][j];
}
//TODO: SOLUTION
ll n;
vll a, pre, f, g;
void computeG() {
ll j = n - 2;
g[n - 1] = n;
while (j >= 1) {
int k = g[j + 1];
while (abs(pre[n] - (2*pre[k - 1]) + pre[j - 1]) > abs(pre[n] - (2*pre[k - 2]) + pre[j - 1]))
k--;
g[j] = k;
j--;
}
}
void computeF() {
ll j = 3;
f[2] = 1;
while (j <= n) {
int k = f[j - 1];
while (abs(pre[j] - (2*pre[k])) > abs(pre[j] - (2*pre[k + 1])))
k++;
f[j] = k;
j++;
}
}
void solve() {
cin >> n;
readVector(a, n, 1);
pre.resize(n + 1, 0);
repi(i, 1, n) {
pre[i] = pre[i - 1] + a[i];
}
f.resize(n + 1);
g.resize(n + 1);
computeF();
computeG();
ll ans = INF;
repi(i, 2, n - 2) {
ans = min(ans, max(max(max(pre[f[i]], pre[i] - pre[f[i]]), pre[n] - pre[g[i + 1] - 1]), pre[g[i + 1] - 1] - pre[i])
-min(min(min(pre[f[i]], pre[i] - pre[f[i]]), pre[n] - pre[g[i + 1] - 1]), pre[g[i + 1] - 1] - pre[i]));
}
cout << ans << endl;
}
int main() {
// TODO: Set value of this variable manually
bool _multipleTestCases = false;
if (_multipleTestCases) {
ll t; cin >> t;
while (t--)
solve();
}
else {
solve();
}
return 0;
} | 0 |
#include<iostream>
#include<vector>
using namespace std;
const int MOD=1000000007;
void add(long long &a,long long b){a+=b;if(a>=MOD)a-=MOD;}
int H,W,K;
long long solve(){
--K;
vector<vector<long long> > dp(H+1,vector<long long>(W,0));
dp[0][0]=1;
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
for(int bit=0;bit<1<<(W-1);bit++){
bool ok=true;
for(int k=0;k<W-2;k++){
if((bit&(1<<k))&&(bit&(1<<(k+1)))) ok=false;
}
if(!ok)continue;
int nj=j;
if(bit&(1<<j))nj=j+1;
else if(j>0&&(bit&(1<<(j-1))))nj=j-1;
add(dp[i+1][nj],dp[i][j]);
}
}
}
return dp[H][K];
}
int main(){
while(cin>>H>>W>>K)cout<<solve()<<endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair <int,int> P;
ll dp[105][10];
ll a[10][10];
const ll MOD=1e9+7;
int main(){
int h,w,k;
cin>>h>>w>>k;
for(int bit=0;bit<1<<w-1;bit++){
bool ok=true;
rep(i,w-2){
if((bit&1<<i)&&(bit&1<<i+1)) ok=false;
}
if(!ok) continue;
rep(i,w){
if(i==0&&!(bit&1<<i)||i==w-1&&!(bit&1<<i-1)||!(bit&1<<i)&&!(bit&1<<i-1))
a[i][i]++;
if(i==0) continue;
if(bit&1<<i-1) a[i][i-1]++;
}
}
dp[0][0]=1;
for(int i=1;i<=h;i++){
rep(j,w){
if(j>0) dp[i][j]=(dp[i][j]+dp[i-1][j-1]*a[j][j-1])%MOD;
dp[i][j]=(dp[i][j]+dp[i-1][j]*a[j][j])%MOD;
if(j<w-1) dp[i][j]=(dp[i][j]+dp[i-1][j+1]*a[j+1][j])%MOD;
}
}
cout<<dp[h][k-1]<<endl;
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define se second
#define fi first
const int N=2000005;
int n,m,tot,l,x,y,z,f[N],dis[N],to[N],ne[N],fi[N],zz[N],g[N];
vector<pair<int ,int> > G[N];
vector<int> v;
void jb(int x,int y){
ne[++tot]=fi[x];
fi[x]=tot;
zz[tot]=y;
}
int find(int x){
if (x==f[x])return x;
return f[x]=find(f[x]);
}
void up(int x){
if (x==1)return;
if (dis[f[x]]<dis[f[x/2]]){
swap(f[x],f[x/2]);
swap(g[f[x]],g[f[x/2]]);
up(x/2);
}
}
void down(int x){
int i=x;
if (x*2<=l&&dis[f[x*2]]<dis[f[x]])i=x*2;
if (x*2<l&&dis[f[x*2+1]]<dis[f[i]])i=x*2+1;
if (i!=x){
swap(f[x],f[i]);
swap(g[f[x]],g[f[i]]);
down(i);
}
}
int main(){
scanf("%d%d",&n,&m);
while (m--){
scanf("%d%d%d",&x,&y,&z);
G[z].push_back(mp(x,y));
}
for (int i=1;i<=n;i++)f[i]=i;
int cnt=n;
for (int i=1;i<=1000000;i++){
v.clear();
for (int j=0;j<G[i].size();j++)f[find(G[i][j].fi)]=find(G[i][j].se);
for (int j=0;j<G[i].size();j++)v.push_back(G[i][j].fi),v.push_back(G[i][j].se);
for (int j=0;j<v.size();j++)
if (find(v[j])==v[j])to[v[j]]=++cnt;
for (int j=0;j<v.size();j++)jb(to[find(v[j])],v[j]),jb(v[j],to[find(v[j])]);
for (int j=0;j<v.size();j++)f[v[j]]=v[j];
}
dis[1]=0;
for (int i=2;i<=cnt;i++)dis[i]=1e9;
for (int i=1;i<=cnt;i++)f[i]=g[i]=i;
l=cnt;
for (int i=cnt;i;i--)down(i);
for (int i=1;i<=cnt;i++){
int k=f[1];
f[1]=f[l--];
g[f[1]]=1;
down(1);
for (int j=fi[k];j;j=ne[j])
if (dis[zz[j]]>dis[k]+1){
dis[zz[j]]=dis[k]+1;
up(g[zz[j]]);
}
}
if (dis[n]==1e9)puts("-1");
else printf("%d\n",dis[n]/2);
return 0;
} | #include <bits/stdc++.h>
#define enter putchar('\n')
#define space putchar(' ')
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
typedef pair<int, int> pii;
map<pii, int> M;
vector<pii> E[500005];
set<pii> s;
int n, m, ncnt, d[500005];
template <class T> int read(T &x) {
x = 0; int f = 1; char c = getchar();
while (c > -1 && c < '0' || c > '9') { if (c == '-') f = -1; c = getchar(); }
if (c == -1) return 0;
while (c >= '0' && c <= '9') { x = x * 10 + c - 48; c = getchar(); }
return x *= f, 1;
}
template <class T> void write(T x) {
if (x < 0) x = -x, putchar('-');
if (x > 9) write(x / 10);
putchar(x % 10 + 48);
}
int main() {
while (read(n), read(m)) {
M.clear();
ncnt = n;
for (int i = 1; i <= n; ++i)
E[i].clear();
for (int i = 1; i <= m; ++i) {
int u, v, c;
read(u), read(v), read(c);
if (!M[mp(u, c)]) {
M[mp(u, c)] = ++ncnt;
E[ncnt].clear();
E[ncnt].pb(mp(u, 1));
E[u].pb(mp(ncnt, 1));
}
if (!M[mp(v, c)]) {
M[mp(v, c)] = ++ncnt;
E[ncnt].clear();
E[ncnt].pb(mp(v, 1));
E[v].pb(mp(ncnt, 1));
}
E[M[mp(u, c)]].pb(mp(M[mp(v, c)], 0));
E[M[mp(v, c)]].pb(mp(M[mp(u, c)], 0));
}
fill(d, d + ncnt + 1, -1);
d[1] = 0;
s.insert(mp(d[1], 1));
while (!s.empty()) {
int u = s.begin() -> se;
s.erase(s.begin());
for (int i = 0; i < E[u].size(); ++i) {
int v = E[u][i].fi;
if (d[v] > d[u] + E[u][i].se || d[v] == -1) {
s.erase(mp(d[v], v));
d[v] = d[u] + E[u][i].se;
s.insert(mp(d[v], v));
}
}
}
write(d[n] >> 1), enter;
}
return 0;
} | 1 |
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
typedef long long i64;
int D, len = 0;
i64 pw[20], result = 0;
void work(int x, int L, i64 rest, i64 way) {
if (x == L / 2) {
if (rest == 0) result += way * ((L & 1) ? 10 : 1);
return;
}
if ((L & 1) && x == L / 2) {
work(x + 1, L, rest, way * 9);
} else {
if (pw[L - x - 1] - pw[x] > 0) {
for (int i = -9; i <= 10; ++i) {
if ((pw[L - x - 1] - pw[x]) * i > rest) {
if (i != 10) work(x + 1, L, rest - (pw[L - x - 1] - pw[x]) * i, way * (9 - abs(i) + (x != 0)));
if (i > -9) work(x + 1, L, rest - (pw[L - x - 1] - pw[x]) * (i - 1), way * (9 - abs(i - 1) + (x != 0)));
break;
}
}
} else {
for (int i = 9; i >= -10; --i) {
if ((pw[L - x - 1] - pw[x]) * i > rest) {
if (i != -10) work(x + 1, L, rest - (pw[L - x - 1] - pw[x]) * i, way * (9 - abs(i) + (x != 0)));
if (i < 9) work(x + 1, L, rest - (pw[L - x - 1] - pw[x]) * (i + 1), way * (9 - abs(i + 1) + (x != 0)));
break;
}
}
}
}
}
int main() {
scanf("%d", &D);
pw[0] = 1;
for (int i = 1; i < 20; ++i) pw[i] = pw[i - 1] * 10;
for (int i = 18; i; --i)
work(0, i, D, 1);
printf("%lld\n", result);
return 0;
}
| #include<bits/stdc++.h>
#define fo(i,a,b) for(i=a;i<=b;i++)
#define fd(i,a,b) for(i=a;i>=b;i--)
#define min(a,b) (a<b?a:b)
#define max(a,b) (a>b?a:b)
typedef long long ll;
using namespace std;
int d,k,L,i,j,ten[15],a[25];
int s[25],mx,f[25];ll ans,an;
void dfs(int x,ll now){
if (L-x>=k-1&&abs(now)>=10) return;
if (now<0) return;
int i;
if (x>mx){
an=a[s[1]+9]-(s[1]<=0);
if (L&1) an*=10-(L==1);
s[L]=-s[1];
fo(i,2,mx) an*=a[s[i]+9],s[L-i+1]=-s[i];
ll p=0;
fd(i,L,1){
p=p*10+s[i];
if (p>d) return;
}if (p==d) ans+=an;
return;
}
fo(i,-9,9) s[x]=i,dfs(x+1,now*10-i);
}
int main(){
ten[0]=1;
fo(i,1,9) ten[i]=ten[i-1]*10;
scanf("%d",&d);
fo(i,1,9) if (d<ten[i]) break;
k=i+1;
fo(i,0,9)
fo(j,0,9) a[i-j+9]++;
fo(L,2,k<<1){
mx=L>>1;
memset(s,0,sizeof(s));
dfs(1,0);
}
printf("%lld\n",ans);
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define all(n) begin(n), end(n)
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef unsigned long long ull;
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>
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...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type
fill_v(T &t, const V &v) { t = v; }
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type
fill_v(T &t, const V &v)
{
for (auto &e : t)
fill_v(e, v);
}
int main()
{
int N,K;
cin>>N>>K;
vector<long double> p(N),psum(N);
for (size_t i = 0; i < N; i++)
{
long double q;
cin>>q;
p[i]=(q+(long double)1)/(long double)2;
}
partial_sum(all(p),psum.begin());
long double ans = psum[K-1];
for (size_t i = 0; i+K < N; i++)
{
chmax(ans,psum[i+K]-psum[i]);
}
cout<<setprecision(30)<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9+7;
#define REP(i,n) for (int i = 0; i <(n); ++i)
//debug
#ifdef _DEBUG
#define debug(var) do{cout << #var << " :";view(var);}while(0)
#else
#define debug(...)
#endif
template<typename T> void view(T e){cout << e << endl;}
template<typename T> void view(const vector<T>& v){for(const auto& e : v){ cout << e << " "; } cout << endl;}
template<typename T> void view(const vector<vector<T> >& vv){ for(const auto& v : vv){ view(v); } }
int main(){
//in
int n, k;
cin >> n >> k;
vector<int> p(n);
REP(i,n) cin >> p[i];
//
int ex = 0;
//前処理
REP(i,k){
int px = p[i]+1;
ex += px;
}
int exmax = ex;
REP2(i,k,n){
ex -= p[i-k];
ex += p[i];
exmax = max(ex,exmax);
}
double ans = (double)exmax/2;
cout << fixed << setprecision(10) << ans << endl;
return 0;
} | 1 |
#include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>
using namespace std;
#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };
int main() {
int length[10];
int v1;
int v2;
char comma;
while (cin>>length[0]>>comma>> length[1]>>comma>> length[2]>>comma>> length[3]>>comma>> length[4]>>comma>> length[5]>>comma>> length[6]>>comma>> length[7]>>comma>> length[8]>>comma>>length[9]>>comma>>v1>>comma>>v2){
double sum=0;
REP(i,10)
sum += length[i];
double time = sum / (double)(v1+v2);
double go=time*(double)v1;
REP(i,10){
if (go <= (double)length[i] + 1e-10){
cout<<(i+1)<<endl;
break;
}else
go -= (double)length[i];
}
}
return 0;
} | #include <iostream>
using namespace std;
int main(){
double t[10], a, b;
char c;
while(cin >> t[0] >> c){
for(int i = 1;i< 10;i++){cin >> t[i] >> c;t[i] += t[i-1];}
cin >> a >> c >> b;
double tmp = t[9]/(a+b)*a;
int ans = 1;
while(tmp > t[ans-1])ans++;
cout << ans << endl;
}
return 0;
} | 1 |
// C++ 14
#include <bits/stdc++.h>
using namespace std;
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) { os << "["; for (int i = 0; i < v.size(); ++i) { os << v[i]; if (i != v.size() - 1) os << ", "; } os << "]"; return os; }
template <typename T> void print(T v, string s = "\n") { cout << v << s; }
template <typename T> void in(T &v) { cin >> v; }
#define ll long long
#define loop(__x, __start, __end) for(int __x = __start; __x < __end; __x++)
int main() {
int n, m; in(n),in(m);
vector<bool> ac(n+1, false);
vector<int> wa(n+1, 0);
int p; string s;
loop(i,0,m) {
in(p),in(s);
if (ac[p]) continue;
if (s == "WA") wa[p]++;
else ac[p] = true;
}
loop(p,1,n+1) if (!ac[p]) wa[p] = 0;
int ans1 = 0;
for (auto&&b: ac) ans1+=b;
int ans2 = 0;
for (auto&&w: wa) ans2+=w;
print(ans1, " ");
print(ans2);
return 0;
}
| #include"bits/stdc++.h"
using namespace std;
const int N=5e3+100;
typedef long long LL;
struct node{
LL h,p;
}a[N];
LL dp[N];
bool cmp(node a,node b){
if(a.h+a.p==b.h+b.p)return a.h<b.h;
return a.h+a.p<b.h+b.p;
}
int main()
{
int n;
scanf("%d",&n);
for(int i=0;i<=5050;i++)dp[i]=0x3f3f3f3f3f3f3f3f;
for(int i=1;i<=n;i++)
scanf("%d %d",&a[i].h,&a[i].p);
sort(a+1,a+n+1,cmp);
dp[0]=0;
for(int i=1;i<=n;i++){
for(int j=i-1;j>=0;j--){
if(a[i].h>=dp[j]){
dp[j+1]=min(dp[j+1],dp[j]+a[i].p);
}
}
}
int ans=1;
for(int i=2;i<=n;i++)
if(dp[i]!=0x3f3f3f3f3f3f3f3f)ans=i;
printf("%d\n",ans);
} | 0 |
#include <iostream>
using namespace std;
int fld[100][100];//[横][縦]
int Dx[4]={0,-1,0,1};
int Dy[4]={1,0,-1,0};
bool ans[1000];
int counter=0;
bool flag=true;
void dfs(int x,int y,int w,int h,int c){//スタート地点と色を与える
fld[x][y]=-1;
for(int i=0;i<4;i++){
int nx=x+Dx[i],ny=y+Dy[i];//範囲内にある必要あり
if(nx>=0 && nx<w && ny>=0 && ny<h){
if(fld[nx][ny]==c)//同色についてのみ継続
dfs(nx,ny,w,h,c);
}
}
}//色の塗り替え
void solve(){
int w,h,xs,ys,xg,yg,n;
cin >> w>>h;
if(w==0) {flag=false;counter--; return;}
cin >>xs>>ys>>xg>>yg>>n;//start,goal座標は-1する
xs--;ys--;xg--;yg--;
for(int i=0;i<w;i++){//fieldの初期化0~w-1
for(int j=0;j<h;j++){//0~h-1
fld[i][j]=0;//0は何も無い
}
}
for(int i=0;i<n;i++){
int color,drc,x,y;
cin >>color>>drc>>x>>y;
x--;y--;
if(drc==0){
for(int dx=0;dx<4;dx++){
for(int dy=0;dy<2;dy++){
fld[x+dx][y+dy]=color;
}
}
}
if(drc==1){
for(int dy=0;dy<4;dy++){
for(int dx=0;dx<2;dx++){
fld[x+dx][y+dy]=color;
}
}
}
}//fieldの色塗り
if(fld[xs][ys]!=fld[xg][yg]) {
ans[counter]=false;
return;
}
if(fld[xs][ys]==0){
ans[counter]=false;
return;
}
dfs(xs,ys,w,h,fld[xs][ys]);//塗り替え
if(fld[xg][yg]==-1) ans[counter]=true;
else ans[counter]=false;
return;
}
int main(){
while(flag){
solve();
counter++;
}
for(int i=0;i<counter;i++){
if(ans[i]) cout << "OK"<<endl;
else cout << "NG" << endl;
}
} | #include<iostream>
#include<vector>
#include<queue>
#include<map>
using namespace std;
int n,m;
map<int,vector<pair<int,int> > >G[1<<17];
map<int,int>d[1<<17];
main()
{
cin>>n>>m;
for(int i=0;i<m;i++)
{
int a,b,c;cin>>a>>b>>c;
G[a][c].push_back(make_pair(b,c));
G[b][c].push_back(make_pair(a,c));
G[a][c].push_back(make_pair(a,0));
G[b][c].push_back(make_pair(b,0));
G[a][0].push_back(make_pair(b,c));
G[b][0].push_back(make_pair(a,c));
}
priority_queue<pair<int,pair<int,int> > >P;
d[1][0]=0;
P.push(make_pair(0,make_pair(1,0)));
while(!P.empty())
{
int dis=-P.top().first;
int u=P.top().second.first;
int c=P.top().second.second;
P.pop();
if(u==n&&c==0)
{
cout<<dis<<endl;
return 0;
}
if(d[u][c]<dis)continue;
for(pair<int,int>&p:G[u][c])
{
int v=p.first;
int cost=dis+!c;
int col=p.second;
if(d[v].find(col)==d[v].end()||d[v][col]>cost)
{
d[v][col]=cost;
P.push(make_pair(-cost,make_pair(v,col)));
}
}
}
cout<<-1<<endl;
} | 0 |
#include<iostream>
using namespace std;
int main() {
int n;
cin >> n;
int p[100] = {};
for (int i = 0;i < n*(n - 1) / 2;i++) {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (c > d)p[a - 1] += 3;
else if (c < d)p[b - 1] += 3;
else {
p[a - 1]++;
p[b - 1]++;
}
}
int ans[100];
for (int i = 0;i < n;i++) {
int a = 0;
for (int j = 0;j < n;j++) {
if (p[i] < p[j])a++;
}
ans[i] = a + 1;
}
for (int i = 0;i < n;i++)cout << ans[i] << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <sstream>
#include <functional>
#include <numeric>
#include <cmath>
#include <cstring>
#include <queue>
using namespace std;
int n;
const int INF = 1 << 29;
typedef pair<int,int> P;
vector<P> teams;
bool sortSecond(const P& p1, const P& p2)
{
if(p1.second != p2.second) return p1.second < p2.second;
if(p1.first != p2.first) return p1.first < p2.first;
return false;
}
int main(void)
{
while(cin >> n && n)
{
teams.resize(n);
for (int i = 0; i < n; i++)
{
teams[i] = P(0, i);
}
for (int i = 0, leags = n * (n - 1) / 2; i < leags; i++)
{
int a, b, c, d;
cin >> a >> b >> c >> d;
if(c == d)
{
teams[a - 1].first++;
teams[b - 1].first++;
}
else if(c > d) teams[a - 1].first += 3;
else teams[b - 1].first += 3;
}
sort(teams.begin(), teams.end(), greater<P>());
int hikiwake = 0;
for (int i = 0; i < n; i++)
{
int tmp = teams[i].first;
teams[i].first = i + 1 - hikiwake;
if(i + 1 < n && tmp == teams[i + 1].first)
{
hikiwake++;
}
else hikiwake = 0;
}
sort(teams.begin(), teams.end(), sortSecond);
for (int i = 0; i < n; i++)
{
cout << teams[i].first << endl;
}
}
return 0;
} | 1 |
// ref. https://img.atcoder.jp/dwacon5th-prelims/editorial.pdf
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <unordered_map>
#include <vector>
#include <string.h>
#include <set>
using namespace std;
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
template<class T> void printvec(const vector<T>& v) {
for (auto x : v) { cout << x << " "; }
cout << endl;
}
template<class T> void printtree(const vector< vector<T> >& tree) {
for (long long i = 0; i < tree.size(); ++i) {
cout << i + 1 << ": "; printvec(tree[i]);
}
}
template<class T, class U> void printmap(const map<T, U>& mp) {
for (auto x : mp) { cout << x.first << "=>" << x.second << endl; }
}
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
#define rep(i, n) for(ll i = 0; i < n; ++i)
#define all(s) s.begin(), s.end()
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> triple;
typedef double D;
const ll INF = 1e9;
const ll MOD = 1000000007; // 1e9 + 7
ll n;
string s;
ll solve(ll k) {
ll d_cnt = 0, m_cnt = 0;
ll now = 0; // current contribution
ll ans = 0;
rep(i, n) {
// At first, decrease from i-k
if (i >= k) {
char target = s[i-k];
if (target == 'D') {
--d_cnt;
now -= m_cnt; // decrease contribution by this D
} else if (target == 'M') {
--m_cnt;
} else {
// Do nothing
}
}
// Next, add contribution from i
if (s[i] == 'D') {
++d_cnt;
} else if (s[i] == 'M') {
++m_cnt;
now += d_cnt; // increase contribution by this M
// cout << "d_cnt:" << d_cnt << endl;
} else if (s[i] == 'C') {
// cout << "now:" << now << endl;
ans += now;
}
}
return ans;
}
int main(int argc, char** argv) {
cin.tie(NULL);
cout.tie(NULL);
ios_base::sync_with_stdio(false);
//cout << setprecision(10) << fixed;
cin >> n;
cin >> s;
ll q;
cin >> q;
rep(iter, q) {
ll k;
cin >> k;
ll ans = solve(k);
cout << ans << endl;
}
}
| #include<stdio.h>
int main(){
int stu[501];
int ls[2][10001];
int c,n,m,i,j;
for(;;){
c=0;
for(i=0;i<501;i++)stu[i]=0;
scanf("%d",&n);
scanf("%d",&m);
if(n==0)break;
for(i=0;i<m;i++){
scanf("%d%d", &ls[0][i], &ls[1][i]);
if(ls[0][i]==1)stu[ls[1][i]]=2;
if(ls[1][i]==1)stu[ls[0][i]]=2;
}
for(i=1;i<n+1;i++){
if(stu[i]==2){
for(j=0;j<m;j++){
if(ls[0][j]==i){
if(stu[ls[1][j]]==2){}
else stu[ls[1][j]]=1;
}
if(ls[1][j]==i){
if(stu[ls[0][j]]==2){}
else stu[ls[0][j]]=1;
}
}
}
}
stu[1]=0;
for(i=1;i<n+1;i++)if(stu[i]==1 || stu[i]==2)c++;
printf("%d\n",c);
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
bool gt(int h1,int w1,int h2,int w2) {
return h1*h1+w1*w1>h2*h2+w2*w2||(h1*h1+w1*w1==h2*h2+w2*w2&&h1>h2);
}
int main() {
int h,w;
while(scanf("%d %d",&h,&w),h) {
int ans_h=514,ans_w=514;
for(int H=1;H<=150;H++) {
for(int W=H+1;W<=150;W++) {
if(gt(H,W,h,w)&>(ans_h,ans_w,H,W)) {
ans_h=H,ans_w=W;
}
}
}
printf("%d %d\n",ans_h,ans_w);
}
} | #include<iostream>
#include<string>
using namespace std;
bool primenumver(int a){
for (int b = 2;; b += 2) {
if (a%b == 0)return false;
if ((b + 1)*(b+ 1) >a)return true;
if (b == 2)b--;
}
}
int main()
{
while (1) {
int a;
cin >> a;
if (a == 0)break;
if (a % 2 == 0) {
for (int b = a-1;; b -= 2) {
if (primenumver(b) && primenumver(b - 2)) { cout << b - 2 << " " << b<<endl; break; }
}
}
else {
for (int b = a;; b -= 2) {
if (primenumver(b) && primenumver(b - 2)) { cout << b - 2 << " " << b<<endl; break; }
}
}
}
} | 0 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
//配列以外の入力を受け取る
void read(){
}
template<typename First, typename... Rest>
void read(First& first, Rest&... rest){
cin >> first;
read(rest...);
}
//配列を区切って出力する
template<typename T>
void write_vec(vector<T>& v, char divider){
for(size_t i = 0; i < v.size(); i++){
cout << v[i] << divider;
}
}
};
int main(){
Stream io;
int A, B, C, D;
io.read(A, B, C, D);
string ans;
if(A + B < C + D){
ans = "Right";
}
else if(A + B == C + D){
ans = "Balanced";
}
else{
ans = "Left";
}
cout << ans;
return 0;
} | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))
using namespace std;
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=1e9+7;
int main()
{
ll n,m;
cin >> n >> m;
vector<ll> dv;
for(ll i=1;i*i<=m;i++){
if(m%i==0){
if(i*i==m){
dv.push_back(i);
}
else{
dv.push_back(i);
dv.push_back(m/i);
}
}
}
sort(dv.begin(),dv.end());
auto it=lower_bound(dv.begin(),dv.end(),n)-dv.begin();
cout << m/dv[it] << endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define MAXN 2005
#define open(s) freopen( s".in", "r", stdin ), freopen( s".out", "w", stdout )
#define fp( i, b, e ) for ( int i(b), I(e); i <= I; ++i )
#define fd( i, b, e ) for ( int i(b), I(e); i >= I; --i )
#define go( i, b ) for ( int i(b), v(to[i]); i; v = to[i = nxt[i]] )
template<typename T> inline void cmax( T &x, T y ){ x < y ? x = y : x; }
template<typename T> inline void cmin( T &x, T y ){ y < x ? x = y : x; }
#define getchar() ( p1 == p2 && ( p1 = bf, p2 = bf + fread( bf, 1, 1 << 21, stdin ), p1 == p2 ) ? EOF : *p1++ )
char bf[1 << 21], *p1(bf), *p2(bf);
template<typename T>
inline void read( T &x ){ char t(getchar()), flg(0); x = 0;
for ( ; !isdigit(t); t = getchar() ) flg = t == '-';
for ( ; isdigit(t); t = getchar() ) x = x * 10 + ( t & 15 );
flg ? x = -x : x;
}
clock_t t_bg, t_ed;
int N, M, Q;
int s[MAXN][MAXN];
int s1[MAXN][MAXN], s2[MAXN][MAXN];
#define sum( s, a, b, c, d ) ( s[c][d] + s[a-1][b-1] - s[c][b-1] - s[a-1][d] )
int main(){
t_bg = clock();
read(N), read(M), read(Q);
fp( i, 1, N ) fp( j, 1, M ){
while( (s[i][j] = getchar()) != '0' && s[i][j] != '1' );
s[i][j] &= 1;
}
fp( i, 1, N ) fp( j, 1, M - 1 ) s1[i][j] = s1[i][j - 1] + s1[i - 1][j] - s1[i - 1][j - 1] + (s[i][j] & s[i][j + 1]);
fp( i, 1, N - 1 ) fp( j, 1, M ) s2[i][j] = s2[i][j - 1] + s2[i - 1][j] - s2[i - 1][j - 1] + (s[i][j] & s[i + 1][j]);
fp( i, 1, N ) fp( j, 1, M ) s[i][j] += s[i][j - 1] + s[i - 1][j] - s[i - 1][j - 1];
while( Q-- ){
int a, b, c, d;
read(a), read(b), read(c), read(d);
printf( "%d\n", sum(s, a, b, c, d) - sum(s1, a, b, c, d - 1) - sum(s2, a, b, c - 1, d) );
}
t_ed = clock();
fprintf( stderr, "\n========info========\ntime : %.3f\n====================\n", (double)( t_ed - t_bg ) / CLOCKS_PER_SEC );
return 0;
}
| #include <bits/stdc++.h>
#define MOD 1000000007
int ri() {
int n;
scanf("%d", &n);
return n;
}
int main() {
int n = ri();
int m = ri();
int q = ri();
std::string s[n];
for (int i = 0; i < n; i++) std::cin >> s[i];
std::vector<std::vector<int> > k(n + 1, std::vector<int>(m + 1));
std::vector<std::vector<int> > yok(n, std::vector<int>(m + 1));
std::vector<std::vector<int> > tat(n + 1, std::vector<int>(m));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (s[i][j] == '1') {
k[i + 1][j + 1]++;
if (i + 1 < n && s[i + 1][j] == '1') yok[i + 1][j + 1]++;
if (j + 1 < m && s[i][j + 1] == '1') tat[i + 1][j + 1]++;
}
}
}
for (int i = 1; i < n; i++) {
for (int j = 1; j <= m; j++) {
k[i + 1][j] += k[i][j];
if (j < m) tat[i + 1][j] += tat[i][j];
if (i + 1 < n) yok[i + 1][j] += yok[i][j];
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j < m; j++) {
k[i][j + 1] += k[i][j];
if (i < n) yok[i][j + 1] += yok[i][j];
if (j + 1 < m) tat[i][j + 1] += tat[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j <= m; j++) {
std::cerr << yok[i][j] << " ";
}
std::cerr << std::endl;
}
for (int i = 0; i < q; i++) {
int x1 = ri() - 1, y1 = ri() - 1, x2 = ri() - 1, y2 = ri() - 1;
int res = k[x2 + 1][y2 + 1] - k[x2 + 1][y1] - k[x1][y2 + 1] + k[x1][y1];
res -= yok[x2][y2 + 1] - yok[x1][y2 + 1] - yok[x2][y1] + yok[x1][y1];
res -= tat[x2 + 1][y2] - tat[x1][y2] - tat[x2 + 1][y1] + tat[x1][y1];
std::cout << res << std::endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define mset(a, b) memset(a, b, sizeof(a))
#define mcpy(a, b) memcpy(a, b, sizeof(a))
#define sor(a, l, r) sort(a + l, a + r + 1);
#define reve(a, l, r) reverse(a + l, a + r + 1)
using namespace std;
typedef long long LL;
const int N = 205;
const int MAXN = 100005;
template <typename T> inline void read(T &AKNOI) {
T x = 0, flag = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') flag = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
AKNOI = flag * x;
}
namespace ModCalculator {
const int MOD = 1e9 + 7;
inline void Inc(int &x, int y) {
x += y; if (x >= MOD) x -= MOD;
}
inline void Dec(int &x, int y) {
x -= y; if (x < 0) x += MOD;
}
inline int Add(int x, int y) {
Inc(x, y); return x;
}
inline int Sub(int x, int y) {
Dec(x, y); return x;
}
inline int Mul(int x, int y) {
return 1LL * x * y % MOD;
}
}
using namespace ModCalculator;
int n, X, a[N];
int dp[2][MAXN];
void init() {
read(n); read(X);
for (int i = 1; i <= n; ++i) {
read(a[i]);
}
sor(a, 1, n);
}
void solve() {
int pre = 0, cur = 1;
dp[pre][X] = 1;
int ans = 0;
for (int i = n; i >= 1; --i) {
mset(dp[cur], 0);
for (int j = 0; j <= X; ++j) {
Inc(dp[cur][j], Mul(dp[pre][j], i - 1));
Inc(dp[cur][j % a[i]], dp[pre][j]);
}
swap(pre, cur);
}
for (int i = 1; i <= X; ++i) {
Inc(ans, Mul(i, dp[pre][i]));
}
printf("%d\n", ans);
}
int main() {
init();
solve();
return 0;
}
| #include<iostream>
#include<vector>
#include<cstring>
#include<algorithm>
using namespace std;
const int N_MAX = 100;
const int INF = 1000000;
struct edge{
int to, cap, rev;
edge(int t, int c, int r): to(t), cap(c), rev(r){}
};
vector<edge> G[N_MAX * 2];
bool used[N_MAX * 2];
void add_edge(int from, int to, int cap){
G[from].emplace_back(to, cap, G[to].size());
G[to].emplace_back(from, 0, G[from].size()-1);
}
int dfs(int v, int t, int f){
if (v == t) return f;
used[v] = true;
for(int i = 0; i < G[v].size(); i++){
edge &e = G[v][i];
if (!used[e.to] && e.cap > 0){
int d = dfs(e.to, t, min(f, e.cap));
if (d > 0){
e.cap -= d;
G[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
int max_flow(int s, int t){
int flow = 0;
for(;;){
memset(used, 0, sizeof(used));
int f = dfs(s, t, INF);
if (f == 0) return flow;
flow += f;
}
}
int main(){
int n;
cin >> n;
vector<pair<int, int>> RED;
vector<pair<int, int>> BLUE;
for(int i = 0; i < n; i++){
int a, b;
cin >> a >> b;
RED.emplace_back(a, b);
}
for(int i = 0; i < n; i++){
int c, d;
cin >> c >> d;
BLUE.emplace_back(c, d);
}
for(int i = 1; i <= n; i++){
int a = RED[i-1].first, b = RED[i-1].second;
for(int j = 1; j <= n; j++){
int c = BLUE[j-1].first, d = BLUE[j-1].second;
if (a < c && b < d){
add_edge(i, n+j, 1);
}
}
}
for(int i = 1; i <= n; i++){
add_edge(0, i, 1);
add_edge(n+i, 2 * n + 1, 1);
}
cout << max_flow(0, 2 * n + 1) << endl;
return 0;
} | 0 |
#include <iostream>
#include <regex>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
regex rx(R"(^A[a-z][a-z]*?C[a-z]*?[a-z]$)");
if (regex_match(S, rx)) {
printf("AC\n");
} else {
printf("WA\n");
}
}
| #include <stdio.h>
#define N 200002
char s[N], x, y;
int p[N];
int main()
{
int i, j, tp, l;
s[0] = 0;
scanf("%s", s + 1);
for(i = 1, j = 0; s[i]; j = i++){
p[i] = j;
}
p[i] = j, l = i - 1;
for(i = 2; x = s[i]; i++){
if(x == 'T'){
if(s[tp = p[i]] == 'S'){
l -= 2;
p[i + 1] = p[tp];
}
}
}
printf("%d\n", l);
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
int x[n];
for(int i=0;i<n;i++){
cin >> x[i];
}
sort(x,x+n,greater<int>());
int sum=0;
for(int i=0;i<k;i++){
sum+=x[i];
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repn(i,n) for(int i = 0; i <= (int)(n); i++)
#define srep(i,l,n) for(int i = l; i < (int)(n); i++)
#define srepn(i,l,n) for(int i = l; i <= (int)(n); i++)
#define drep(i,n) for(int i = (int)(n-1); i >= 0; i--)
#define drepn(i,n) for(int i = (int)(n); i >= 0; i--)
#define size(s) (int)s.size()
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std::vector<T>& v){for(const auto& e : v){ std::cout << e << " "; } std::cout << std::endl;}
template<typename T> void view(const std::vector<std::vector<T> >& vv){ for(const auto& v : vv){ view(v); } }
template<typename T> inline istream& operator>>(istream &i, vector<T> &v) {rep(j, size(v)) i >> v[j]; return 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; }
template<class T> T gcd(T a, T b) {if(b==0)return a; else return gcd(b,a%b);}
template<class T> T lcm(T a, T b) {return a/gcd(a,b)*b;}
template<class T = int> using V = vector<T>;
template<class T = int> using VV = vector<V<T>>;
bool isIn(int i, int j, int h, int w) {return i >= 0 && i < h && j >= 0 && j < w;}
void Yes(){cout << "Yes" << endl;}
void No(){cout << "No" << endl;}
void YES(){cout << "YES" << endl;}
void NO(){cout << "NO" << endl;}
void err() {cout << -1 << endl;}
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
#define ep emplace_back
const int MOD = 1000000007;
const int INF = 1e9;
#define PI acos(-1);
int dx[4] = {1,-1,0,0};
int dy[4] = {0,0,1,-1};
int ddx[8] = {1,1,1,-1,-1,-1,0,0};
int ddy[8] = {0,1,-1,0,1,-1,1,-1};
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
V<> a(n);
cin >> a;
sort(rall(a));
int ans = accumulate(a.begin(), a.begin() + k, 0);
cout << ans << endl;
} | 1 |
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
struct edge{
int to;
int cap;
int rev;
};
struct Dinic{
int V;
vector<int> level, used;
vector<vector<edge>> G;
Dinic(int N){
V = N;
used.resize(V, 0);
level.resize(V, -1);
G.resize(V);
}
void add(int u, int v, int c){
edge e1 = {v, c, (int)G[v].size()};
G[u].push_back(e1);
edge e2 = {u, 0, (int)G[u].size() - 1};
G[v].push_back(e2);
}
void bfs(int s){
level.assign(V, -1);
queue<int> q;
q.push(s);
level[s] = 0;
while(!q.empty()){
int v = q.front();
q.pop();
for(edge e: G[v]){
if(e.cap > 0 && level[e.to] < 0){
level[e.to] = level[v] + 1;
q.push(e.to);
}
}
}
}
int dfs(int s, int t, int f){
if(s == t) return f;
for(int &i = used[s]; i < (int)G[s].size(); i++){
edge &e = G[s][i];
if(e.cap > 0 && level[e.to] > level[s]){
int d = dfs(e.to, t, min(f, e.cap));
if(d > 0){
e.cap -= d;
G[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
int solve(int s, int t){
int flow = 0;
int INF = 1e9;
while(1){
bfs(s);
if(level[t] < 0) return flow;
used.assign(V, 0);
int f;
while((f = dfs(s, t, INF)) > 0) flow += f;
}
}
};
int main(){
int N;
cin >> N;
Dinic Ford(2 * N + 2);
int can[N][N];//can[i][j] = 1でペアが作れる
vector<int> a(N), b(N), c(N), d(N);
for(int i = 0; i < N; i++) cin >> a[i] >> b[i];
for(int i = 0; i < N; i++) cin >> c[i] >> d[i];
for(int i = 0; i < N; i++){
for(int j = 0; j < N; j++){
if(a[i] < c[j] && b[i] < d[j]) can[i][j] = 1;
else can[i][j] = 0;
}
}
for(int i = 0; i < N; i++){
Ford.add(2 * N, i, 1);
Ford.add(N + i, 2 * N + 1, 1);
}
for(int i = 0; i < N; i++){
for(int j = 0; j < N; j++){
if(can[i][j]) Ford.add(i, N + j, 1);
}
}
int ans = Ford.solve(2 * N, 2 * N + 1);
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<pair<int,int>> ab(n),cd(n);
for(int i=0;i<n;++i){
int a,b;
cin >> a >> b;
ab[i]=make_pair(b,a);
}
for(int i=0;i<n;++i){
int c,d;
cin >> c >> d;
cd[i]=make_pair(c,d);
}
sort(ab.begin(),ab.end(),greater<pair<int,int>>());
sort(cd.begin(),cd.end());
vector<bool> f(n,false);
int cnt=0;
for(int i=0;i<n;++i){
int c=cd[i].first;
int d=cd[i].second;
for(int j=0;j<n;++j){
int b=ab[j].first;
int a=ab[j].second;
if(f[j])continue;
if(a<c && b<d){
f[j]=true;
cnt++;
break;
}
}
}
//int cnt=0;
//for(int i=0;i<n;++i)if(f[i])cnt++;
cout << cnt << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(b) - 1;i>=(a);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define RREP(i,n) for(int i=n-1;i>=0;i--)
#define PB push_back
#define INF (1<<29)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define CLR(a) memset(a,0,sizeof(a))
const int dx[] = {-1,0,0,1},dy[] = {0,1,-1,0};
typedef long long int ll;
using namespace std;
int main(){
vector<int> w(10);
vector<int> k(10);
REP(i,10){
cin >> w[i];
}
REP(i,10){
cin >> k[i];
}
sort(RALL(w));
sort(RALL(k));
printf("%d %d\n",w[0]+w[1]+w[2],k[0]+k[1]+k[2]);
return 0;
} | #include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int h, w,n,tmp=0;
cin >> h >> w >> n;
REP(i, max(h,w)) {
tmp += max(h, w);
if (n <= tmp) {
cout << i << endl;
return 0;
}
}
return 0;
}
| 0 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <functional>
#include <numeric>
using namespace std;
using lint = int64_t;
using P = pair<int, int>;
using D = pair<double, double>;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define repn(i, a, b) for(int i = (a); i < (b); ++i)
#define Rep(i, n) for (int i = (n); i >= 0; --i)
#define All(vec) vec.begin(), vec.end()
#define cend printf("\n")
//constexpr lint mod = 998'244'353LL;
constexpr lint mod = 1000'000'007LL;
constexpr lint inf = 3LL * mod * mod;
const double Pi = 2.0 * acos(0.0);
template<class T> using prique = priority_queue<T>;
template<class T> using prique_inv = priority_queue<T, vector<T>, greater<T>>;
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& rhs) { return is >> rhs.first >> rhs.second; }
template<class T, class U>inline ostream& operator<<(ostream& os, const pair<T, U>& rhs) { return os << rhs.first << " " << rhs.second << "\n"; }
template<class InputIterator> void arrin(InputIterator first, InputIterator last) { for (; first != last; ++first) cin >> (*first); }
template<class InputIterator> void arrout(InputIterator first, InputIterator last) {
for (; first != last; ++first) {
cout << (*first) << " ";
}
cout << "\n";
}
constexpr bool pri(lint x) { for (lint i = 2; i * i <= x; ++i) if (x % i == 0) return false; return 1 < x; }
inline double dis(D a, D b) { return hypot(a.first - b.first, a.second - b.second); }
lint fact[3000000];
void fact_init(lint n) {
if (3000000 <= n) return;
fact[0] = fact[1] = 1;
for (lint i = 2; i <= n; ++i) {
fact[i] = i * fact[i - 1];
if (mod <= fact[i]) fact[i] %= mod;
}
}
lint modpow(lint x, lint n, lint m = mod) {
lint res = 1;
while (n > 0) {
if (n & 1) {
res *= x;
if (m <= res) res %= m;
}
x *= x;
if (m <= x) x %= m;
n >>= 1;
}
return res;
}
lint intpow(lint x, lint n) {
lint res = 1;
while (n > 0) {
if (n & 1) res *= x;
x *= x;
n >>= 1;
}
return res;
}
lint comb(lint n, lint r) {
if (r == 0 || r == n) return 1;
lint res = fact[n] * modpow(fact[n - r], mod - 2) % mod * modpow(fact[r], mod - 2) % mod;
return res < 0 ? res + mod : res;
}
map<lint, lint> factring(lint n) {
map<lint, lint> res;
for (lint i = 2; i * i <= n; ++i) {
while (n % i == 0) {
n /= i;
++res[i];
}
}
if (n != 1) ++res[n];
return res;
}
int n, k;
bool f(vector<int>& a) {
vector<int>b(n + 1);
rep(i, n) {
b[max(0, i - a[i])]++;
b[min(n, i + a[i] + 1)]--;
}
rep(i, n) {
b[i + 1] += b[i];
}
bool res = true;
rep(i, n) {
a[i] = b[i];
res &= (a[i] == n);
}
return res;
}
int main() {
cin >> n >> k;
vector<int>a(n);
rep(i, n) {
cin >> a[i];
}
rep(i, k) {
if (f(a)) break;
}
for (int e : a) cout << e << " ";
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int K,X;
cin>>K>>X;
for(int i=0;i<2*K-1;i++){
cout<<X-K+1+i<<" ";
}
cout<<endl;
}
| 0 |
//
// Created by TakahiroYamaji on 2020/08/13.
//
#include<iostream>
#include<queue>
typedef long long ll;
int D;
ll G;
int p[11];
ll c[11];
ll solve(int i){
ll ans = 0;
ll sum = 0;
std::priority_queue<ll>P;
for (int j=0;j<D;j++){
//std::cout << j << std::endl;
if (i & (1 << j)){
sum += (j + 1) * 100 * p[j] + c[j];
ans += p[j];
}else{
P.push(j);
}
}
//微調整
while (!P.empty()){
int s = P.top();
P.pop();
for (int i=1;i<=p[s];i++){
if (sum >= G){
return ans;
}
ans++;
sum += (s + 1) * 100;
}
}
//std::cout << sum << std::endl;
if (sum >= G){
return ans;
}else{
return 1e12;
}
}
int main(){
std::cin >> D >> G;
for (int i=0;i<D;i++){
std::cin >> p[i] >> c[i];
}
ll min_v = 1e15;
//bit 全探索
for (int i=0;i<(1 << D);i++){
ll ans1 = solve(i);
//std::cout << ans1 << std::endl;
if (min_v > ans1){
min_v = ans1;
}
}
std::cout << min_v << std::endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int soredake(int point, int kazu, int bonasu, int goal) {
int tokukazu = goal / point;
if (goal % point > 0) {
tokukazu++;
}
if (tokukazu > kazu) {
tokukazu = kazu;
}
return tokukazu;
}
int search(vector<vector<int>> questions, int goal) {
int minimum = 0;
for (int i = 0; i < questions.size(); i++) {
minimum += questions.at(i).at(1);
}
for (int i = 0; i < questions.size(); i++) {
int point = questions.at(i).at(0);
int kazu = questions.at(i).at(1);
int bonasu = questions.at(i).at(2);
int goukei = questions.at(i).at(3);
vector<vector<int>> q = questions;
q.erase(q.begin() + i);
if (goukei < goal) {
int nokori = search(q, goal - goukei) + kazu;
if (nokori < minimum) {
minimum = nokori;
}
} else {
int nokori = soredake(point, kazu, bonasu, goal);
if (nokori < minimum) {
minimum = nokori;
}
}
}
return minimum;
}
int main() {
int d, g;
cin >> d >> g;
vector<vector<int>> questions(d, vector<int>(4));
for (int i = 0; i < d; i++) {
questions.at(i).at(0) = 100 * (i + 1);
cin >> questions.at(i).at(1);
cin >> questions.at(i).at(2);
questions.at(i).at(3) =
questions.at(i).at(0) * questions.at(i).at(1) + questions.at(i).at(2);
}
cout << search(questions, g) << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int N;
vector<int> A(210);
int main() {
cin>>N;
for(int i=0;i<N;i++) cin>>A.at(i);
int count=0;
while(true){
bool exist_odd=false;
for(int i=0;i<N;i++){
if(A.at(i)%2!=0) exist_odd=true;
}
if(exist_odd) break;
for(int i=0;i<N;i++){
A.at(i)/=2;
}
count++;
}
cout<<count<<endl;
return 0;
} | #include<iostream>
using namespace std;
const int BUF = 2000005;
const int MOD = 1000000007;
int add(int a, int b) {
return (a + b) % MOD;
}
int sub(int a, int b) {
return (a - b + MOD) % MOD;
}
int mul(int a, int b) {
return 1LL * a * b % MOD;
}
int nNum;
int a[BUF], b[BUF];
void read() {
cin >> nNum;
for (int i = 0; i < nNum; ++i) cin >> a[i];
for (int i = 0; i < nNum; ++i) cin >> b[i];
}
void work() {
static int s[BUF];
static int t[BUF];
for (int i = 0; i < nNum; ++i) {
s[i] = a[i] ^ a[(i + 1) % nNum];
t[i] = b[i] ^ b[(i + 1) % nNum];
}
const int P = 1<<30;
int sHash = 0;
int tHash = 0;
for (int i = 0; i < nNum; ++i) {
sHash = add(mul(sHash, P), s[i]);
tHash = add(mul(tHash, P), t[i]);
}
int pPowNNum = 1;
for (int i = 0; i < nNum - 1; ++i) {
pPowNNum = mul(pPowNNum, P);
}
for (int shift = 0; shift < nNum; ++shift) {
if (sHash == tHash) {
cout << shift << ' ' << (a[shift] ^ b[0]) << endl;
}
sHash = sub(sHash, mul(s[shift], pPowNNum));
sHash = mul(sHash, P);
sHash = add(sHash, s[shift]);
}
}
int main() {
read();
work();
return 0;
}
| 0 |
//om namah shivaay
//faith over fear
//no one wants to die,yet death is the destination we all share
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define ll long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i,n) for(i=0;i<n;i++)
#define forn(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define for1(i, n) for (ll i = 1; i <= (ll)(n); ++i)
#define ford(i, n) for (ll i = (ll)(n) - 1; i >= 0; --i)
#define fore(i, a, b) for (ll i = (ll)(a); i <= (ll)(b); ++i)
#define fora(it,x) for(auto it:x)
#define PI 3.14159265
#define sync ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define endl "\n"
typedef pair<ll, ll> pii;
typedef vector<ll> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef long double ld;
template<class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template<class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }
int main(){
ll a[3];
cin>>a[0]>>a[1]>>a[2];
sort(a,a+3);
cout<<(a[0]+a[1]);
} | #include <iostream>
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <math.h>
#define int long long
using namespace std;
signed main() {
int A,B,C;
cin>>A>>B>>C;
if((A<=C&&B>=C)||(B<=C&&A>=C)){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
} | 0 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <vector>
#include <cstring>
#include <queue>
#include <map>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uld = unsigned long long;
using P = pair<int,int>;
const int dx[4] = {0,1,0,-1};
const int dy[4] = {1,0,-1,0};
template<class T> inline bool chmax(T &a,T& b){if(a < b){a = b; return true;} else return false;}
template<class T> inline bool chmin(T &a,T& b){if(a > b){a = b; return true;} else return false;}
//struct area
//function area
//main area
int main(){
string s;
cin >> s;
int n = s.size();
bool check = true;
int C_place;
//一個目
if(s[0] != 'A'){
check = false;
}
//二個目
int cnt = 0;
for(int i=2; i<n-1; i++){
if(s[i] == 'C'){
cnt++;
C_place = i;
}
}
if(cnt != 1) check = false;
//三個目
rep(i, n){
if(i == C_place || i == 0) continue;
if(!('a' <= s[i] && s[i] <= 'z')){
check = false;
}
}
cout << (check ? "AC" : "WA") << endl;
}
/*
一個ずつ判定する
・s[0] == 'A'
・2 <= i <= s.size()-2 cnt = 1
・上二つ以外の座標において'a' <= s[i] <= 'z'を満たす
*/ | #include <bits/stdc++.h>
using namespace std;
int main()
{
string S;
cin >> S;
string ans = "AC";
if( S[0] != 'A' ) ans = "WA";
else {
string s = S.substr( 2, S.size() - 2 - 1 );
int n = s.find( 'C' );
if( n == string::npos ) ans = "WA";
else if( s.find( 'C', n + 1 ) != string::npos ) ans = "WA";
else {
for( int i = 0; i < S.size(); i++ ) {
if( i == 0 || S[i] == 'C' && 2 <= i && i <= S.size() - 2 ) continue;
if( islower( S[i] ) == false ) ans = "WA";
}
}
}
cout << ans << endl;
}
| 1 |
#include<iostream>
using namespace std;
typedef long long ll;
int main(){
ll n;
while(cin>>n){
ll ans,x;
ans=n/11<<1;
x=n%11;
if(x>6)
ans+=2;
else if(x)
ans++;
cout<<ans<<endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
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; }
using namespace std;
using P = pair<int,int>;
using ll = long long;
const ll INF = 1LL<<60;
const double PI = 3.1415926535897932;
const int MOD = 1e9 + 7;
//cin.tie(0);ios::sync_with_stdio(false);
int main() {
ll x;
cin >> x;
ll ans = x / 11 * 2;
x %= 11;
if (x != 0) {
if (x <= 6) {
ans += 1;
} else {
ans += 2;
}
}
cout << ans << endl;
return 0;
}
| 1 |
#ifdef __GNUC__
#pragma GCC target("avx2")
#pragma GCC optimize ("O20")
#pragma GCC optimize ("tree-vectorize")
#pragma GCC optimize("unroll-loops")
#define iss std::cin
#endif
#include "bits/stdc++.h"
#define rep(i, times) for(ll i = 0; i < (times); ++i)
#define p(x) (cout << x << "\n")
using ll = long long; using ld = long double; using namespace std;
#ifndef __GNUC__
string text =
R"X(
2
1
2 0
1
1 0
)X";
stringstream iss{text};
#endif
class HonestOrUnkind2
{
ll N{0};
vector<bool> h;//正直かどうかの仮定
vector<vector<ll>> s;//証言
void inp( ) {
iss >> N;
h.resize(N);
s.resize(N, vector<ll>(N, 3));//3:言及せず 0:不親切呼ばわり 1:正直者認定
rep(n, N) {
ll K; iss >> K;//証言個数
rep(k, K) {
ll p, hn; iss >> p >> hn;//p番目の人は(n番が言うには)正直か
s[n][--p] = hn;
}
}
}
inline bool consistentQ( ) {//仮定と矛盾しないかだけ調べる
for (ll n = 0; n < N; ++n) {
if (!h[n]) continue; //不親切なら無視
for (ll p = 0; p < N; ++p) {//n番目の人がp番目の人に対して証言
if (s[n][p] == 3) continue;
if ((s[n][p] == 1) && !h[p]) return false;
if ((s[n][p] == 0) && h[p]) return false;
}
}
return true;
}
void changeSeikaku( ) {
size_t NH{0}; // 正直者の最大人数
const ll maxB{(1 << N)};
for (ll b = 0; b < maxB; ++b) {//全員の状態を変える
rep(n, N) { h[n] = (b >> n) & 1; }//n番の人が正直と仮定したか
if (consistentQ( )) NH = max(NH, bitset<32>(b).count( ));
}
p(NH);
}
public:
void procedures( ) {
inp( );
changeSeikaku( );
}
};
int main( ) {
cin.tie(0); ios::sync_with_stdio(0);
class HonestOrUnkind2 a; a.procedures( );
} | #include<bits/stdc++.h>
#define N 100005
#define int long long
using namespace std;
inline void rd(int &X){
X=0;int w=0;char ch=0;
while(!isdigit(ch))w|=ch=='-',ch=getchar();
while( isdigit(ch))X=(X<<3)+(X<<1)+(ch^48),ch=getchar();
X=w?-X:X;
}
int n,m,k;
int x[N],d[N],ans[N],t[N];
double a[N];
signed main()
{
rd(n);
for(int i=1;i<=n;i++)
rd(x[i]),d[i]=i,ans[i]=i;
rd(m);rd(k);
for(int x,i=1;i<=m;i++)
rd(x),swap(d[x],d[x+1]);
while(k)
{
if(k&1)
{
for(int i=1;i<=n;++i)t[i]=ans[d[i]];
for(int i=1;i<=n;++i)ans[i]=t[i];
}
for(int i=1;i<=n;++i)t[i]=d[d[i]];
for(int i=1;i<=n;++i)d[i]=t[i];
k>>=1;
}
for(int i=1;i<=n;i++)
a[i]=x[ans[i]]-x[ans[i]-1];
for(int i=1;i<=n;i++)
printf("%.1f\n",a[i]+=a[i-1]);
}
| 0 |
#include <iostream>
using namespace std;
int main(void){
int cd=0;
char c;
for (int i=0; i<3; i++){
cin >> c;
cd = (cd<<1) | (c=='R'?1:0);
}
cout << (cd["01121123"]) << endl;
return 0;
} | #include <iostream>
#include <string>
#include <cmath>
using namespace std;
int main(){
string S;
cin >> S;
int i, l, count, max;
l = S.length();
count = 0;
max = 0;
for (i = 0; i < l; i++){
if (S.at(i) == 'S'){
count = 0;
} else {
count += 1;
if (count > max) max = count;
}
}
cout << max << "\n";
return 0;
}
| 1 |
#include <iostream>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <utility>
#include <functional>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <deque>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define repc(i,s,e) for(int i=(s); i<(e); i++)
#define pb(n) push_back((n))
#define mp(n,m) make_pair((n),(m))
#define all(r) r.begin(),r.end()
#define fi first
#define se second
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF=1e9;
void print(vi v){
for(int i = 0; i < v.size(); i++){
cout<<" "<<v[i];
}
cout<<endl;
}
int main(){
string s;
cin>>s;
vi v(s.size(), 1);
for(int i = 1; i < s.size(); i++){
if(s[i]==s[i-1]){
v[i]=v[i-1]+1;
}
else{
reverse(v.begin()+(i-v[i-1]),v.begin()+i);
}
}
reverse(v.begin()+(v.size()-1-v[v.size()-2]),v.begin()+(v.size()));
//print(v);
//print(v);
int ans = 0;
for(int i = 0; i < s.size(); i++){
if(s[i]=='J'){
if(i+v[i]<s.size() && s[i+v[i]]=='O' && v[i+v[i]]==v[i]){
if(i+v[i]*2<s.size() && s[i+v[i]*2]=='I' && v[i+v[i]*2]>=v[i+v[i]]){
ans=max(ans,v[i]);
}
}
}
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 200010, INF = 1ll << 45;
int n,q,a,b,que[N];
struct node {
pair<int,int> lmn,rmn;
int l,r,tag;
} t[N << 2];
void puttag(int x,int val) {
t[x].tag += val;
t[x].lmn.first += val;
t[x].rmn.first += val;
}
void push_down(int x) {
puttag(x<<1,t[x].tag);
puttag(x<<1|1,t[x].tag);
t[x].tag = 0;
}
void push_up(int x) {
if (t[x].tag) push_down(x);
t[x].lmn = min(t[x<<1].lmn,t[x<<1|1].lmn);
t[x].rmn = min(t[x<<1].rmn,t[x<<1|1].rmn);
}
void build(int l,int r,int x) {
t[x].l = l, t[x].r = r;
if (l == r) {
t[x].lmn = make_pair(l,l);
t[x].rmn = make_pair(n-l+1,l);
return;
}
int mid = (l + r) >> 1;
build(l,mid,x<<1);
build(mid+1,r,x<<1|1);
push_up(x);
}
int query(int p,int x) {
if (t[x].l == t[x].r)
return t[x].lmn.first - t[x].l;
if (t[x].tag) push_down(x);
int mid = (t[x].l + t[x].r) >> 1;
if (p <= mid) return query(p,x<<1);
else return query(p,x<<1|1);
}
void modify(int l,int r,int x,int val) {
if (l > t[x].r || r < t[x].l) return;
if (t[x].l >= l && t[x].r <= r) {
t[x].lmn.first += val;
t[x].rmn.first += val;
t[x].tag += val;
return;
}
if (t[x].tag) push_down(x);
modify(l,r,x<<1,val);
modify(l,r,x<<1|1,val);
push_up(x);
}
pair<int,int> askl(int l,int r,int x) {
if (l > t[x].r || r < t[x].l) return make_pair(INF,0);
if (t[x].l >= l && t[x].r <= r)
return t[x].lmn;
if (t[x].tag) push_down(x);
return min(askl(l,r,x<<1),askl(l,r,x<<1|1));
}
pair<int,int> askr(int l,int r,int x) {
if (l > t[x].r || r < t[x].l) return make_pair(INF,0);
if (t[x].l >= l && t[x].r <= r)
return t[x].rmn;
if (t[x].tag) push_down(x);
return min(askr(l,r,x<<1),askr(l,r,x<<1|1));
}
void setval(int p,int x,int val) {
if (t[x].l == t[x].r) {
t[x].lmn.first = val + t[x].l;
t[x].rmn.first = val + n - t[x].l + 1;
return;
}
int mid = (t[x].l + t[x].r) >> 1;
if (t[x].tag) push_down(x);
if (p <= mid) setval(p,x<<1,val);
else setval(p,x<<1|1,val);
push_up(x);
}
signed main() {
int tmp,t;
scanf("%lld%lld%lld%lld",&n,&q,&a,&b);
que[0] = a;
build(1,n,1);
for (int i = 1 ; i <= n ; ++ i)
setval(i,1,abs(i-b));
for (int i = 1 ; i <= q ; ++ i) {
scanf("%lld",&que[i]);
tmp = askl(que[i],n,1).first - que[i];
t = askr(1,que[i],1).first - n + que[i] - 1;
tmp = min(tmp,t);
modify(1,n,1,abs(que[i-1] - que[i]));
t = query(que[i-1],1);
tmp = min(tmp,t);
setval(que[i-1],1,tmp);
}
int ans = INF;
for (int i = 1 ; i <= n ; ++ i)
ans = min(ans,query(i,1));
printf("%lld\n",ans);
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
//long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() end()
#define all(x) (x).begin(),(x).end()
//for
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
//最大公約数（ll）
ll gcd(ll x, ll y) { return y ? gcd(y,x%y) : x;}
//素因数分解
vector<pair<ll, int>>factorize(ll n){
vector<pair<ll, int>> res;
for(ll i = 2; i * i <= n; ++i){
if(n % i) continue;
res.emplace_back(i, 0);
while(n % i == 0){
n /= i;
res.back().second++;
}
}
if(n != 1) res.emplace_back(n, 1);
return res;
}
int main()
{
string S;
cin >> S;
for(int i = 0; S.size() > i; i++){
if(S.at(i) == 'A' && S.at(i + 1) == 'C') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} | #include <iostream>
using namespace std;
int main()
{
string test;
getline(cin,test);
if (test[0] == 'A' && test[1] == 'C')
{
cout << "Yes" << endl;
}
else if(test[1] == 'A' && test[2] == 'C')
{
cout << "Yes" << endl;
}
else if(test[2] == 'A' && test[3] == 'C')
{
cout << "Yes" << endl;
}
else if(test[3] == 'A' && test[4] == 'C')
{
cout << "Yes" << endl;
}
else
cout << "No" << endl;
}
| 1 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <ctype.h>
#include <algorithm>
using namespace std;
#define loop(i,a,b) for(int i=(a); i<(int)(b); i++)
#define rep(i,b) loop(i,0,b)
#define all(c) (c).begin(), (c).end()
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
int main() {
string s;
while(getline(cin, s)) {
int slide = 0;
rep(i, s.size()-4) {
if(islower(s[i]) == 0) continue;
rep(j, 26) {
string sub;
rep(k, 4) sub += (s[i+k]-'a'+j+52)%26 + 'a';
if(sub.substr(0,3) == "the") slide = j;
else if(sub == "this" || sub == "that") slide = j;
}
if(slide != 0) break;
}
rep(i, s.size()) {
if(islower(s[i]) != 0)printf("%c", (s[i]-'a'+slide+52)%26 + 'a');
else cout << s[i];
}
cout << endl;
}
} | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
string bstr;
while (getline(cin, bstr)) {
int n = 26;
while (n--) {
if (bstr.find("this", 0) != string::npos) {
break;
} else if (bstr.find("that", 0) != string::npos) {
break;
} else if (bstr.find("the", 0) != string::npos) {
break;
}
for (int i = 0; i < bstr.size(); i++) {
if (bstr[i] >= 'a' && bstr[i] <= 'z') {
if (bstr[i] != 'z')
bstr[i]++;
else
bstr[i] = 'a';
}
}
}
cout << bstr << endl;
}
return 0;
} | 1 |
#include <stdio.h>
int main(){
int n,m,i,j,x[20],y[20],z[30],p[31],q[31],a[20],b[20],c[20],s;
char d[i];
while(1) {
scanf("%d",&n);
if (n==0) break;
for (i=0;i<n;i++) {
scanf("%d %d",&x[i],&y[i]);
}
scanf("%d",&m);
for (i=0;i<m;i++) {
getchar();
scanf("%c %d",&d[i],&z[i]);
}
p[0]=10;
q[0]=10;
for (i=0;i<m;i++) {
p[i+1]=p[i];
q[i+1]=q[i];
if (d[i]=='N') {q[i+1]=q[i]+z[i];}
if (d[i]=='S') {q[i+1]=q[i]-z[i];}
if (d[i]=='E') {p[i+1]=p[i]+z[i];}
if (d[i]=='W') {p[i+1]=p[i]-z[i];}
}
s = 1;
for (i=0;i<n;i++) {
c[i] = 0;
for (j=0;j<m;j++) {
a[i] = b[i] = 0;
if ((x[i]<=p[j]&&x[i]>=p[j+1])||(x[i]>=p[j]&&x[i]<=p[j+1])) {
a[i]=1;
}
if ((y[i]<=q[j]&&y[i]>=q[j+1])||(y[i]>=q[j]&&y[i]<=q[j+1])) {
b[i]=1;
}
c[i] |= a[i]*b[i];
}
}
for (i=0;i<n;i++) {
s*=c[i];
}
if (s==1) {printf("Yes\n");}
if (s!=1) {printf("No\n");}
}
return 0;
} | #include<iostream>
#include<string>
using namespace std;
int main(){
int map[21][21];
int dx,dy;
int get;
int n,m;
int x,y;
int len;
int i,j;
string A;
while(1){
get = 0;
dx = 10;
dy = 10;
for(i = 0 ; i < 21 ; i++){
for(j = 0 ; j < 21 ; j++){
map[i][j]=0;
}
}
cin >> n;
if(n==0) break;
for(i = 0 ; i < n ; i++){
cin >> x >> y;
map[x][y]=1;
}
cin >> m;
for(i = 0 ; i < m ; i++){
cin >> A >> len;
if(A == "N"){
for(j = 0 ; j < len ; j++){
dy++;
if(map[dx][dy]==1){
map[dx][dy]=0;
get++;
}
}
}
if(A == "E"){
for(j = 0 ; j < len ; j++){
dx++;
if(map[dx][dy]==1){
map[dx][dy]=0;
get++;
}
}
}
if(A == "S"){
for(j = 0 ; j < len ; j++){
dy--;
if(map[dx][dy]==1){
map[dx][dy]=0;
get++;
}
}
}
if(A == "W"){
for(j = 0 ; j < len ; j++){
dx--;
if(map[dx][dy]==1){
map[dx][dy]=0;
get++;
}
}
}
}
if(get == n){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
}
return 0;
} | 1 |
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int main(){
int n, m, a[1000], b[1000], vote[1000]={0};
scanf(" %d %d", &n, &m);
for(int i=0; i<n; ++i) scanf(" %d", &a[i]);
for(int i=0; i<m; ++i) scanf(" %d", &b[i]);
sort(b,b+m, greater<int>());
int now=0;
for(int i=0; i<m; ++i){
for(int j=now; j<n; ++j){
if(a[j] <= b[i]){
++vote[j];
now=j;
//printf("::%d\n",j);
break;
}
}
}
int ans=0, max=0;
for(int i=0; i<n; ++i){
if(max < vote[i]){
max=vote[i];
ans=i+1;
}
}
printf("%d\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
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; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int INF = 1<<30;
const ll mod = 1000000007LL;
int main() {
ll N,x;
cin>>N>>x;
vector<ll> v(N);
for(ll i = 0; i < N; i++) cin>>v[i];
ll ans = 0;
if(v[0]>x){
ans+=v[0]-x;
v[0]=x;
}
for(ll i = 0; i < N-1; i++){
if(v[i]+v[i+1]>x){
ll t = x-v[i];
ans+=v[i+1]-t;
v[i+1]=t;
}
}
cout<<ans<<endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long n,sum,fs,bs,fbs;
cin >> n;
sum = n,fs = 0, bs = 0, fbs = 0;
for (int i = 0; i < n; i++) {
sum += i;
}
for (int i = 3; i <= n; i += 3) {
fs += i;
}
for (int i = 5; i <= n; i += 5) {
bs += i;
}
for (int i = 15; i <= n; i += 15) {
fbs += i;
}
cout << sum-fs-bs+fbs << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 10000000000 + 7;
int main(){
cout << setprecision(10);
ll N; cin >> N;
ll ans = 0;
for(ll i = 1; i <= N; i++){
if( i%3 == 0 || i%5 == 0){
} else {
ans += i;
}
}
cout << ans << endl;
}
| 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.