solution
stringlengths 52
181k
| difficulty
int64 0
6
|
|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int p;
cin >> p;
cout << p*p*3;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;
template<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}
template<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}
const int mod=1000000007;
int mpow(int n,int m){
int ret=1;
while(m){
if(m&1)ret=ret*n%mod;
n=n*n%mod;
m>>=1;
}
return ret;
}
int H,W,K;
char fld[1111][1111];
int bla[111],num[111],ev[111],eh[111],iv[111],ih[111];
tuple<int,int,int,int>f(int b,int n,int e,int i,int bb,int nn,int ee,int ii){
int bbb,nnn,eee,iii;
iii=(b*ii+i*ee)%mod;
eee=e*ee%mod;
nnn=((b*nn-i*ee)%mod+mod)%mod;
bbb=b*bb%mod;
return make_tuple(bbb,nnn,eee,iii);
}
signed main(){
cin>>H>>W>>K;
if(K<=1){
cout<<1<<endl;
return 0;
}
K--;
rep(i,H)cin>>fld[i];
rep(i,H)rep(j,W)if(fld[i][j]=='#')bla[0]++;
rep(i,H)if(fld[i][0]=='#'&&fld[i][W-1]=='#')eh[0]++;
rep(j,W)if(fld[0][j]=='#'&&fld[H-1][j]=='#')ev[0]++;
rep(i,H)rep(j,W){
if(i+1<H&&fld[i][j]=='#'&&fld[i+1][j]=='#')iv[0]++;
if(j+1<W&&fld[i][j]=='#'&&fld[i][j+1]=='#')ih[0]++;
}
if(eh[0]&&ev[0]){
cout<<1<<endl;
return 0;
}
if(!eh[0]&&!ev[0]){
cout<<mpow(bla[0],K)<<endl;
return 0;
}
if(ev[0]==0){
swap(ev[0],eh[0]);
swap(iv[0],ih[0]);
}
num[0]=bla[0]-iv[0];
for(int i=1;i<60;i++){
tie(bla[i],num[i],ev[i],iv[i])=f(bla[i-1],num[i-1],ev[i-1],iv[i-1],bla[i-1],num[i-1],ev[i-1],iv[i-1]);
}
int ba=1,na=1,ea=1,ia=0;
for(int i=0;i<60;i++)if(K>>i&1)tie(ba,na,ea,ia)=f(ba,na,ea,ia,bla[i],num[i],ev[i],iv[i]);
cout<<na<<endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1);
const int maxn = 2005;
const long long Mod = 998244353;
long long dp[maxn][maxn];
long long sum[maxn];
char s[maxn];
long long p[maxn];
int main() {
p[0] = 1;
for (int i = 1; i <= maxn; i++) p[i] = (p[i - 1] * 2) % Mod;
scanf("%s", s + 1);
int n = strlen(s + 1);
for (int i = 1; i <= n; i++) {
if (s[i] == '?')
sum[i] = sum[i - 1] + 1;
else
sum[i] = sum[i - 1];
}
memset(dp, 0, sizeof(dp));
for (int len = 2; len <= n; len++) {
for (int l = 1; l <= n + 1 - len; l++) {
int r = l + len - 1;
if (s[l] != '(') dp[l][r] = (dp[l][r] + dp[l + 1][r]) % Mod;
if (s[r] != ')') dp[l][r] = (dp[l][r] + dp[l][r - 1]) % Mod;
if (s[l] != '(' && s[r] != ')')
dp[l][r] = (dp[l][r] - dp[l + 1][r - 1] + Mod) % Mod;
if (s[l] != ')' && s[r] != '(')
dp[l][r] = (dp[l][r] + dp[l + 1][r - 1] + p[sum[r - 1] - sum[l]]) % Mod;
}
}
printf("%lld\n", dp[1][n]);
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int T;
cin >> T;
while (T--) {
int X, Y, Z;
cin >> X >> Y >> Z;
map<int, int> M;
M[X]++;
M[Y]++;
M[Z]++;
if (M.size() == 1)
cout << "YES\n" << X << " " << Y << " " << Z << "\n";
else if (M.size() == 3) {
cout << "NO\n";
} else {
auto i = M.begin();
if (i->second == 2)
cout << "NO\n";
else {
cout << "YES\n";
cout << i->first << " ";
cout << i->first << " ";
i++;
cout << i->first << " ";
cout << "\n";
}
}
}
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
const int MD = 1e9+7;
int la, ra;
ll l, r, ans;
int main(){
scanf("%lld%lld", &l, &r);
for(; l>>la; la++); la--;
for(; r>>ra; ra++); ra--;
for(int i = la; i <= ra; i++){
ll dp1 = 1, dp2 = 0, dp3 = 0, dp4 = 0, lc = la==i?l:0, rc = ra==i?r:~0;
for(int j = i-1; j >= 0; j--){
int lb = lc>>j&1, rb = rc>>j&1; lb ^= 1;
dp4 = (dp4*3 + rb * dp2 + lb * dp3) % MD;
if(rb) dp2 = (dp2*2 + lb * dp1) % MD;
if(lb) dp3 = (dp3*2 + rb * dp1) % MD;
dp1 &= lb | rb;
}
(ans += (dp1 + dp2 + dp3 + dp4) % MD) %= MD;
}
printf("%lld\n", ans);
}
| 0 |
#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
int IT_MAX;
const int MOD = 1000000;
const int INF = 1034567891;
const long long LL_INF = 2234567890123456789ll;
const double PI = 3.141592653589793238;
long double getdis(long double a, long double b, long double c, long double d) {
return sqrt((c - a) * (c - a) + (d - b) * (d - b));
}
int main() {
long double x1, y1, x2, y2, v, t, vx, vy, wx, wy;
cin >> x1 >> y1 >> x2 >> y2;
cin >> v >> t;
cin >> vx >> vy;
cin >> wx >> wy;
long double st = 0, en = INF, mi, rv;
for (int i = 1; i <= 500; i++) {
mi = (st + en) / 2;
long double tx, ty;
if (mi <= t) {
tx = x2 - x1 - mi * vx;
ty = y2 - y1 - mi * vy;
} else {
tx = x2 - x1 - t * vx - (mi - t) * wx;
ty = y2 - y1 - t * vy - (mi - t) * wy;
}
if (sqrt(tx * tx + ty * ty) <= v * mi) {
rv = mi;
en = mi;
} else
st = mi;
}
double ans = (double)rv;
printf("%.20lf", ans);
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
char str[5005];
cin >> str;
int sum[5005];
int que[5005] = {0};
for (int i = 0; str[i] != '\0'; i++) {
if (str[i] == '(')
sum[i] = 1;
else if (str[i] == ')')
sum[i] = -1;
else {
sum[i] = 0;
que[i] = 1;
}
}
int len = strlen(str);
long long ans = 0;
for (int i = 0; i < len; i++) {
int su = 0, qu = 0;
for (int j = i; j < len; j++) {
su += sum[j] - que[j];
qu += que[j];
if (su < 0) {
su += 2 * ceil(abs(su) / 2.0);
qu -= ceil(abs(su) / 2.0);
}
if (su == 0) ans++;
if (qu < 0) break;
}
}
cout << ans;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
long long t, n, m, k, a, b, x, y, q, ans, arr[N];
string s;
long long mod = 998244353;
bool vis[N];
vector<long long> vec[N];
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
;
t = 1;
while (t--) {
cin >> n >> m;
for (int i = 1; i <= m; ++i) {
cin >> arr[i];
if (i > 1) ans += llabs(arr[i] - arr[i - 1]);
}
for (int i = 1; i <= m; ++i) {
long long cur = arr[i];
long long prev = (i != 1) ? arr[i - 1] : cur;
long long nxt = (i != m) ? arr[i + 1] : cur;
if (cur != prev) vec[cur].push_back(prev);
if (cur != nxt) vec[cur].push_back(nxt);
}
long long best = ans;
for (int i = 0; i < N; ++i) {
vector<long long> x = vec[i];
if (!x.size()) continue;
sort(x.begin(), x.end());
long long median = x[x.size() / 2];
long long a = 0, b = 0;
for (auto &y : x) a += llabs(i - y), b += llabs(median - y);
ans = min(ans, best + b - a);
}
cout << ans << endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool Up(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool Down(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
inline int getus() {
int tmp, c;
while (tmp = fgetc(stdin), tmp < '0' || tmp > '9')
;
tmp -= '0';
while (c = fgetc(stdin), '0' <= c && c <= '9') tmp = tmp * 10 + c - '0';
return tmp;
}
inline int getint() {
int tmp, c, flag;
while (flag = fgetc(stdin), flag != '-' && (flag < '0' || flag > '9'))
;
if (flag == '-')
tmp = 0;
else
tmp = flag - '0';
while (c = fgetc(stdin), '0' <= c && c <= '9') tmp = tmp * 10 + c - '0';
return flag == '-' ? -tmp : tmp;
}
const int MAXN = 233;
int K, X, N, M;
long long s01[MAXN], s10[MAXN], s11[MAXN], s00[MAXN];
long long cs0[MAXN], cs1[MAXN];
long long fib[MAXN];
bool dp[MAXN][MAXN][3][3];
void output(int i, int j, int k, int l) {
if (i > 1) {
for (int lp = (0); lp <= (2); ++lp) {
if (lp == 0 && l == 1) {
if (dp[i - 1][j - 1][k][lp]) {
output(i - 1, j - 1, k, lp);
break;
}
} else {
if (dp[i - 1][j][k][lp]) {
output(i - 1, j, k, lp);
break;
}
}
}
}
if (l == 0)
putchar('A');
else if (l == 1)
putchar('C');
else
putchar('B');
}
void solve() {
memset(s01, 0, sizeof(s01));
memset(s10, 0, sizeof(s10));
memset(s00, 0, sizeof(s00));
memset(s11, 0, sizeof(s11));
fib[1] = fib[2] = 1;
for (int i = (3); i <= (133); ++i) fib[i] = fib[i - 1] + fib[i - 2];
cs0[1] = 1;
cs0[2] = 0;
cs1[1] = 0;
cs1[2] = 1;
for (int i = (3); i <= (133); ++i) {
cs0[i] = cs0[i - 1] + cs0[i - 2];
cs1[i] = cs1[i - 1] + cs1[i - 2];
}
s01[3] = 1;
s10[3] = 0;
for (int i = 4; i <= 133; ++i) {
s01[i] = s01[i - 1] + s01[i - 2];
s10[i] = s01[i];
if (i & 1) --s10[i];
s11[i] = fib[i] - 1 - s01[i] - s10[i];
}
memset(dp, 0, sizeof(dp));
dp[1][0][0][0] = true;
dp[1][0][1][1] = true;
dp[1][0][2][2] = true;
for (int i = (2); i <= (133); ++i)
for (int j = (0); j <= (53); ++j)
for (int k = (0); k <= (2); ++k)
for (int l = (0); l <= (2); ++l) {
bool &res = dp[i][j][k][l] = false;
for (int lp = (0); lp <= (2); ++lp) {
if (lp == 0 && l == 1)
res = dp[i - 1][j - 1][k][lp];
else
res = dp[i - 1][j][k][lp];
if (res) break;
}
}
scanf("%d %d %d %d", &K, &X, &N, &M);
for (int ma = (0); ma <= (100); ++ma)
for (int la = (0); la <= (2); ++la)
for (int ra = (0); ra <= (2); ++ra)
if (dp[N][ma][la][ra])
for (int mb = (0); mb <= (100); ++mb)
for (int lb = (0); lb <= (2); ++lb)
for (int rb = (0); rb <= (2); ++rb)
if (dp[M][mb][lb][rb]) {
if (cs0[K] * ma > X) continue;
if (cs1[K] * mb > X) continue;
long long cnt = cs0[K] * ma + cs1[K] * mb;
if (cnt > X) continue;
cnt += s00[K] * int(ra == 0 && la == 1);
if (cnt > X) continue;
cnt += s11[K] * int(rb == 0 && lb == 1);
if (cnt > X) continue;
cnt += s10[K] * int(rb == 0 && la == 1);
if (cnt > X) continue;
cnt += s01[K] * int(ra == 0 && lb == 1);
if (cnt > X) continue;
if (cnt == X) {
output(N, ma, la, ra);
puts("");
output(M, mb, lb, rb);
puts("");
return;
}
}
puts("Happy new year!");
}
int main() {
solve();
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
inline void GetN(int &num) {
char in = getchar();
while (in < '0' || in > '9') in = getchar();
num = in - '0';
while (in = getchar(), in >= '0' && in <= '9') num *= 10, num += in - '0';
}
inline void GetS(char *s) {
memset(s, 0, sizeof(s));
char in = getchar();
while ((in < 'A' || in > 'Z') && (in < 'a' || in > 'z')) in = getchar();
int len = 0;
s[len] = in;
while (in = getchar(), (in >= 'A' && in <= 'Z') || (in >= 'a' && in <= 'z'))
s[++len] = in;
}
int n, i, x, ans = 1, mx, a[100];
bool mrk[20];
int main() {
memset(mrk, false, sizeof(mrk));
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", a + i);
mrk[a[i]] = true;
if (a[i] > mx) mx = a[i];
}
ans = mx;
ans = ans ^ a[n - 1];
cout << ans << endl;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int K;
cin >> K;
queue<int64_t> q;
for (int i = 1; i < 10; i++)
q.push(i);
for (int i = 0; i < K-1; i++) {
int64_t x=q.front();
if(x%10!=0) {
q.push(10*x+x%10-1);
}
q.push(10*x+x%10);
if(x%10!=9) {
q.push(10*x+x%10+1);
}
q.pop();
}
cout << q.front() << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using VS = vector<string>; using LL = long long;
using VI = vector<int>; using VVI = vector<VI>;
using PII = pair<int, int>; using PLL = pair<LL, LL>;
using VL = vector<LL>; using VVL = vector<VL>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
#define FORR(i, s, e) for (int(i) = (s); (i) > (e); (i)--)
#define debug(x) cerr << #x << ": " << x << endl
const int INF = 1e9; const LL LINF = 1e16;
const LL MOD = 1000000007; const double PI = acos(-1.0);
int DX[8] = { 0, 0, 1, -1, 1, 1, -1, -1 }; int DY[8] = { 1, -1, 0, 0, 1, -1, 1, -1 };
/* ----- 2017/12/04 Problem: codefestival2017_team_relay G / Link: __CONTEST_URL__ ----- */
/* ------問題------
-----問題ここまで----- */
/* -----解説等-----
----解説ここまで---- */
LL L;
string ans ="";
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cin >> L ;
string s,t;
cin>>s>>t;
LL ssize = SZ(s);
LL tsize = SZ(t);
if(s + t > t + s )swap(s,t); // sのほうがちいさい
ssize= SZ(s);
tsize= SZ(t);
FORR(i,L,0-1){
LL left = ssize * i;
if((L-left)>=0&&(L-left)%tsize==0){
FOR(k,0,i)ans+=s;
FOR(k,0,(L-left)/tsize)ans+=t;
break;
}
}
assert(L==SZ(ans));
cout << ans << "\n";
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int arr[250];
int main() {
int n, cfu = 0, sum = 0, i, num;
cin >> n;
for (i = 0; i < 2 * n - 1; i++) {
cin >> arr[i];
if (arr[i] < 0) {
cfu++;
arr[i] = -arr[i];
}
}
sort(arr, arr + 2 * n - 1);
for (i = 0; i < 2 * n - 1; i++) sum += arr[i];
if (cfu % 2 == 0 || cfu % n == 0 || cfu < n && (n - cfu) % 2 == 0 ||
cfu > n && (cfu - n) % 2 == 0)
cout << sum << endl;
else
cout << sum - arr[0] * 2 << endl;
}
| 1 |
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#include<iostream>
#include<cstdio>
#include<cstring>
#define ll long long
#define p 998244353
#define N 300
using namespace std;
namespace ywy{
int size=0;
typedef struct _mat{
int v[N][N];
_mat() { memset(v,0,sizeof(v)); }
friend _mat operator *(const _mat &a,const _mat &b){
_mat c;
for(int i=1;i<=size;i++){
for(int j=1;j<=size;j++){
for(int k=1;k<=size;k++){
c.v[i][j]=(c.v[i][j]+a.v[i][k]*(ll)b.v[k][j])%p;
}
}
}
return c;
}
}mat;
int trie[N][26],id[N][N],length[N],ends[N];
char str[10][10],strs[N][10];
mat mi(mat a,int b){
mat ans,tmp=a;
for(int i=1;i<=size;i++) ans.v[i][i]=1;
while(b){
if(b&1) ans=ans*tmp; tmp=tmp*tmp; b>>=1;
}
return ans;
}
mat me;
void tryset(int x,int a,int b){
if(a>b) swap(a,b);
if(!id[a][b]) return;
me.v[x][id[a][b]]++;
}
void ywymain(){
int n,m,gtrie=1; cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>str[i];
int len=strlen(str[i]),cur=0;
for(int j=0;j<len;j++){
if(!trie[cur][str[i][j]-'a']) trie[cur][str[i][j]-'a']=gtrie++;
length[cur=trie[cur][str[i][j]-'a']]=j+1;
for(int k=0;k<=j;k++) strs[cur][k]=str[i][k];
}
ends[cur]=1;
}
for(int a=0;a<gtrie;a++){
for(int b=a;b<gtrie;b++){
int lm=min(length[a],length[b]),flag=0;
for(int i=1;i<=lm;i++)
if(strs[a][length[a]-i]!=strs[b][length[b]-i]) flag=1;
if(flag) continue;
id[a][b]=++size;
}
}
for(int a=0;a<gtrie;a++){
for(int b=a;b<gtrie;b++){
if(!id[a][b]) continue;
for(int i=0;i<26;i++){
if(!trie[a][i]||!trie[b][i]) continue;
tryset(id[a][b],trie[a][i],trie[b][i]);
if(ends[trie[a][i]]){
if(ends[trie[b][i]]) tryset(id[a][b],0,0);
tryset(id[a][b],0,trie[b][i]);
}
if(ends[trie[b][i]]) tryset(id[a][b],trie[a][i],0);
}
}
}
mat res=mi(me,m);
cout<<res.v[id[0][0]][id[0][0]]<<endl;
}
}
int main(){
ywy::ywymain();
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > adj(1001);
bool visited[1001];
int beauty[1001];
int weight[1001];
vector<vector<int> > groups(1001);
int dp[1001][1001];
void dfs(int node, int g) {
if (visited[node]) return;
visited[node] = true;
groups[g].push_back(node);
for (int i = 0; i < adj[node].size(); i++) dfs(adj[node][i], g);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m, w;
cin >> n >> m >> w;
for (int i = 0; i < n; i++) cin >> weight[i + 1];
for (int i = 0; i < n; i++) cin >> beauty[i + 1];
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
adj[a].push_back(b);
adj[b].push_back(a);
}
int gcnt = 0;
for (int i = 1; i <= n; i++) {
if (visited[i] == false) dfs(i, ++gcnt);
}
for (int i = 1; i <= w; i++) {
for (int j = 1; j <= gcnt; j++) {
int tb = 0, tw = 0;
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
for (int k = 0; k < groups[j].size(); k++) {
if (weight[groups[j][k]] <= i)
dp[i][j] = max(dp[i][j], dp[i - weight[groups[j][k]]][j - 1] +
beauty[groups[j][k]]);
tb += beauty[groups[j][k]];
tw += weight[groups[j][k]];
}
if (tw <= i) dp[i][j] = max(dp[i][j], dp[i - tw][j - 1] + tb);
}
}
cout << dp[w][gcnt] << "\n";
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
vector<pair<long long, long long> > find(
vector<pair<long long, long long> > &arr, long long n) {
long long op = 0;
long long mini = 1e18;
for (long long i = 0; i < n; i++) {
mini = min(arr[i].first, mini);
}
vector<pair<long long, long long> > ans;
for (long long i = 0; i < n; i++) {
ans.push_back({arr[i].first - mini, arr[i].second});
}
return ans;
}
bool compare(pair<long long, long long> &p1, pair<long long, long long> &p2) {
return p1.second < p2.second;
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
string second;
cin >> second;
set<long long> zero, one;
for (long long i = 0; i < n; i++) {
if (second[i] == '0') {
zero.insert(i);
} else {
one.insert(i);
}
}
long long i = 0, j = 0, counter = 0;
long long glob = 0;
long long arr[n];
while (!one.empty() and !zero.empty()) {
glob++;
long long t1 = i, t2 = j;
long long t3 = i, t4 = j;
long long counter1 = 0, counter2 = 0;
set<long long> set1, set2;
{
auto st1 = (zero.begin());
while (st1 != zero.end()) {
set1.insert(*st1);
counter1++;
auto x = one.lower_bound(*st1);
if (x != one.end()) {
set1.insert(*x);
counter1++;
st1 = (zero.lower_bound(*x));
} else
break;
}
}
{
auto st1 = (one.begin());
while (st1 != one.end()) {
set2.insert(*st1);
counter2++;
auto x = zero.lower_bound(*st1);
if (x != zero.end()) {
set2.insert(*x);
counter2++;
st1 = (one.lower_bound(*x));
} else
break;
}
}
if (counter1 < counter2) {
for (auto x : set2) {
one.erase(x);
zero.erase(x);
arr[x] = glob;
}
} else {
for (auto x : set1) {
one.erase(x);
zero.erase(x);
arr[x] = glob;
}
}
counter++;
}
if (!one.empty()) {
for (auto x : one) {
arr[x] = ++glob;
}
}
if (!zero.empty()) {
for (auto x : zero) {
arr[x] = ++glob;
}
}
cout << glob << "\n";
for (long long i = 0; i < n; i++) {
cout << arr[i] << " ";
}
cout << "\n";
}
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
long long ara[6], tra[6][6];
int main() {
long long a, i, j, x, y, z, p, q, r, s, ans = 0, fn, t;
for (i = 1; i <= 4; i++) {
scanf("%lld", &a);
while (a % 2 == 0) {
a = a / 2;
tra[i][2]++;
}
while (a % 3 == 0) {
a = a / 3;
tra[i][3]++;
}
ara[i] = a;
}
if ((ara[1] * ara[2]) != (ara[3] * ara[4]))
printf("-1\n");
else {
p = tra[1][3] + tra[2][3];
q = tra[3][3] + tra[4][3];
if (q > p) {
s = q - p;
ans = ans + s;
t = min(s, tra[4][3]);
s = s - t;
tra[4][3] = tra[4][3] - t;
tra[4][2] = tra[4][2] + t;
t = min(s, tra[3][3]);
s = s - t;
tra[3][3] = tra[3][3] - t;
tra[3][2] = tra[3][2] + t;
}
if (p > q) {
s = p - q;
ans = ans + s;
t = min(s, tra[2][3]);
s = s - t;
tra[2][3] = tra[2][3] - t;
tra[2][2] = tra[2][2] + t;
t = min(s, tra[1][3]);
s = s - t;
tra[1][3] = tra[1][3] - t;
tra[1][2] = tra[1][2] + t;
}
x = tra[1][2] + tra[2][2];
y = tra[3][2] + tra[4][2];
if (y > x) {
s = y - x;
ans = ans + s;
t = min(s, tra[4][2]);
s = s - t;
tra[4][2] = tra[4][2] - t;
t = min(s, tra[3][2]);
s = s - t;
tra[3][2] = tra[3][2] - t;
}
if (x > y) {
s = x - y;
ans = ans + s;
t = min(s, tra[2][2]);
s = s - t;
tra[2][2] = tra[2][2] - t;
t = min(s, tra[1][2]);
s = s - t;
tra[1][2] = tra[1][2] - t;
}
printf("%lld\n", ans);
for (i = 1; i <= 4; i++) {
for (j = 1; j <= tra[i][2]; j++) ara[i] = ara[i] * 2;
for (j = 1; j <= tra[i][3]; j++) ara[i] = ara[i] * 3;
printf("%lld ", ara[i]);
if (i == 2) printf("\n");
}
}
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
bool read_int(int& out) {
int c = getchar();
long long x = 0;
int neg = 0;
for (; !('0' <= c && c <= '9') && c != '-'; c = getchar()) {
if (c == EOF) return false;
}
if (c == '-') {
neg = 1;
c = getchar();
}
if (c == EOF) return false;
for (; '0' <= c && c <= '9'; c = getchar()) {
x = x * 10 + c - '0';
}
out = neg ? -x : x;
return true;
}
const int INF = 0x3f3f3f3f, MOD = 1e9 + 7;
long long gcd(long long a, long long b) { return (a ? gcd(b % a, a) : b); }
long long power(long long a, long long n) {
long long p = 1;
while (n > 0) {
if (n % 2) {
p = p * a;
}
n >>= 1;
a *= a;
}
return p;
}
long long power(long long a, long long n, long long mod) {
long long p = 1;
while (n > 0) {
if (n % 2) {
p = p * a;
p %= mod;
}
n >>= 1;
a *= a;
a %= mod;
}
return p % mod;
}
template <typename T>
istream& operator>>(istream& h, vector<T>& od) {
for (int i = 0; i < od.size(); ++i) h >> od[i];
return h;
}
template <typename T>
ostream& operator<<(ostream& h, const vector<T>& od) {
for_each(od.begin(), od.end(), [&h](const T& x) { h << x << ' '; });
return h;
}
template <typename T>
T qrt(T x) {
return x * x;
}
inline bool intersect_1(int a, int b, int c, int d) {
if (a > b) swap(a, b);
if (c > d) swap(c, d);
return max(a, c) <= min(b, d);
}
vector<pair<int, int>> factor(const long long& n) {
long long x = n;
int g = sqrt(x);
vector<pair<int, int>> v;
for (int i = 2; i <= g && i <= x; ++i) {
if (x % i == 0) {
int j = 0;
while (x % i == 0) {
x /= i;
++j;
}
v.push_back(make_pair(i, j));
}
}
if (x > 1) v.push_back(make_pair(x, 1));
return v;
}
int main() {
int n;
cin >> n;
map<int, pair<int, int>> g;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
++g[x].first;
g[x].second = i;
}
vector<pair<int, pair<int, int>>> res(g.begin(), g.end());
sort(res.begin(), res.end(),
[&](const pair<int, pair<int, int>>& l,
const pair<int, pair<int, int>>& r) {
return l.second.first == r.second.first
? l.second.second < r.second.second
: l.second.first > r.second.first;
});
cout << res.begin()->first << '\n';
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const long long maxN = 1e6 + 7;
const long long maxM = 5e5;
const long long mod = 1e9 + 7;
long long di[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
long long dj[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
template <typename T>
ostream& operator<<(ostream& cout, vector<T> res) {
for (long long i = 0; i < res.size(); i++) {
cout << res[i] << " ";
}
return cout;
}
template <typename T>
istream& operator>>(istream& cin, vector<T>& input) {
for (long long i = 0; i < input.size(); i++) {
cin >> input[i];
}
return cin;
}
vector<bool> isPrime(maxN, true);
vector<long long> primes;
long long power(long long a, long long b) {
long long res = 1;
while (b) {
if (b & 1) res = (res * a) % mod;
a = (a * a) % mod;
b >>= 1LL;
}
return res;
}
void seive() {
for (long long i = 2; i * i <= maxN; i++) {
if (isPrime[i]) {
primes.push_back(i);
for (long long j = i * i; j < maxN; j += i) isPrime[j] = false;
}
}
}
void solve() {
string s, t;
cin >> s >> t;
long long sz = s.size();
long long tz = t.size();
vector<long long> inds;
for (long long i = 0; i < sz; ++i) {
if (s[i] == t[0]) {
inds.push_back(i);
}
}
long long e = -1, o = -1;
for (long long start : inds) {
if (o == -1 and start & 1) o = start;
if (e == -1 and start % 2 == 0) e = start;
}
if (e != -1) {
long long j = 0;
while (j < tz and e < sz) {
if (s[e] == t[j]) {
e++;
j++;
} else {
e += 2;
}
}
if (j == tz and ((sz - e) % 2 == 0)) {
cout << "YES\n";
return;
}
}
if (o != -1) {
long long j = 0;
while (j < tz and o < sz) {
if (s[o] == t[j]) {
o++;
j++;
} else {
o += 2;
}
}
if (j == tz and ((sz - o) % 2 == 0)) {
cout << "YES\n";
return;
}
}
cout << "NO\n";
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long testCase = 1;
cin >> testCase;
while (testCase--) {
solve();
}
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int aray[1505][1505];
int N, M;
bool ok;
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};
inline int hsh(unsigned int r, unsigned int c) {
return ((r * 7) ^ (c * 3)) % (N * M + 103) + 1;
}
void dfs(int r, int c) {
if (ok) return;
int R = ((r % N) + N) % N, C = ((c % M) + M) % M;
if (aray[R][C] == 0 || aray[R][C] == hsh(r, c)) return;
if (aray[R][C] > 0) {
ok = true;
return;
}
aray[R][C] = hsh(r, c);
for (int d = (0); d < (4); d++) dfs(r + dx[d], c + dy[d]);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> N >> M;
int sr, sc;
for (int i = (0); i < (N); i++) {
for (int j = (0); j < (M); j++) {
char c;
cin >> c;
if (c != '#') aray[i][j] = -1;
if (c == 'S') {
sr = i;
sc = j;
}
}
}
dfs(sr, sc);
if (ok)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| 2 |
#include<iostream>
using namespace std;
int main(){
int n;
while(cin>>n && n){
int mp=0;
int md=0;
for(int i=0;i<n;i++){
int p,d1,d2;
cin>>p>>d1>>d2;
if(md < d1+d2){
mp=p;
md=d1+d2;
}
}
cout<<mp<<" "<<md<<endl;
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const double eps(1e-8);
const long long MOD = (long long)1e9 + 7;
int n, m, k, cnt;
int nxt[210][22], val[210], fail[210];
int l[210], r[210], lenL, lenR;
int NewTrie() {
int tmp = cnt++;
val[tmp] = 0;
for (int i = 0; i < m; i++) nxt[tmp][i] = -1;
return tmp;
}
void Insert(int tmp, int len) {
int x;
for (int i = 0; i < len; i++) {
scanf("%d", &x);
if (nxt[tmp][x] == -1) nxt[tmp][x] = NewTrie();
tmp = nxt[tmp][x];
}
scanf("%d", &x);
val[tmp] += x;
}
queue<int> q;
void Build(int root) {
fail[root] = root;
for (int i = 0; i < m; i++) {
if (nxt[root][i] == -1) {
nxt[root][i] = root;
} else {
fail[nxt[root][i]] = root;
q.push(nxt[root][i]);
}
}
while (!q.empty()) {
int tmp = q.front();
q.pop();
val[tmp] += val[fail[tmp]];
for (int i = 0; i < m; i++) {
if (nxt[tmp][i] == -1) {
nxt[tmp][i] = nxt[fail[tmp]][i];
} else {
fail[nxt[tmp][i]] = nxt[fail[tmp]][i];
q.push(nxt[tmp][i]);
}
}
}
}
void UPD(long long &x, long long y) {
x += y;
if (x >= MOD) x -= MOD;
}
long long dp[210][210][510];
long long dfs(int p, int sta, int v, int zero, int sameL, int sameR) {
if (v > k) return 0;
if (p == -1) return 1;
if (!sameL && !sameR) {
if (dp[p][sta][v] != -1) return dp[p][sta][v];
}
long long ret = 0;
for (int i = ((sameL) ? l[p] : 0); i < ((sameR) ? r[p] + 1 : m); i++) {
int newL, newR, newU = sta;
if (sameL)
newL = (i == l[p]);
else
newL = 0;
if (sameR)
newR = (i == r[p]);
else
newR = 0;
if (!zero || i) newU = nxt[sta][i];
long long d = dfs(p - 1, newU, v + val[newU], zero && (i == 0), newL, newR);
UPD(ret, d);
}
if (!(sameL || sameR)) dp[p][sta][v] = ret;
return ret;
}
void solve() {
memset(dp, -1, sizeof(dp));
cout << dfs(lenR - 1, 0, 0, 1, 1, 1) << endl;
}
int main() {
scanf("%d%d%d", &n, &m, &k);
scanf("%d", &lenL);
for (int i = 0; i < lenL; i++) scanf("%d", &l[i]);
scanf("%d", &lenR);
for (int i = 0; i < lenR; i++) scanf("%d", &r[i]);
reverse(l, l + lenL);
reverse(r, r + lenR);
cnt = 0;
int root = NewTrie();
for (int i = 0; i < n; i++) {
int x;
scanf("%d", &x);
Insert(root, x);
}
Build(root);
solve();
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, d, next, cnt = 0, now, i, diff;
scanf("%d%d", &n, &d);
scanf("%d", &now);
for (i = 1; i < n; i++) {
scanf("%d", &next);
if (next <= now) {
diff = (now - next) / d + 1;
next += diff * d;
cnt += diff;
}
now = next;
}
printf("%d\n", cnt);
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int num[210000], val[210000][4], np[210000][4], fin[210000];
int t1, t2, tot;
int head[210000], nex[210000 * 2], to[210000 * 2], cho[210000 * 2];
int h[210000], ne[210000 * 2], tq[210000 * 2], sum;
int has[210000], vis[210000], v[210000], used[210000];
int scc;
int vec[210000], cnt;
stack<int> s;
void add(int x, int y, int z) {
tot++;
nex[tot] = head[x];
head[x] = tot;
to[tot] = y;
cho[tot] = z;
}
void add1(int x, int y) {
sum++;
ne[sum] = h[x];
h[x] = sum;
tq[sum] = y;
}
void dfs2(int now, int fa) {
v[now] = 1;
s.push(now);
for (int i = head[now]; i; i = nex[i])
if (i / 2 != fa) {
if (v[to[i]]) {
if (val[cho[i]][1] == now)
fin[cho[i]] = np[cho[i]][2];
else
fin[cho[i]] = np[cho[i]][1];
scc = 1;
int tmp;
do {
tmp = s.top();
s.pop();
vis[tmp] = 1;
vec[++cnt] = tmp;
} while (tmp != to[i]);
return;
}
dfs2(to[i], i / 2);
if (scc) {
if (val[cho[i]][1] == now)
fin[cho[i]] = np[cho[i]][2];
else
fin[cho[i]] = np[cho[i]][1];
return;
}
}
s.pop();
}
void dfs(int now) {
vis[now] = 1;
for (int i = head[now]; i; i = nex[i])
if (!vis[to[i]]) {
if (val[cho[i]][1] == to[i])
fin[cho[i]] = np[cho[i]][1];
else
fin[cho[i]] = np[cho[i]][2];
dfs(to[i]);
}
}
void dfs1(int now) {
has[now] = 1;
for (int i = h[now]; i; i = ne[i]) {
if (num[tq[i]] == 2 && !used[tq[i]]) {
used[tq[i]] = 1;
if (val[tq[i]][1] == now) {
fin[tq[i]] = np[tq[i]][2];
if (!has[val[tq[i]][2]]) dfs1(val[tq[i]][2]);
} else {
fin[tq[i]] = np[tq[i]][1];
if (!has[val[tq[i]][1]]) dfs1(val[tq[i]][1]);
}
}
}
}
int main() {
tot = 1;
scanf("%d%d", &m, &n);
for (int i = 1; i <= m; i++) {
scanf("%d", &t1);
for (int j = 1; j <= t1; j++) {
scanf("%d", &t2);
if (t2 < 0) {
t2 = -t2;
val[t2][++num[t2]] = i;
np[t2][num[t2]] = 0;
} else {
val[t2][++num[t2]] = i;
np[t2][num[t2]] = 1;
}
add1(i, t2);
}
}
for (int i = 1; i <= n; i++) {
if (num[i] <= 1 || np[i][1] == np[i][2]) {
used[i] = 1;
for (int j = 1; j <= num[i]; j++) {
if (!has[val[i][j]]) dfs1(val[i][j]);
}
if (np[i][1] == 1)
fin[i] = 1;
else
fin[i] = 0;
}
}
for (int i = 1; i <= n; i++) {
if (num[i] == 2 && !has[val[i][1]] && !has[val[i][2]]) {
add(val[i][1], val[i][2], i);
add(val[i][2], val[i][1], i);
}
}
for (int i = 1; i <= m; i++)
if (!has[i] && !vis[i]) {
scc = 0;
cnt = 0;
dfs2(i, 0);
if (!scc) {
printf("NO\n");
return 0;
}
for (int i = 1; i <= cnt; i++) dfs(vec[i]);
}
printf("YES\n");
for (int i = 1; i <= n; i++) printf("%d", fin[i]);
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("in.in");
ofstream fout("out.out");
const int N = 1e5 + 10;
int n, m, erased[N], cnt[N], rem[N];
vector<int> a[N], v[N];
deque<vector<int> > ind[N];
queue<int> q;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
int x;
cin >> x;
a[i].push_back(x);
if (x != -1)
v[i].push_back(x);
else
erased[j]++;
}
sort(v[i].begin(), v[i].end());
v[i].resize(unique(v[i].begin(), v[i].end()) - v[i].begin());
vector<int> vec;
for (int j = 0; j < v[i].size(); j++) ind[i].push_back(vec);
for (int j = 0; j < m; j++)
if (a[i][j] != -1)
ind[i][lower_bound(v[i].begin(), v[i].end(), a[i][j]) - v[i].begin()]
.push_back(j);
}
vector<int> res;
for (int i = 0; i < m; i++)
if (erased[i] == n) res.push_back(i + 1);
while (res.size() < m) {
for (int i = 0; i < n; i++) {
if (rem[i] || ind[i].empty()) continue;
rem[i] = ind[i][0].size();
for (int j = 0; j < ind[i][0].size(); j++) {
int k = ind[i][0][j];
cnt[k]++;
if (cnt[k] == n - erased[k]) q.push(k);
}
ind[i].pop_front();
}
if (q.empty()) break;
while (!q.empty()) {
int j = q.front();
q.pop();
res.push_back(j + 1);
for (int i = 0; i < n; i++)
if (a[i][j] != -1) rem[i]--;
}
}
if (res.size() < m)
cout << -1;
else
for (int i = 0; i < res.size(); i++) cout << res[i] << ' ';
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
istream& operator>>(istream& in, pair<T1, T2>& a) {
in >> a.first >> a.second;
return in;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& out, pair<T1, T2> a) {
out << a.first << " " << a.second;
return out;
}
template <typename T, typename T1>
T amax(T& a, T1 b) {
if (b > a) a = b;
return a;
}
template <typename T, typename T1>
T amin(T& a, T1 b) {
if (b < a) a = b;
return a;
}
const long long INF = 1e18;
const int32_t M = 1e9 + 7;
const int32_t MM = 998244353;
const long long N = 0;
long long n;
long long k;
string s, a, b;
bool bigger(map<char, char> m, set<char> ss, long long pos) {
bool biga = 0;
bool smallb = 0;
for (long long i = pos; i < n; i++) {
if (m.count(s[i])) {
char c = m[s[i]];
if ((c < a[i] && !biga) || (c > b[i] && !smallb)) {
return 0;
}
if (c > a[i]) biga = 1;
if (c < b[i]) smallb = 1;
} else {
auto it = ss.begin();
if (!biga) {
it = ss.upper_bound(a[i]);
}
if (it == ss.end()) {
return 0;
}
char c = *it;
if (c <= b[i] || smallb) {
m[s[i]] = c;
ss.erase(c);
if (c < b[i]) smallb = 1;
biga = 1;
} else {
return 0;
}
}
}
cout << "YES\n";
string ans;
for (long long i = 0; i < k; i++) {
char c = 'a' + i;
if (m.count(c) == 0) {
m[c] = *ss.begin();
ss.erase(ss.begin());
}
ans.push_back(m[c]);
}
cout << ans << "\n";
return 1;
}
bool smaller(map<char, char> m, set<char> ss, long long pos) {
bool biga = 0;
bool smallb = 0;
for (long long i = pos; i < n; i++) {
if (m.count(s[i])) {
char c = m[s[i]];
if ((c < a[i] && !biga) || (c > b[i] && !smallb)) {
return 0;
}
if (c > a[i]) biga = 1;
if (c < b[i]) smallb = 1;
} else {
auto it = ss.end();
if (!smallb) {
it = ss.lower_bound(b[i]);
}
if (it == ss.begin()) {
return 0;
}
it--;
char c = *it;
if (c >= a[i] || biga) {
m[s[i]] = c;
ss.erase(c);
if (c > a[i]) biga = 1;
smallb = 1;
} else {
return 0;
}
}
}
cout << "YES\n";
string ans;
for (long long i = 0; i < k; i++) {
char c = 'a' + i;
if (m.count(c) == 0) {
m[c] = *ss.begin();
ss.erase(ss.begin());
}
ans.push_back(m[c]);
}
cout << ans << "\n";
return 1;
}
void solve() {
cin >> k >> s >> a >> b;
if (b < a) {
cout << "NO\n";
return;
}
map<char, char> m;
set<char> ss;
for (long long i = 0; i < k; i++) {
ss.insert(i + 'a');
}
long long pos = n;
n = (long long)((a).size());
for (long long i = 0; i < n; i++) {
if (a[i] == b[i]) {
char c = s[i];
if (m.count(c) && m[c] != a[i]) {
cout << "NO\n";
return;
}
if (m.count(c) == 0 && ss.count(a[i]) == 0) {
cout << "NO\n";
return;
}
m[c] = a[i];
ss.erase(a[i]);
} else {
pos = i;
break;
}
}
if (bigger(m, ss, pos)) {
return;
}
if (smaller(m, ss, pos)) {
return;
}
cout << "NO\n";
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long t = 1;
cin >> t;
while (t--) solve();
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int tot, i, j, k, n, m, a[210001], f[210001], c[210001], w, b[1001], ans,
g[210001];
int bs1(int x) {
int l = 1, r = tot, m;
if (x < c[1]) return 0;
while (l < r - 1) {
m = (l + r) >> 1;
if (x >= c[m])
l = m;
else
r = m - 1;
}
return (x >= c[r]) ? r : l;
}
int bs2(int x) {
int l = 1, r = tot, m;
if (x > c[1]) return 0;
while (l < r - 1) {
m = (l + r) >> 1;
if (x <= c[m])
l = m;
else
r = m - 1;
}
return (x <= c[r]) ? r : l;
}
int bfsolve() {
for (i = 2; i <= m; i++)
for (j = 1; j <= n; j++) a[n * (i - 1) + j] = a[j];
for (tot = c[0] = 0, i = 1; i <= n * m; i++) {
if (c[tot] <= a[i]) {
c[++tot] = a[i];
f[i] = tot;
continue;
}
k = bs1(a[i]);
f[i] = k + 1;
c[k + 1] = min(c[k + 1], a[i]);
}
return tot;
}
int main() {
scanf("%d%d", &n, &m);
w = n + 1;
memset(b, 0, sizeof(b));
for (i = 1; i <= n; i++) scanf("%d", &a[i]), b[a[i]]++;
if (m <= 2 * w) {
printf("%d\n", bfsolve());
return 0;
}
for (i = 2; i <= w; i++)
for (j = 1; j <= n; j++) a[n * (i - 1) + j] = a[j];
for (tot = c[0] = ans = 0, i = 1; i <= n * w; i++) {
if (c[tot] <= a[i]) {
c[++tot] = a[i];
f[i] = tot;
continue;
}
k = bs1(a[i]);
f[i] = k + 1;
c[k + 1] = min(c[k + 1], a[i]);
}
for (tot = c[0] = 0, i = n * w; i; i--) {
if (!tot || c[tot] >= a[i]) {
c[++tot] = a[i];
g[i] = tot;
continue;
}
k = bs2(a[i]);
g[i] = k + 1;
c[k + 1] = max(c[k + 1], a[i]);
}
for (i = n * (w - 1) + 1; i <= n * w; i++)
for (j = 1; j <= n; j++) {
if (a[i] > a[j]) continue;
ans = max(ans, f[i] + g[j] + (m - 2 * w) * b[a[i]]);
}
printf("%d\n", ans);
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
inline char skipwhitespace() {
char ch = getchar();
while (ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t') ch = getchar();
return ch;
}
void gi(int &x) {
register int c = getchar();
x = 0;
int sn = 1;
for (; (c < 48 || c > 57); c = getchar())
if (c == '-') sn = -1;
for (; c > 47 && c < 58; c = getchar()) {
x = (x << 1) + (x << 3) + c - 48;
}
x *= sn;
}
void gii(long long int &x) {
register long long int c = getchar();
x = 0;
long long int sn = 1;
for (; (c < 48 || c > 57); c = getchar())
if (c == '-') sn = -1;
for (; c > 47 && c < 58; c = getchar()) {
x = (x << 1) + (x << 3) + c - 48;
}
x *= sn;
}
void wi(int n) {
int sign = n >= 0 ? 1 : -1;
n = n > 0 ? n : -n;
char buf[10];
int i = 9;
if (!n) buf[i--] = 48;
while (n) {
buf[i--] = n % 10 + 48;
n /= 10;
}
if (sign < 0) printf("%c", '-');
while (++i < 10) printf("%c", buf[i]);
}
void wii(long long int n) {
long long int sign = n >= 0 ? 1 : -1;
n = n > 0 ? n : -n;
char buf[25];
long long int i = 24;
if (!n) buf[i--] = 48;
while (n) {
buf[i--] = n % 10 + 48;
n /= 10;
}
if (sign < 0) printf("%c", '-');
while (++i < 25) printf("%c", buf[i]);
}
int gs(char *s) {
char ch = skipwhitespace();
int n = 0;
while ((ch != '\n' && ch != ' ' && ch != '\t')) {
s[n++] = ch;
ch = getchar();
}
s[n] = 0;
return n;
}
void ws(char *s) {
char *p = s;
while (*p) {
printf("%c", *p);
p++;
}
}
typedef struct {
long long int lb, rb, b, s;
} nod;
long long int h[200005], d[200005];
nod a[200005 << 2];
void build(int nn, int s, int e) {
if (s == e) {
a[nn].s = 0;
a[nn].lb = a[nn].rb = a[nn].b = h[s] << 1;
return;
}
build(2 * nn + 1, s, (s + e) / 2);
build(2 * nn + 2, (s + e) / 2 + 1, e);
a[nn].b = max(a[2 * nn + 1].b,
max(a[2 * nn + 2].b,
a[2 * nn + 1].rb + d[(s + e) / 2] + a[2 * nn + 2].lb));
a[nn].lb = max(a[2 * nn + 1].lb,
a[2 * nn + 1].s + d[(s + e) / 2] + a[2 * nn + 2].lb);
a[nn].rb = max(a[2 * nn + 2].rb,
a[2 * nn + 2].s + d[(s + e) / 2] + a[2 * nn + 1].rb);
a[nn].s = a[2 * nn + 1].s + d[(s + e) / 2] + a[2 * nn + 2].s;
}
nod query(int nn, int s, int e, int l, int r) {
if (l == s && r == e) return a[nn];
int m = (s + e) / 2;
if (r <= m) return query(2 * nn + 1, s, (s + e) / 2, l, r);
if (l > m) return query(2 * nn + 2, (s + e) / 2 + 1, e, l, r);
nod aa, bb, cc;
aa = query(2 * nn + 1, s, (s + e) / 2, l, m);
bb = query(2 * nn + 2, (s + e) / 2 + 1, e, m + 1, r);
cc.b = max(aa.b, max(bb.b, aa.rb + d[(s + e) / 2] + bb.lb));
cc.lb = max(aa.lb, aa.s + d[(s + e) / 2] + bb.lb);
cc.rb = max(bb.rb, bb.s + d[(s + e) / 2] + aa.rb);
cc.s = aa.s + d[(s + e) / 2] + bb.s;
return cc;
}
int main() {
int n, q;
gi(n);
gi(q);
for (int i = 0; i < n; i++) gii(d[i]), d[i + n] = d[i];
for (int i = 0; i < n; i++) gii(h[i]), h[i + n] = h[i];
build(0, 0, (n << 1) - 1);
for (int i = 0; i < q; i++) {
int x, y;
gi(x);
gi(y);
x--;
y--;
if (x <= y)
wii(query(0, 0, (n << 1) - 1, y + 1, n + x - 1).b), printf("\n");
else
wii(query(0, 0, (n << 1) - 1, y + 1, x - 1).b), printf("\n");
}
return 0;
}
| 3 |
#include <bits/stdc++.h>
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using namespace std;
const int N = 3e5 + 1, NN = 1e6 + 1;
int n, a[N], cnt[NN], k;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> k;
for (int i = (1); i <= (n); ++i) {
cin >> a[i];
cnt[a[i]]++;
}
for (int i = (1); i <= (NN - 1); ++i) cnt[i] += cnt[i - 1];
int mn = *min_element(a + 1, a + 1 + n), mx = *max_element(a + 1, a + 1 + n);
if (mn <= k + 1)
cout << mn;
else {
for (int d = (mn); d >= (k + 1); --d) {
int num = 0;
for (int i = (0); i <= (mx / d); ++i)
num += cnt[min(NN - 1, i * d + k)] - (i == 0 ? 0 : cnt[i * d - 1]);
if (num == n) {
cout << d;
return 0;
}
}
}
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
void sober() {
long long int n, x = 0, a = 0, b = 0, y = 0, sum = 0, k = 0, m = 0, c = 0,
d = 0;
cin >> k;
n = 2;
for (unsigned long long int i = 1; i <= k; i++) {
if (i == 1) {
cout << "2\n";
continue;
}
cout << (i * (i + 1) * (i + 1) - (i - 1)) << "\n";
n = i * (i + 1);
}
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long int t = 1;
while (t--) {
sober();
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int mas[8][8][30];
string s[8];
int n = 8;
bool check(int x, int y, int v) {
if ((x < 0) || (x >= n) || (y < 0) || (y >= n)) return false;
if (v <= x)
if (s[x - v][y] == 'S') return false;
if (v <= x + 1)
if (s[x - v + 1][y] == 'S') return false;
return true;
}
void dfs(int x, int y, int v) {
if (v >= 30) return;
if (mas[x][y][v] == 1) return;
mas[x][y][v] = 1;
for (int dx = -1; dx < 2; dx++)
for (int dy = -1; dy < 2; dy++)
if (check(x + dx, y + dy, v + 1)) dfs(x + dx, y + dy, v + 1);
}
int main() {
for (int i = 0; i < n; i++) cin >> s[i];
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
for (int q = 0; q < 30; q++) mas[i][j][q] = 0;
dfs(7, 0, 0);
string s = "LOSE";
for (int i = 0; i < 30; i++)
if (mas[0][7][i] == 1) s = "WIN";
cout << s;
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
ll a,b,k,aa;
cin>>a>>b>>k;
aa=max(0ll,a-k);
k=max(0ll,k-a);
b=max(0ll,b-k);
cout<<aa<<" "<<b<<endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const long long int inf = 2e9;
const long long int N = 200005;
const long long int M = 100002;
long long int power(long long int x, long long int y, long long int p) {
long long int res = 1;
x = x % p;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
long long int ttt;
cin >> ttt;
while (ttt--) {
long long int n;
cin >> n;
long long int val = 4 * n;
bool flag = true;
for (long long int i = 1; i <= n; i++) {
if (flag) {
cout << val << ' ';
} else {
cout << val - 2 << ' ';
val -= 4;
}
flag = !flag;
}
cout << "\n";
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1100;
const int MAXB = 10;
int s[MAXN][MAXN];
short p[MAXB][MAXB][MAXN][MAXN];
int lg[MAXN];
inline int read() {
int x = 0;
char ch = 0;
while (!isdigit(ch)) ch = getchar();
while (isdigit(ch)) x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();
return x;
}
inline int query(int l, int d, int r, int u) {
int x = lg[r - l + 1], y = lg[u - d + 1];
return max(max(p[x][y][l][d], p[x][y][r - (1 << x) + 1][u - (1 << y) + 1]),
max(p[x][y][r - (1 << x) + 1][d], p[x][y][l][u - (1 << y) + 1]));
}
int main() {
int n, m, q;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
s[i][j] = s[i][j - 1] + s[i - 1][j] - s[i - 1][j - 1] + (read() ^ 1);
int l = 0, r = min(i, j);
while (l < r) {
int mid = l + r + 1 >> 1;
if (s[i][j] - s[i - mid][j] - s[i][j - mid] + s[i - mid][j - mid])
r = mid - 1;
else
l = mid;
}
p[0][0][i][j] = l;
}
for (int i = 1, l = 0; i <= n || i <= m; i++) lg[i] = l += 1 << l + 1 <= i;
for (int k = 1; 1 << k <= n; k++)
for (int i = 1; i + (1 << k) - 1 <= n; i++)
for (int j = 1; j <= m; j++)
p[k][0][i][j] =
max(p[k - 1][0][i][j], p[k - 1][0][i + (1 << k - 1)][j]);
for (int x = 0; 1 << x <= n; x++)
for (int y = 1; 1 << y <= m; y++)
for (int i = 1; i + (1 << x) - 1 <= n; i++)
for (int j = 1; j + (1 << y) - 1 <= m; j++)
p[x][y][i][j] =
max(p[x][y - 1][i][j], p[x][y - 1][i][j + (1 << y - 1)]);
scanf("%d", &q);
while (q--) {
int x1 = read(), y1 = read(), x2 = read(), y2 = read();
int l = 0, r = min(x2 - x1 + 1, y2 - y1 + 1);
while (l < r) {
int mid = l + r + 1 >> 1;
if (query(x1 + mid - 1, y1 + mid - 1, x2, y2) >= mid)
l = mid;
else
r = mid - 1;
}
printf("%d\n", l);
}
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T sqr(const T &x) {
return x * x;
}
template <typename T>
T my_abs(const T &x) {
return x < 0 ? -x : x;
}
const int INF = (int)1e9;
const long long LINF = (long long)4e18;
const long double EPS = 1e-9;
const long long MOD = (int)1e9 + 7;
const int dx[] = {-1, 0, 0, 1};
const int dy[] = {0, -1, 1, 0};
const int N = (int)2e3 + 10;
const int SQN = 400;
const int LOGN = 30;
char f[N][N];
bool inq[N][N];
bool check(int i, int j, int n, int m) {
int p = 0;
for (int k = 0; k < int(4); ++k) {
int ni = i + dx[k];
int nj = j + dy[k];
if (!((ni) >= 0 && (ni) < (n) && (nj) >= 0 && (nj) < (m)) ||
f[ni][nj] != '.') {
p++;
}
}
return p == 3;
}
void solve() {
int n, m;
scanf("%d %d\n", &n, &m);
int cnt = 0;
for (int i = 0; i < int(n); ++i) {
for (int j = 0; j < int(m); ++j) {
scanf("%c", &f[i][j]);
if (f[i][j] == '.') {
cnt++;
}
}
scanf("\n");
}
queue<pair<int, int> > q;
for (int i = 0; i < int(n); ++i) {
for (int j = 0; j < int(m); ++j) {
if (f[i][j] == '.' && check(i, j, n, m)) {
q.push(make_pair(i, j));
inq[i][j] = true;
}
}
}
while (!q.empty()) {
int x = q.front().first;
int y = q.front().second;
q.pop();
if (f[x][y] != '.') {
continue;
}
cnt -= 2;
int nx, ny;
for (int i = 0; i < int(4); ++i) {
nx = x + dx[i];
ny = y + dy[i];
if (((nx) >= 0 && (nx) < (n) && (ny) >= 0 && (ny) < (m)) &&
f[nx][ny] == '.') {
break;
}
}
if (x == nx) {
if (y < ny) {
f[x][y] = '<';
f[nx][ny] = '>';
} else {
f[x][y] = '>';
f[nx][ny] = '<';
}
} else {
if (x < nx) {
f[x][y] = '^';
f[nx][ny] = 'v';
} else {
f[x][y] = 'v';
f[nx][ny] = '^';
}
}
for (int k = 0; k < int(4); ++k) {
int ni = x + dx[k];
int nj = y + dy[k];
if (f[ni][nj] == '.' && check(ni, nj, n, m)) {
if (!inq[ni][nj]) {
q.push(make_pair(ni, nj));
inq[ni][nj] = true;
}
}
}
for (int k = 0; k < int(4); ++k) {
int ni = nx + dx[k];
int nj = ny + dy[k];
if (f[ni][nj] == '.' && check(ni, nj, n, m)) {
if (!inq[ni][nj]) {
q.push(make_pair(ni, nj));
inq[ni][nj] = true;
}
}
}
}
if (cnt != 0) {
cout << "Not unique" << endl;
return;
}
for (int i = 0; i < int(n); ++i) {
for (int j = 0; j < int(m); ++j) {
printf("%c", f[i][j]);
}
printf("\n");
}
}
int main() {
cout << setprecision(10) << fixed;
solve();
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);
#define ll long long int
#define ld long double
#define pb push_back
#define sp " "
#define mod (1000*1000*1000+7)
#define ff first
#define ss second
#define sz(x) (ll)x.size()
#define all(x) x.begin(),x.end()
#define pi pair<ll,ll>
#define vi vector<ll>
#define vii vector<pi>
#define val(x) cout<<#x<<" is "<<x<<endl
bool flag=true;
const ll N=2e5+10;
const ll inf = 998244353;
void solve()
{
ll i = 0, j = 0, ans = 0, x = 0, y = 0, z = 0;
ll n, k = 0, m = 0, mn = LLONG_MAX, mx = LLONG_MIN;
cin >> n ;
vi e,o;
for(i=0;i<n;i++)
{
cin>>x;
if(x%2==0)
e.pb(x);
else
o.pb(x);
}
for(auto it:e)
cout<<it<<sp;
for(auto it:o)
cout<<it<<sp;
cout<<endl;
}
int main()
{
fast;
ll T = 1, te = 1;
cin>>T;
while (T--)
{
//cout<<"Case #"<<te++<<": ";
solve();
}
return 0;
}
/*test cases
if (s1.find(s2) != string::neven)
z=cref[i1][j1]-cref[i1][j-1]-cref[i-1][j1]
+cref[i-1][j-1];
*/
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s,t;
cin>>s;
cin>>t;
int ans=t.size();
for(int i=0;i<=s.size()-t.size();++i)
{
int c=0;
for(int j=0;j<t.size();++j){
c+=s[j+i]!=t[j];
}
ans=min(ans,c);
}
cout<<ans<<endl;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
double n;
cin >> n;
if((int)(ceil(n / 1.08) * 1.08) == (int)n) cout << (int)ceil(n / 1.08);
else cout << ":(";
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int INF = (long long)(1 << 31) - 1;
const int M = 1e9 + 7;
vector<bool> used;
vector<int> lbuf, rbuf;
vector<pair<int, int>> plbuf, prbuf;
vector<pair<vector<int>, vector<pair<int, int>>>> g;
vector<long long> ans;
vector<long long> f;
struct point {
double x;
double y;
point(double x1, double y1) {
x = x1;
y = y1;
}
point() {}
bool operator==(point b) { return x == b.x && y == b.y; }
};
double range(point p1, point p2) {
return sqrt((p1.x - p2.x) * (p1.x - p2.x) + (p1.y - p2.y) * (p1.y - p2.y));
}
bool comp(pair<long long, long long> p1, pair<long long, long long> p2) {
return p1.first - p1.second >= p2.first - p2.second;
}
long long min(long long a, long long b, long long c) {
return min(min(a, b), c);
}
long long max(long long a, long long b, long long c) {
return max(max(a, b), c);
}
long long pow(long long a, long long b) {
if (b % 2 == 0) {
long long x = pow(a, b / 2);
return x * x;
} else
return pow(a, b - 1) * a;
}
long long fakt(long long a) {
if (f.size() - 1 >= a) {
return f[a];
}
long long x = fakt(a - 1) * a;
f.push_back(x);
return x;
}
long long dfs(int n, int a, int b) { return 1; }
double max(double a, double b) {
if (b >= a)
return b;
else
return a;
}
void merge_sort(vector<long long> &v, long long left, long long right) {
if (right - left <= 1) return;
long long mid = (left + right) / 2;
merge_sort(v, left, mid);
merge_sort(v, mid, right);
lbuf.assign(v.begin() + left, v.begin() + mid);
rbuf.assign(v.begin() + mid, v.begin() + right);
rbuf.push_back(INF);
lbuf.push_back(INF);
long long rp = 0, lp = 0;
for (int i = left; i < right; ++i) {
if (lbuf[lp] <= rbuf[rp]) {
v[i] = lbuf[lp];
++lp;
} else {
v[i] = rbuf[rp];
++rp;
}
}
}
void merge_sort(vector<pair<int, int>> &v, long long left, long long right) {
if (right - left <= 1) return;
long long mid = (left + right) / 2;
merge_sort(v, left, mid);
merge_sort(v, mid, right);
plbuf.assign(v.begin() + left, v.begin() + mid);
prbuf.assign(v.begin() + mid, v.begin() + right);
prbuf.push_back({INF, 0});
plbuf.push_back({INF, 0});
long long rp = 0, lp = 0;
for (int i = left; i < right; ++i) {
if (plbuf[lp].first - plbuf[lp].second <=
prbuf[rp].first - prbuf[rp].second) {
v[i] = plbuf[lp];
++lp;
} else {
v[i] = prbuf[rp];
++rp;
}
}
}
int main() {
int n;
cin >> n;
vector<long long> v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
merge_sort(v, 0, n);
long long min = INF, count = 0;
for (int i = 0; i < n - 1; ++i) {
if (abs(v[i] - v[i + 1]) < min) {
count = 1;
min = abs(v[i] - v[i + 1]);
} else if (abs(v[i] - v[i + 1]) == min) {
++count;
}
}
cout << min << " " << count;
return 0;
}
| 1 |
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <cassert>
#include <functional>
#include <string>
#define SIZE 200005
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
ll inv[SIZE],fac[SIZE],finv[SIZE];
void make()
{
fac[0]=fac[1]=1;
finv[0]=finv[1]=1;
inv[1]=1;
for(int i=2;i<SIZE;i++)
{
inv[i]=MOD-inv[MOD%i]*(MOD/i)%MOD;
fac[i]=fac[i-1]*(ll) i%MOD;
finv[i]=finv[i-1]*inv[i]%MOD;
}
}
ll C(int a,int b)
{
if(a<b) return 0;
return fac[a]*(finv[b]*finv[a-b]%MOD)%MOD;
}
ll mpow(ll x,ll t)
{
if(t==0) return 1;
ll ret=mpow(x,t/2);
ret=ret*ret%MOD;
if(t%2==1) ret=ret*x%MOD;
return ret;
}
int main()
{
make();
int n,A,B,DC;
scanf("%d %d %d %d",&n,&A,&B,&DC);
ll pa=(ll) A*inv[A+B]%MOD,pb=(ll) B*inv[A+B]%MOD;
ll ret=0;
for(int k=0;k<n;k++)
{
ret+=C(k+n-1,k)*mpow(pb,k)%MOD*mpow(pa,n)%MOD*(ll) (k+n)%MOD;
ret+=C(k+n-1,k)*mpow(pa,k)%MOD*mpow(pb,n)%MOD*(ll) (k+n)%MOD;
ret%=MOD;
}
//printf("%lld\n",ret);
ret=ret*inv[A+B]%MOD*100LL%MOD;
printf("%lld\n",ret);
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int MAX = 1000005;
int SetBit(int n, int x) { return n | (1 << x); }
int ClearBit(int n, int x) { return n & ~(1 << x); }
int ToggleBit(int n, int x) { return n ^ (1 << x); }
bool CheckBit(int n, int x) { return (bool)(n & (1 << x)); }
int main(void) {
int n, k, i, val;
while (scanf("%d %d", &n, &k) != EOF) {
deque<int> d;
for (i = 0; i < n; i++) {
scanf("%d", &val);
d.push_back(val);
}
int ans = 0;
while (1) {
if ((d.front() > k && d.back() > k) || d.empty()) break;
if (d.front() <= k) {
d.pop_front();
++ans;
if (d.empty()) break;
}
if (d.back() <= k) {
d.pop_back();
++ans;
if (d.empty()) break;
}
}
printf("%d\n", ans);
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
unsigned x;
char s[1000];
cin >> x >> s;
long long l = 0, size = strlen(s), max = 1e9 + 7;
int p = x;
vector<char> st(s, s + size);
while (p-- > 0) {
++l;
int t = st[l - 1] - '0';
size = (size + (t - 1) * (size - l)) % max;
if (st.size() < x) {
vector<char> sub(st.begin() + l, st.end());
while (--t > 0) st.insert(st.end(), sub.begin(), sub.end());
}
}
cout << (size % max + max) % max << "\n";
}
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
void _R(T &x) {
cin >> x;
}
void _R(int &x) { scanf("%d", &x); }
void _R(long long &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U>
void R(T &head, U &...tail) {
_R(head);
R(tail...);
}
template <class T>
void _W(const T &x) {
cout << x;
}
void _W(const int &x) { printf("%d", x); }
void _W(const long long &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T, class U>
void _W(const pair<T, U> &x) {
_W(x.first);
putchar(' ');
_W(x.second);
}
template <class T>
void _W(const vector<T> &x) {
for (auto i = x.begin(); i != x.end(); _W(*i++))
if (i != x.cbegin()) putchar(' ');
}
void W() {}
template <class T, class... U>
void W(const T &head, const U &...tail) {
_W(head);
putchar(sizeof...(tail) ? ' ' : '\n');
W(tail...);
}
int MOD = 1e9 + 7;
void ADD(long long &x, long long v) {
x = (x + v) % MOD;
if (x < 0) x += MOD;
}
const int SIZE = 1e6 + 10;
struct Union_Find {
int d[SIZE], num[SIZE];
void init(int n) {
for (int i = 0; i < (n); ++i) d[i] = i, num[i] = 1;
}
int find(int x) {
int y = x, z = x;
while (y != d[y]) y = d[y];
while (x != y) {
x = d[x];
d[z] = y;
z = x;
}
return y;
}
bool is_root(int x) { return d[x] == x; }
bool uu(int x, int y) {
x = find(x);
y = find(y);
if (x == y) return 0;
if (num[x] > num[y]) swap(x, y);
num[y] += num[x];
d[x] = y;
return 1;
}
} U;
long long C2(int x) { return x * (x - 1LL) / 2; }
int main() {
int n, m;
R(n, m);
U.init(n);
for (int i = 0; i < (m); ++i) {
int x, y;
R(x, y);
x--;
y--;
U.uu(x, y);
}
long long res = 0;
for (int i = 0; i < (n); ++i) {
if (U.is_root(i)) res += C2(U.num[i]);
}
W(res == m ? "YES" : "NO");
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
using ll=int64_t;
#define int ll
#define FOR(i,a,b) for(int i=int(a);i<int(b);i++)
#define REP(i,b) FOR(i,0,b)
#define MP make_pair
#define PB push_back
#define ALL(x) x.begin(),x.end()
#define REACH cerr<<"reached line "<<__LINE__<<endl
#define DMP(x) cerr<<"line "<<__LINE__<<" "<<#x<<":"<<x<<endl
#define ZERO(x) memset(x,0,sizeof(x))
using pi=pair<int,int>;
using vi=vector<int>;
using ld=long double;
template<class T,class U>
ostream& operator<<(ostream& os,const pair<T,U>& p){
os<<"("<<p.first<<","<<p.second<<")";
return os;
}
template<class T>
ostream& operator <<(ostream& os,const vector<T>& v){
os<<"[";
REP(i,(int)v.size()){
if(i)os<<",";
os<<v[i];
}
os<<"]";
return os;
}
int read(){
int i;
scanf("%" SCNd64,&i);
return i;
}
void printSpace(){
printf(" ");
}
void printEoln(){
printf("\n");
}
void print(int x,int suc=1){
printf("%" PRId64,x);
if(suc==1)
printEoln();
if(suc==2)
printSpace();
}
string readString(){
static char buf[3341919];
scanf("%s",buf);
return string(buf);
}
char* readCharArray(){
static char buf[3341919];
static int bufUsed=0;
char* ret=buf+bufUsed;
scanf("%s",ret);
bufUsed+=strlen(ret)+1;
return ret;
}
template<class T,class U>
void chmax(T& a,U b){
if(a<b)
a=b;
}
template<class T,class U>
void chmin(T& a,U b){
if(a>b)
a=b;
}
template<class T>
T Sq(const T& t){
return t*t;
}
const int inf=LLONG_MAX/3;
const int Nmax=114514;
int val[Nmax];
vi g[Nmax];
bool vis[Nmax];
int dfs(int v){
if(vis[v])return 0;
vis[v]=true;
int res=val[v];
for(auto to:g[v])
res+=dfs(to);
return res;
}
void No(){
cout<<"NO"<<endl;
exit(0);
}
void Yes(){
cout<<"YES"<<endl;
exit(0);
}
signed main(){
string s=readString();
int n=s.size();
REP(i,n/2)
val[i]=s[i]-s[n-1-i];
for(int i=n/2;i>=1;i--)
val[i]=val[i]-val[i-1];
int q=read();
REP(i,q){
int l=read()-1,r=read();
l=min(l,n-l);
r=min(r,n-r);
if(l>r)swap(l,r);
g[l].PB(r);
g[r].PB(l);
}
REP(i,n/2+1)if(!vis[i])
if(dfs(i)%26)
No();
Yes();
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int a[105], ans[105], n;
map<int, int> mp;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
for (int i = 1; i <= n; ++i) mp[a[i]] = i;
sort(a + 1, a + n + 1);
;
for (int i = 2; i <= n; ++i) {
ans[mp[a[i]]] = a[i - 1];
}
ans[mp[a[1]]] = a[n];
for (int i = 1; i <= n; ++i) printf("%d ", ans[i]);
return 0;
}
| 2 |
#include<stdio.h>
bool isline[100][1000];
int main(){
while(1){
int i,j;
int n,m,a;
scanf("%d %d %d",&n,&m,&a);
if(n==0)return 0;
for(i=0;i<n;i++)for(j=0;j<1000;j++)isline[i][j]=false;
for(i=0;i<m;i++){
int h,p,x;
scanf("%d %d %d",&h,&p,&x);
isline[p-1][h-1]=true;
}
int pos=a-1;
for(i=999;i>=0;i--){
if(isline[pos][i])pos++;
else if(pos>=1&&isline[pos-1][i])pos--;
}
printf("%d\n",pos+1);
}
}
| 0 |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <list>
#include <cmath>
#include <fstream>
#include <algorithm>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <complex>
#include <iterator>
#include <cstdlib>
#include <cstring>
#include <sstream>
using namespace std;
#define EPS (1e-10)
#define EQ(a,b) (abs((a) - (b)) < EPS)
#define EQV(a,b) (EQ((a).real(),(b).real()) && EQ((a).imag(),(b).imag()))
typedef complex<double> P;
typedef long long ll;
const int MAX_SIZE = 10000;
char field[501][501];
// wèµ½ê©ç㺶EÌ}XÉÅÉ»êéL
void solve(){
int h,w;
cin>>h>>w;
for(int i = 0; i < h; i++)
for(int j = 0; j < w; j++)
cin>>field[i][j];
const int dy[]={-1,0,0,1};
const int dx[]={0,1,-1,0};
bool update=true;
int score=0;
while(update){
update=false;
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
if(field[i][j]=='.'){
map<char,vector<pair<int,int> > > m;
// eûüÖTõ
for(int k = 0; k < 4; k++){
int x = j + dx[k];
int y = i + dy[k];
while(1){
if(!(x>=0&&y>=0&&y<h&&x<w))
break;
if(field[y][x]!='.'){
m[field[y][x]].push_back(make_pair(y,x));
break;
}
x+=dx[k];y+=dy[k];
}
}
// ñÂÈãÌÀWªüÁÄ¢éêª êÎAí
for(map<char,vector<pair<int,int> > >::iterator it = m.begin();it!=m.end();it++){
if(it->second.size()>=2){
update=true;
for(int k = 0; k < it->second.size(); k++){
field[it->second[k].first][it->second[k].second]='.';
score++;
}
}
}
}
}
}
}
cout<<score<<endl;
}
int main(){
solve();
return 0;
}
| 0 |
#include<iostream>
using namespace std;
int n,a;
int t[7],u[2];
bool v[7][7];
bool ud[7],vd[7];
void dfs(int pos){
if(vd[pos]==true)return;
vd[pos]=true;
for(int i=0;i<7;i++){
if(v[pos][i]==false)continue;
dfs(i);
}
}
bool check(){
for(int i=0;i<7;i++)vd[i]=false;
for(int i=0;i<7;i++)if(t[i]>0){dfs(i);break;}
for(int i=0;i<7;i++){
if(t[i]>0&&vd[i]==false)return false;
}
return true;
}
int main(){
while(cin>>n){
for(int i=0;i<7;i++)t[i]=0;
for(int i=0;i<7;i++)for(int j=0;j<7;j++)v[i][j]=false;
u[0]=u[1]=0;
for(int i=0;i<n;i++){
cin>>a;
t[a/10]++;
t[a%10]++;
v[a/10][a%10]=v[a%10][a/10]=true;
}
for(int i=0;i<7;i++)if(t[i]>0)u[t[i]%2]++;
if((u[1]==2||u[1]==0)&&check())cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
long long fastPow(int b, int n) {
if (n == 0) return 1;
long long po = fastPow(b, n / 2) % 1000000007;
po = (po * po) % 1000000007;
if (n & 1) return (po * b) % 1000000007;
return po;
}
int main() {
string s;
while (cin >> s) {
int n = s.size();
long long ans = 0;
for (int i = 0; i < s.size(); i++)
ans = (ans * 2 + s[i] - '0') % 1000000007;
ans = (ans * fastPow(2, n - 1)) % 1000000007;
cout << ans << endl;
}
}
| 3 |
#include<bits/stdc++.h>
using namespace std;
const int N=100005;
int m,n,Q;
struct func{
int a,b,w,t,k;
int g(int x){
if(x<=a)return w;
if(x<=b)return w+x-a;
return w+b-a;
}
void expand(int dt){
t+=dt;w+=dt*k;k=-k;
if(w+b-a<=0)a=b=m,w=0;else if(w<0)a-=w,w=0;
if(w>=m)a=b=m,w=m;else if(w+b-a>m)b-=w+b-a-m;
}
}f[N];
bool operator<(const int&a,const func&b){return a<b.t;}
int main(){
scanf("%d%d",&m,&n);
f[0]=(func){0,m,0,0,-1};
for(int i=1,t;i<=n;i++)f[i]=f[i-1],scanf("%d",&t),f[i].expand(t-f[i].t);
scanf("%d",&Q);
for(int t,a,p,r;Q--;){
scanf("%d%d",&t,&a);
p=upper_bound(f,f+n+1,t)-f-1;
r=f[p].g(a)+(t-f[p].t)*f[p].k;
if(r<0)r=0;if(r>m)r=m;
printf("%d\n",r);
}
return 0;
}
| 0 |
#include<bits/stdc++.h>
#define e(i,n) for(int i=0;i<n;i++)
using namespace std;int m[9],t[9];
bool F(){e(i,9){e(j,9)t[j]=m[j];if(t[i]>=2){t[i]-=2;bool o=1;
e(j,4){int p=0,d=0;while(!t[p])p++;if(!d&&t[p]>=3)t[p]-=3,d=1;
if(!d&&p<7)if(t[p+1]&&t[p+2])t[p]--,t[p+1]--,t[p+2]--,d=1;
if(!d){o=0;break;}}if(o)return 1;
}}return 0;}
int main(){string s;while(cin>>s){e(i,9)m[i]=0;int d=0;e(i,s.size())m[s[i]-'1']++;
e(i,9){m[i]++;if(m[i]<5)if(F()){if(d)cout<<" ";cout<<i+1;d=1;}m[i]--;}
if(!d)cout<<0;cout<<endl;
}return 0;}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,c[501],s[501],f[501];
cin>>n;
for(int i=1;i<n;++i)cin>>c[i]>>s[i]>>f[i];
for(int i=1;i<n;++i){
int t=0;
for(int j=i;j<n;++j){
if(t<s[j])t=s[j];
else if(t%f[j]!=0)t+=f[j]-t%f[j];
t+=c[j];
}
cout << t << endl;
}
cout << 0 << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
void solve() {
long long n, m, k;
cin >> n >> m >> k;
bool a[n], b[m];
for (long long i = 0; i < n; i++) cin >> a[i];
for (long long i = 0; i < m; i++) cin >> b[i];
vector<pair<long long, long long> > v;
for (long long i = 1; i * i <= k; ++i) {
if (k % i == 0) {
v.push_back(make_pair(i, k / i));
}
}
long long c = 0;
vector<long long> c_a(n + 1, 0), c_b(m + 1, 0);
for (long long i = 0; i < n; i++) {
if (a[i]) {
++c;
for (long long j = c; j > 0; --j) c_a[j]++;
} else {
c = 0;
}
}
c = 0;
for (long long i = 0; i < m; i++) {
if (b[i]) {
++c;
for (long long j = c; j > 0; --j) c_b[j]++;
} else {
c = 0;
}
}
long long sm = 0;
for (auto i : v) {
if (i.first != i.second) {
if (i.first <= n && i.second <= m) sm += c_a[i.first] * c_b[i.second];
if (i.first <= m && i.second <= n) sm += c_a[i.second] * c_b[i.first];
} else if (i.first <= n && i.second <= m)
sm += c_a[i.first] * c_b[i.second];
}
cout << sm;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t = 1;
for (long long i = 0; i < t; i++) {
solve();
}
return 0;
}
| 2 |
#include <bits/stdc++.h>
void max_pairs() {
int n;
std::cin >> n;
std::vector<int> boys;
for (int i = 0; i < n; i++) {
int num = 0;
std::cin >> num;
boys.push_back(num);
}
int m;
std::cin >> m;
std::vector<int> girls;
for (int i = 0; i < m; i++) {
int num = 0;
std::cin >> num;
girls.push_back(num);
}
std::sort(boys.begin(), boys.end());
std::sort(girls.begin(), girls.end());
int boy_pointer = 0;
int girl_pointer = 0;
int count = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (std::abs(boys[i] - girls[j]) <= 1) {
girls[j] = 1000;
count++;
break;
}
}
}
std::cout << count;
}
int main() { max_pairs(); }
| 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
for (int i = 21; i <= 50; ++i) {
cout << ((min(i, 25) + i) % (2 + i % 3) > 0) << "\n";
}
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
long double PI = acosl(-1);
bool compare_int(int a, int b) { return (a > b); }
bool compare_string(string a, string b) { return a.size() < b.size(); }
bool compare_pair(const pair<int, int> &a, const pair<int, int> &b) {
if (a.second == b.second)
return a.first < b.first;
else
return (a.second > b.second);
}
bool cmp(pair<string, int> x, pair<string, int> y) {
return (x.second < y.second);
}
void NA() {
printf("NO\n");
exit(0);
}
void YA() {
printf("YES\n");
exit(0);
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int p, x, y;
cin >> p >> x >> y;
bool ok = false;
int cnt1 = INT_MAX, cnt2 = INT_MAX;
for (int i = x; i >= 0; i -= 50) {
if (i < y) break;
int xx = i;
xx = (xx / 50) % 475;
for (int j = 1; j <= 25; j++) {
xx = (xx * 96 + 42) % 475;
if (xx + 26 == p) {
cnt1 = 0;
ok = true;
break;
}
}
if (ok) break;
}
ok = false;
for (int i = x + 50, k = 1; i <= 2000000; i += 50, k++) {
int xx = i;
xx = (xx / 50) % 475;
for (int j = 1; j <= 25; j++) {
xx = (xx * 96 + 42) % 475;
if (xx + 26 == p) {
cnt2 = k;
ok = true;
break;
}
}
if (ok) break;
}
cnt2 = (cnt2 + 1) / 2;
cout << min(cnt1, cnt2) << endl;
}
| 2 |
#include <bits/stdc++.h>
const int Max_N = 1e3 + 6;
using namespace std;
int main() {
int h1, h2, m1, m2;
char c;
cin >> h1 >> c >> m1;
cin >> h2 >> c >> m2;
int mid = (h2 * 60 + m2) - (h1 * 60 + m1);
mid /= 2;
h2 = (h1 * 60 + m1 + mid) / 60;
m2 = (h1 * 60 + m1 + mid) % 60;
printf("%02d:%02d", h2, m2);
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
long long n, m, mod;
long long a[maxn];
map<long long, long long> mp;
long long qpow(long long a, long long b, long long mod) {
long long res = 1;
while (b) {
if (b & 1) res = res * a < mod ? res * a : res * a % mod + mod;
a = a * a < mod ? a * a : a * a % mod + mod;
b >>= 1;
}
return res;
}
long long phi(long long n) {
long long res = n;
if (mp.find(n) != mp.end()) return mp[n];
for (long long i = 2; i * i <= n; i++) {
if (n % i == 0) {
res = res / i * (i - 1);
while (n % i == 0) n /= i;
}
}
if (n > 1) res = res / n * (n - 1);
return mp[n] = res;
}
long long solve(long long l, long long r, long long mod) {
if (l == r || mod == 1) return a[l] < mod ? a[l] : a[l] % mod + mod;
return qpow(a[l], solve(l + 1, r, phi(mod)), mod);
}
int main() {
scanf("%I64d%I64d", &n, &mod);
for (int i = 1; i <= n; i++) scanf("%I64d", &a[i]);
scanf("%I64d", &m);
long long l, r;
while (m--) {
scanf("%I64d%I64d", &l, &r);
printf("%I64d\n", solve(l, r, mod) % mod);
}
return 0;
}
| 4 |
#include<cstdio>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<set>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define reps(i,n) for(int i=1;i<=n;i++)
class S{
public:
vector<int> a;
S(){}
S(vector<int> a):a(a){}
void x(){
int tmp = a[0];
a[0]=a[4];
a[4]=a[5];
a[5]=a[1];
a[1]=tmp;
}
void y(){
int tmp = a[1];
a[1]=a[2];
a[2]=a[4];
a[4]=a[3];
a[3]=tmp;
}
void z(){
int tmp = a[0];
a[0]=a[2];
a[2]=a[5];
a[5]=a[3];
a[3]=tmp;
}
};
int main(){
while(1){
int n;
cin>>n;
if(n==0)break;
map<vector<int>,int> memo;
rep(i,n){
vector<int> b;
rep(j,6){
string a;
cin>>a;
switch(a[0]){
case 'C':b.push_back(0);break;
case 'Y':b.push_back(1);break;
case 'R':b.push_back(2);break;
case 'M':b.push_back(3);break;
case 'G':b.push_back(4);break;
case 'B':b.push_back(5);break;
}
}
S si = S(b);
rep(j,4){
si.x();
rep(k,4){
si.y();
rep(p,4){
si.z();
memo[si.a]=1;
}
}
}
}
printf("%d\n",n-(memo.size()/24));
}
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,k,a,c=0;
cin>>n>>m;
vector<int>v(m,0);
for(int i=0;i<n;i++){
cin>>k;
for(int j=0;j<k;j++){
cin>>a;
v[a-1]++;
}
}
for(int i=0;i<m;i++) if(v[i]==n) c++;
cout<<c<<endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int Max = 3.6e3 + 5, Mod = 998244353;
int w, h, n, dp[Max][Max];
long long Fact[Max], invFact[Max], rr[Max], cc[Max];
bool r[Max], c[Max];
long long fp(long long x, long long p) {
if (!p) return 1;
long long y = fp(x, p >> 1);
y = y * y % Mod;
if (p & 1) y = y * x % Mod;
return y;
}
long long C(long long N, long long K) {
if (N < 0 || N - K < 0 || K < 0) return 0;
return Fact[N] * invFact[N - K] % Mod * invFact[K] % Mod;
}
int main() {
Fact[0] = invFact[0] = 1;
for (int i = 1; i < Max; i++) {
Fact[i] = i * Fact[i - 1] % Mod;
invFact[i] = fp(Fact[i], Mod - 2);
}
cin >> h >> w >> n;
for (int i = 0; i < 2 * n; i++) {
int x, y;
cin >> x >> y;
r[x] = c[y] = 1;
}
dp[0][0] = 1;
for (int i = 1; i <= h; i++)
for (int j = 0; j <= w; j++) {
dp[i][j] = dp[i - 1][j];
if (i > 1 && j > 0 && r[i] + r[i - 1] == 0)
dp[i][j] = (dp[i][j] + dp[i - 2][j - 1]) % Mod;
}
for (int i = 0; i <= w; i++) rr[i] = dp[h][i] * Fact[i] % Mod;
for (int i = 1; i <= w; i++)
for (int j = 0; j <= h; j++) {
dp[i][j] = dp[i - 1][j];
if (i > 1 && j > 0 && c[i] + c[i - 1] == 0)
dp[i][j] = (dp[i][j] + dp[i - 2][j - 1]) % Mod;
}
for (int i = 0; i <= h; i++) cc[i] = dp[w][i] * Fact[i] % Mod;
long long ans = 0;
int hh = 0, ww = 0;
for (int i = 1; i <= h; i++) hh += !r[i];
for (int j = 1; j <= w; j++) ww += !c[j];
for (int i = 0; i <= h; i++)
for (int j = 0; j <= w; j++, ans %= Mod)
ans +=
cc[i] * rr[j] % Mod * C(hh - 2 * j, i) % Mod * C(ww - 2 * i, j) % Mod;
cout << ans << '\n';
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int total = 0;
int a[200][200];
int b[200][200];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> a[i][j];
b[i][j] = 0;
}
}
for (int i = 0; i < n; i++) {
if (b[i][n / 2] == 0) {
total += a[i][n / 2];
b[i][n / 2] = 1;
}
if (b[n / 2][i] == 0) {
total += a[n / 2][i];
b[n / 2][i] = 1;
}
if (b[i][i] == 0) {
total += a[i][i];
b[i][i] = 1;
}
if (b[n - i - 1][i] == 0) {
total += a[n - i - 1][i];
b[n - i - 1][i] = 1;
}
}
cout << total << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a / gcd(a, b) * b); }
unsigned long long power(unsigned long long a, unsigned long long b) {
a %= 1000000007;
unsigned long long res = 1;
while (b > 0) {
if (b & 1) res = res * a % 1000000007;
a = a * a % 1000000007;
b >>= 1;
}
return res % 1000000007;
}
long long modmul(long long x, long long y) { return (x * y) % 1000000007; }
long long modadd(long long x, long long y) { return (x + y) % 1000000007; }
long long modsub(long long x, long long y) {
return (x - y + 1000000007) % 1000000007;
}
long long fact[1000007] = {0};
void facto() {
fact[0] = 1;
fact[1] = 1;
for (long long i = 2; i < 100007; i++)
fact[i] = (fact[i - 1] * i) % 1000000007;
}
long long ncr(long long n, long long r) {
long long res = 1;
res = fact[n];
res = (res * (power(fact[r], 1000000007 - 2))) % 1000000007;
res = (res * (power(fact[n - r], 1000000007 - 2))) % 1000000007;
return res;
}
long long npr(long long n, long long r) {
long long res = 1;
res = fact[n];
res = (res * (power(fact[n - r], 1000000007 - 2))) % 1000000007;
return res;
}
using namespace std;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
string s;
cin >> s;
long long x = -1;
for (long long i = 0; i < s.length(); i++) {
if (s[i] == '0') {
x = i;
break;
}
}
if (x == -1) x = s.length() - 1;
for (long long i = 0; i < s.length(); i++) {
if (x != i) cout << s[i];
}
cout << endl;
}
| 1 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int M = 1010;
const int N = 1010;
const int mod = 1e9 + 7;
int INF = (int)1e8;
int dp[N][N][2];
int a[N][N];
int add(int a, int b)
{
return (a % mod + b % mod) % mod;
}
void solve()
{
int n;
cin>>n;
cout<<2-n*n<<endl;
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int t = 1;
// cin >> t;
for (int i = 1; i <= t; i++)
{
// cout << "Case #" << i << ": ";
solve();
}
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
using namespace std;
void chekarre(int* arr, int n) {
cout << "[";
for (int i = 0; i < n; i++) cout << arr[i] << " ";
cout << "]" << endl;
}
int hahahaha;
inline int haint() {
register char c = 0;
while (c < 33) c = getchar();
hahahaha = 0;
while (c > 33) {
hahahaha = hahahaha * 10 + c - '0';
c = getchar();
}
return hahahaha;
}
int n, m;
int solve() { return 1; }
double quad(double a, double b, double c) {
double x, temp;
temp = b * b - 4 * a * c;
if (temp < 0)
return 0;
else
x = (-b / 2 + sqrt(temp) / 2) / a;
return x;
}
bool input() {
int r, h;
cin >> r >> h;
int x = h % r, n1 = h / r * 2;
if (x >= sqrt(3) / 2 * r)
n1 += 3;
else if (2 * x >= r)
n1 += 2;
else
n1++;
cout << n1;
return true;
}
int main() {
int T = 1;
for (int testnum = 1; testnum <= T; testnum++) {
if (!input()) break;
solve();
}
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int a;
cin >> a;
string s = "";
while (a != 0) {
s += to_string(a % 2);
a /= 2;
}
reverse(s.begin(), s.end());
string ss = "";
long long int j = (long long int)6 - s.size();
for (long long int i = 0; i < j; i++) {
ss += "0";
}
ss += s;
s = ss;
swap(s[1], s[5]);
swap(s[2], s[3]);
reverse(s.begin(), s.end());
long long int ans = 0;
for (long long int i = 0; i < 6; i++) {
if (s[i] == '1') {
ans += pow(2, i);
}
}
cout << ans << "\n";
return 0;
}
| 3 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
bool isvowel(char c) {
if (c == 'a' || c == 'i' || c == 'u' || c == 'e' || c == 'o') return true;
return false;
}
string tocode(string s) {
const int N = s.size();
string res;
res += s[0];
for (int i = 0; i < N; ++i)
if (i < N - 1 && isvowel(s[i])) res += s[i + 1];
return res;
}
int match(string s1, string s2) {
const int N = min(s1.size(), s2.size());
int res = 0;
for (int i = 0; i < N; ++i) {
if (s1[i] == s2[i]) res++;
else break;
}
return res;
}
int main() {
int n;
while (cin >> n, n) {
vector<string> s(n);
for (int i = 0; i < n; ++i) {
cin >> s[i];
s[i] = tocode(s[i]);
}
sort(s.begin(), s.end());
int ans = 0;
for (int i = 1; i < n; ++i) {
if (s[i - 1] == s[i]) {
ans = -1;
break;
}
ans = max(ans, match(s[i - 1], s[i]) + 1);
}
cout << ans << endl;
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e5 + 5;
char s[maxn], t[maxn];
void get_next(char* x, int len, char* next) {
int i, j;
j = next[0] = -1;
i = 0;
while (i < len) {
while (-1 != j && x[i] != x[j]) j = next[j];
next[++i] = ++j;
}
}
int main() {
int h1, h2, m1, m2;
scanf("%d:%d%d:%d", &h1, &m1, &h2, &m2);
int sum = (h1 + h2) * 60 + m1 + m2;
sum /= 2;
printf("%02d:%02d\n", sum / 60, sum % 60);
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
string a, b;
cin >> a >> b;
reverse(a.begin(), a.end());
reverse(b.begin(), b.end());
int ind, ind2, cnt = 0;
for (int i = 0; i < b.length(); i++) {
if (b[i] == '1') {
ind = i;
break;
}
}
for (int i = ind; i < a.length(); i++) {
if (a[i] == '1') {
ind2 = i;
cnt = ind2 - ind;
break;
}
}
cout << cnt << "\n";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int T = 1;
cin >> T;
while (T--) {
solve();
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int n;
void solve() {
if (n == 5) {
printf(">...v\n");
printf("v.<..\n");
printf("..^..\n");
printf(">....\n");
printf("..^.<\n");
printf("%d %d\n", 1, 1);
} else if (n == 3) {
printf(">vv\n");
printf("^<.\n");
printf("^.<\n");
printf("%d %d\n", 1, 3);
} else {
for (int o = 1; o <= 50; ++o) {
for (int i = 1; i <= 51; ++i) printf(">");
for (int i = 1; i <= 24; ++i) printf(".>");
printf("v\n");
printf("^");
for (int i = 1; i <= 24; ++i) printf("<.");
for (int i = 1; i <= 51; ++i) printf("<");
printf("\n");
}
printf("%d %d\n", 1, n);
}
}
int main() {
while (~scanf("%d%*d", &n)) solve();
return 0;
}
| 4 |
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
void inout() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int main() {
inout();
ll t;
cin >> t;
while (t--) {
ll n, k;
cin >> n >> k;
vector<ll> a(n + 1);
for (int i = 1; i <= n; i++) cin >> a[i];
ll pre[2 * k + 15];
memset(pre, 0, sizeof(pre));
ll ans = n, l, r;
ll tmp = n;
map<ll, ll> mapi;
for (int i = 1; i <= n / 2; i++) {
mapi[a[i] + a[tmp]] += 1;
l = min(a[i], a[tmp]) + 1;
r = max(a[i], a[tmp]) + k;
pre[l] += 1;
pre[r + 1] -= 1;
tmp -= 1;
}
for (int i = 1; i <= 2 * k + 14; i++) pre[i] = pre[i - 1] + pre[i];
ll cnt0, cnt1, cnt2;
for (int i = 2; i <= 2 * k; i++) {
cnt0 = mapi[i];
cnt1 = pre[i] - cnt0;
cnt2 = (n / 2) - cnt1 - cnt0;
tmp = cnt1 + cnt2 * 2;
ans = min(ans, tmp);
}
cout << ans << "\n";
}
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxn = 1e5 + 5;
vector<int> adj[maxn];
int N, Q;
int sz[maxn];
bool vis[maxn];
int up[maxn];
int ans[maxn];
void findsz(int u, int p = -1) {
sz[u] = 1;
for (int v : adj[u]) {
if (v != p && !vis[v]) {
findsz(v, u);
sz[u] += sz[v];
}
}
}
int find_cen(int u, int p, int size) {
for (int v : adj[u]) {
if (v != p && !vis[v]) {
if (sz[v] > size / 2) {
return find_cen(v, u, size);
}
}
}
return u;
}
void centroid(int root = 1, int p = -1) {
findsz(root, root);
int k = find_cen(root, root, sz[root]);
up[k] = p;
vis[k] = 1;
for (int u : adj[k]) {
if (!vis[u]) {
centroid(u, k);
}
}
}
int cnt[maxn];
int p[maxn][20];
void dfs(int u = 1, int v = 0) {
p[u][0] = v;
for (auto &x : adj[u]) {
if (x == v) continue;
cnt[x] = cnt[u] + 1;
dfs(x, u);
}
}
int lca(int x, int y) {
if (cnt[x] < cnt[y]) swap(x, y);
for (int k = 19; k >= 0; --k) {
if (cnt[p[x][k]] >= cnt[y]) {
x = p[x][k];
}
}
if (x == y) return x;
for (int k = 19; k >= 0; --k) {
if (p[x][k] != p[y][k]) {
x = p[x][k];
y = p[y][k];
}
}
return p[x][0];
}
int D(int u, int v) {
int Lca = lca(u, v);
return cnt[u] - cnt[Lca] + cnt[v] - cnt[Lca];
}
void Init_lca(void) {
cnt[1] = 1;
dfs();
for (int k = 1; (1 << k) <= N; k++) {
for (int i = 1; i <= N; ++i) {
p[i][k] = p[p[i][k - 1]][k - 1];
}
}
}
signed main(void) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> N >> Q;
for (int i = 1, u, v; i < N; ++i) {
cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
for (int i = 1; i <= N; ++i) ans[i] = 1e8;
centroid();
Init_lca();
int u, v;
u = v = 1;
while (u != -1) {
ans[u] = min(ans[u], D(u, v));
u = up[u];
}
while (Q--) {
int type;
cin >> type >> v;
if (type == 1) {
u = v;
while (u != -1) {
ans[u] = min(ans[u], D(u, v));
u = up[u];
}
} else {
int res = 1e8;
u = v;
while (u != -1) {
res = min(res, ans[u] + D(u, v));
u = up[u];
}
ans[v] = res;
cout << res << '\n';
}
}
}
| 5 |
#include <iostream>
using namespace std;
int main() {
int n; cin>>n;
int p=1000000007;
int64_t a=1,b=1,c=1;
for (int i=0; i<n; i++) {
a = a * 10 % p;
b = b * 9 % p;
c = c * 8 % p;
}
cout << (a - b * 2 + c + p * 2) % p << endl;
return 0;
}
| 0 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
int main(){
int rep;
cin >> rep;
for(int r=0; r<rep; r++){
vector<pair<int, char> > card(9);
for(int i=0; i<9; i++) cin >> card[i].first;
for(int i=0; i<9; i++) cin >> card[i].second;
sort(card.begin(), card.end());
bool win = false;
do{
bool flag = true;
for(int i=0; i<9; i+=3){
if(card[i].second == card[i+1].second && card[i].second == card[i+2].second){
if((card[i].first +1 == card[i+1].first && card[i].first +2 == card[i+2].first)
|| (card[i].first == card[i+1].first && card[i].first == card[i+2].first)){
}else{
flag = false;
}
}else{
flag = false;
}
}
if(flag) win = true;
}while(next_permutation(card.begin(), card.end()));
if(win){
cout << 1 << endl;
}else{
cout << 0 << endl;
}
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
bool used[1000010], del[1000010];
vector<int> a[1000010], b[1000010];
int n, m;
void dfs(int x) {
for (int i = x; i <= n; i++)
if (del[i] == 0) {
del[i] = 1;
for (int j = 0; j < a[i].size(); j++) del[a[i][j]] = 1;
dfs(i + 1);
used[i] = 1;
for (int j = 0; j < b[i].size(); j++)
if (used[b[i][j]] == 1) {
used[i] = 0;
break;
}
return;
}
}
int main() {
scanf("%d%d", &n, &m);
int u, v;
for (int i = 1; i <= m; i++) {
scanf("%d%d", &u, &v);
a[u].push_back(v);
b[v].push_back(u);
}
dfs(1);
int cnt = 0;
for (int i = 1; i <= n; i++)
if (used[i] == 1) cnt++;
printf("%d\n", cnt);
for (int i = 1; i <= n; i++)
if (used[i] == 1) printf("%d ", i);
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 4e5 + 10;
int n, m, from[MAXN], to[MAXN], par[MAXN], sz;
pair<int, int> ans[MAXN];
int s, t, ds, dt, cs, ct;
int mark[MAXN];
int get_par(int v) { return par[v] == v ? v : par[v] = get_par(par[v]); }
int main() {
scanf("%d %d", &n, &m);
iota(par, par + n, 0);
for (int i = 0; i < m; i++)
scanf("%d %d", &from[i], &to[i]), from[i]--, to[i]--;
scanf("%d %d %d %d", &s, &t, &ds, &dt), s--, t--;
for (int i = 0; i < m; i++) {
if (from[i] == s || from[i] == t || to[i] == s || to[i] == t) continue;
int pa = get_par(from[i]);
int pb = get_par(to[i]);
if (pa == pb) continue;
par[pa] = pb;
ans[sz++] = {from[i] + 1, to[i] + 1};
}
for (int i = 0; i < m; i++) {
if (from[i] != s && to[i] != s) continue;
if (from[i] != s) swap(from[i], to[i]);
int p = get_par(to[i]);
mark[p] = 1;
}
for (int i = 0; i < m; i++) {
if (from[i] != t && to[i] != t) continue;
if (from[i] != t) swap(from[i], to[i]);
int p = get_par(to[i]);
mark[p] |= 2;
}
mark[s] = mark[t] = 0;
for (int i = 0; i < m; i++) {
if (from[i] != s && to[i] != s) continue;
if (from[i] != s) swap(from[i], to[i]);
int p = get_par(to[i]);
if (mark[p] == 1) {
par[p] = s;
ans[sz++] = {from[i] + 1, to[i] + 1};
cs++;
}
}
for (int i = 0; i < m; i++) {
if (from[i] != t && to[i] != t) continue;
if (from[i] != t) swap(from[i], to[i]);
int p = get_par(to[i]);
if (mark[p] == 2) {
par[p] = t;
ans[sz++] = {from[i] + 1, to[i] + 1};
ct++;
}
}
if (ct >= dt || cs >= ds) {
printf("No\n");
return 0;
}
bool fl = 0;
for (int i = 0; i < n; i++)
if (mark[i] == 3) fl = 1;
int z = -1;
if (!fl) {
ans[sz++] = {s + 1, t + 1};
par[s] = t;
cs++, ct++;
} else {
for (int i = 0; i < n; i++) {
int p = get_par(par[i]);
if (mark[p] == 3) {
z = p;
break;
}
}
ct++, cs++;
}
bool done = 0;
for (int i = 0; i < m; i++) {
if (from[i] != s && to[i] != s) continue;
if (from[i] != s) swap(from[i], to[i]);
int p = get_par(to[i]);
if (mark[p] == 3) {
if (z == p && done) continue;
if (p == z) done = 1, cs--;
if (cs < ds) {
ans[sz++] = {from[i] + 1, to[i] + 1};
cs++;
if (p ^ z) par[p] = s;
}
}
}
done = 0;
for (int i = 0; i < m; i++) {
if (from[i] != t && to[i] != t) continue;
if (from[i] != t) swap(from[i], to[i]);
int p = get_par(to[i]);
if (mark[p] == 3) {
if (z == p && done) continue;
if (p == z) done = 1, ct--;
if (ct < dt) {
ans[sz++] = {from[i] + 1, to[i] + 1};
ct++;
if (p ^ z) par[p] = t;
}
}
}
if (sz != n - 1) {
printf("No\n");
return 0;
}
printf("Yes\n");
for (int e = 0; e < n - 1; e++)
printf("%d %d\n", ans[e].first, ans[e].second);
return 0;
}
| 6 |
#include<iostream>
using namespace std;
int main(){
int x,y,z,ans;
cin>>x>>y>>z;
ans=(x-z)/(y+z);
cout<<ans<<endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long i, j, n, k, m, d;
cin >> n >> k >> m >> d;
long long mx = m;
for (i = 1; i < d; i++) {
if (n < (k * i)) break;
long long p = n / ((k * i) + 1);
long long d = min(p, m);
mx = max(mx, d * (i + 1));
}
cout << mx << endl;
}
| 3 |
#include<iostream>
#include<string>
#include<vector>
#include<cstdio>
#include<sstream>
#include<algorithm>
#include<cmath>
#include<map>
using namespace std;
int stoi(string x){stringstream ss;ss<<x;int tmp;ss>>tmp;return tmp;}
string itos(int x){stringstream ss;ss<<x;return ss.str();}
double ta[300][3];
bool used[300],tused[300];
int n,m;
double ans=0;
double solve(int now){
double ret=0.0;
while(true){
tused[now]=0;
int next=0,f=0;
for(int i=0;i<n;i++){
if(tused[i]&&!f)next=i,f=1;
}
for(int i=0;i<n;i++){
if(tused[i]){
for(int j=0;j<3;j++)ret+=(ta[i][j]-ta[now][j])*(ta[i][j]-ta[now][j]);
}
}
now=next;
bool endf=1;
for(int i=0;i<n;i++)if(tused[i])endf=0;
if(endf)break;
}
return ret;
}
void dfs(int h,int use){
if(h==n){
//for(int i=0;i<n;i++)cout<<used[i]<<" ";cout<<endl;
if(use==m){
int next=0;
for(int i=n-1;i>=0;i--)if(used[i])next=i,tused[i]=used[i];
ans=max(ans,solve(next));
}
return ;
}
used[h]=1;
dfs(h+1,use+1);
used[h]=0;
dfs(h+1,use);
}
int main(){
scanf("%d%d",&n,&m);
for(int i=0;i<n;i++)cin>>ta[i][0]>>ta[i][1]>>ta[i][2];
dfs(0,0);
printf("%.10f\n",ans);
return 0;
}
| 0 |
#include<iostream>
using namespace std;
int main(){
int N;
cin>>N;
if(N%2==0)cout<<(N-2)/2;
else cout<<(N-1)/2;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
void prefix(string pat, int Pi[]) {
Pi[0] = 0;
int i = 1, j = 0;
int sz = pat.size();
while (i < sz) {
if (pat[i] == pat[j])
Pi[i++] = ++j;
else if (j == 0)
Pi[i++] = 0;
else
j = Pi[j - 1];
}
}
bool KMP(string pattern, string target) {
int n = target.length(), m = pattern.length(), i = 0, j = 0, rest;
int Pi[m];
prefix(pattern, Pi);
while (i < n) {
if (target[i] == pattern[j]) {
i++, j++;
if (j == m) {
return 1;
}
} else if (j)
j = Pi[j - 1];
else
i++;
}
return 0;
}
int main() {
string pattern, target;
vector<pair<int, string>> vp;
int n;
cin >> n;
int a;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
a = s.size();
vp.push_back(make_pair(a, s));
}
sort(vp.begin(), vp.end());
for (int i = 0; i < n - 1; i++) {
pattern = vp[i].second;
target = vp[i + 1].second;
if (!KMP(pattern, target)) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
for (int i = 0; i < n; i++) {
cout << vp[i].second << endl;
}
}
| 2 |
#include <bits/stdc++.h>
int mapp[105] = {0};
char map[105][105];
int main() {
int i, j, n;
char ch;
scanf("%d%*c", &n);
for (i = 0; i < n; i++)
for (j = 0; j <= n; j++) {
scanf("%c", &map[i][j]);
if (map[i][j] == '.') mapp[i] = j + 1;
}
for (i = 0; i < n; i++)
if (!mapp[i]) break;
if (i == n)
for (j = 0; j < n; j++) printf("%d %d\n", j + 1, mapp[j]);
else {
for (j = 0; j < n; j++) {
mapp[j] = 0;
for (i = 0; i < n; i++)
if (map[i][j] == '.') mapp[j] = i + 1;
}
for (i = 0; i < n; i++)
if (!mapp[i]) break;
if (i == n)
for (j = 0; j < n; j++) printf("%d %d\n", mapp[j], j + 1);
else
printf("-1\n");
}
}
| 1 |
#include <bits/stdc++.h>
using std::pair;
using std::queue;
using std::sort;
const int N = 2010;
const int M = 800;
const int K = 10000;
const int INF = 0x3f3f3f3f;
int _w;
void bmin(int &a, int b) { a = a < b ? a : b; }
int n, a[N], b[N];
int id[K], m, st[M];
void prelude() {
static int tmp[4];
for (int a = 0; a < 10; ++a)
for (int b = a; b < 10; ++b)
for (int c = b; c < 10; ++c)
for (int d = c; d < 10; ++d) {
int x = a;
x = x * 10 + b;
x = x * 10 + c;
x = x * 10 + d;
id[x] = ++m, st[m] = x;
}
for (int a = 0; a < 10; ++a)
for (int b = 0; b < 10; ++b)
for (int c = 0; c < 10; ++c)
for (int d = 0; d < 10; ++d) {
tmp[0] = a;
tmp[1] = b;
tmp[2] = c;
tmp[3] = d;
sort(tmp, tmp + 4);
int x = 0;
for (int i = 0; i < 4; ++i) x = x * 10 + tmp[i];
int y = a;
y = y * 10 + b;
y = y * 10 + c;
y = y * 10 + d;
id[y] = id[x];
}
}
int f[N][M][10], inq[M][10];
queue<pair<int, int> > q;
void trans_move(int t, int s, int k) {
int now = f[t][s][k];
if (k < 9 && now + 1 < f[t][s][k + 1]) {
f[t][s][k + 1] = now + 1;
if (!inq[s][k + 1]) {
q.push(pair<int, int>(s, k + 1));
inq[s][k + 1] = 1;
}
}
if (k > 1 && now + 1 < f[t][s][k - 1]) {
f[t][s][k - 1] = now + 1;
if (!inq[s][k - 1]) {
q.push(pair<int, int>(s, k - 1));
inq[s][k - 1] = 1;
}
}
}
void trans_open(int t, int s, int k) {
static int tmp[4];
int now = f[t][s][k], cost = 0, cnt = 0, ot = t;
s = st[s];
for (int i = 0; i < 4; ++i) {
tmp[i] = s % 10;
s /= 10;
}
for (int i = 0; i < 4; ++i)
if (tmp[i] == k) {
tmp[i] = 0;
++cnt, ++cost;
} else if (tmp[i] == 0) {
++cnt;
}
while (cnt && a[t + 1] == k) {
--cnt, ++t, ++cost;
for (int i = 0; i < 4; ++i)
if (!tmp[i]) {
tmp[i] = b[t];
break;
}
}
sort(tmp, tmp + 4);
for (int i = 0; i < 4; ++i) s = s * 10 + tmp[i];
s = id[s];
if (now + cost < f[t][s][k]) {
f[t][s][k] = now + cost;
if (t == ot && !inq[s][k]) {
q.push(pair<int, int>(s, k));
inq[s][k] = 1;
}
}
}
void spfa(int t) {
memset(inq, 0, sizeof inq);
for (int i = 1; i <= m; ++i)
for (int j = 1; j < 10; ++j)
if (f[t][i][j] != INF) {
q.push(pair<int, int>(i, j));
inq[i][j] = 1;
}
while (!q.empty()) {
pair<int, int> now = q.front();
q.pop();
inq[now.first][now.second] = 0;
trans_move(t, now.first, now.second);
trans_open(t, now.first, now.second);
}
}
void solve() {
memset(f, 0x3f, sizeof f);
f[0][id[0]][1] = 0;
for (int i = 0; i <= n; ++i) spfa(i);
int ans = INF;
for (int i = 1; i < 10; ++i) bmin(ans, f[n][id[0]][i]);
printf("%d\n", ans);
}
int main() {
_w = scanf("%d", &n);
for (int i = 1; i <= n; ++i) _w = scanf("%d%d", a + i, b + i);
prelude(), solve();
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 3005;
const int MOD = 998244353;
int dp[MAXN][MAXN];
char s[MAXN], t[MAXN];
int main() {
scanf("%s", s + 1);
scanf("%s", t + 1);
int n = strlen(s + 1);
int m = strlen(t + 1);
for (int i = 1; i <= n; i++)
if (s[1] == t[i] || i > m) dp[i][i] = 1;
for (int len = 2; len <= n; len++)
for (int i = 1; i <= n - len + 1; i++) {
int j = i + len - 1;
if (j > m || s[len] == t[j]) dp[i][j] = (dp[i][j] + dp[i][j - 1]) % MOD;
if (i > m || s[len] == t[i]) dp[i][j] = (dp[i][j] + dp[i + 1][j]) % MOD;
}
int ans = 0;
for (int i = m; i <= n; i++) ans = (ans + dp[1][i]) % MOD;
printf("%d\n", ans * 2 % MOD);
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
long long dx[] = {-1, 1, 0, 0};
long long dy[] = {0, 0, -1, 1};
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n;
cin >> n;
long long cnt = 0;
while (true) {
if (!(n & 1)) {
cout << cnt + n / 2;
return 0;
}
bool stop = false;
for (long long i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
n -= i;
stop = 1;
cnt++;
break;
}
}
if (!stop) {
cout << 1 << "\n";
return 0;
}
}
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N/10%111==0||N%1000%111==0?"Yes":"No") << endl;
}
| 0 |
#include <stdio.h>
#include <math.h>
int main()
{
double r;
scanf("%lf", &r);
printf("%f %f\n", r * r * M_PI, 2 * M_PI * r);
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
bool graph[501][501];
int n, m;
char ch[501];
vector<int> a, b, c;
bool is_b(int i) {
for (int j = 1; j <= n; j++) {
if (j != i)
if (graph[i][j] == 0) return 0;
}
return 1;
}
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
graph[a][b] = graph[b][a] = 1;
}
for (int i = 1; i <= n; i++) {
if (is_b(i)) ch[i] = 'b';
}
for (int i = 1; i <= n; i++)
if (ch[i] != 'b') {
ch[i] = 'a';
for (int j = 1; j <= n; j++) {
if (i != j && ch[j] != 'b') {
if (graph[i][j])
ch[j] = 'a';
else
ch[j] = 'c';
}
}
}
for (int i = 1; i <= n - 1; i++) {
for (int j = i + 1; j <= n; j++) {
if (graph[i][j]) {
if ((ch[i] == 'a' && ch[j] == 'c') || (ch[i] == 'c' && ch[j] == 'a')) {
cout << "No";
return 0;
}
} else {
if (!(ch[i] == 'a' && ch[j] == 'c') &&
!(ch[i] == 'c' && ch[j] == 'a')) {
cout << "No";
return 0;
}
}
}
}
cout << "Yes" << endl;
for (int i = 1; i <= n; i++) cout << ch[i];
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int N;
signed long long A[303030];
void solve() {
int i, j, k, r, x, y;
string s;
cin >> N;
signed long long t = 0;
signed long long l = 0;
for (i = 0; i < (N); i++) {
cin >> A[i];
signed long long m = min(l, A[i] / 2);
t += m;
l -= m;
A[i] -= m * 2;
t += A[i] / 3;
A[i] %= 3;
l += A[i];
}
cout << t << endl;
}
int main(int argc, char** argv) {
string s;
int i;
if (argc == 1) ios::sync_with_stdio(false), cin.tie(0);
for (i = 0; i < (argc - 1); i++) s += argv[i + 1], s += '\n';
for (i = 0; i < (s.size()); i++) ungetc(s[s.size() - 1 - i], stdin);
cout.tie(0);
solve();
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
struct Edge {
int u, v, w, id;
Edge() {}
Edge(int U, int V, int W, int ID) : u(U), v(V), w(W), id(ID) {}
bool operator<(const Edge &e) const { return w < e.w; }
};
class UnionFind {
vector<int> a;
public:
UnionFind() {}
UnionFind(int n) : a(n, -1) {}
int find(int x) {
if (a[x] < 0) return x;
return a[x] = find(a[x]);
}
void unite(int x, int y) {
x = find(x), y = find(y);
if (x != y) {
a[x] += a[y];
a[y] = x;
}
}
int size(int x) { return -a[find(x)]; }
};
UnionFind uf;
vector<Edge> adj[100000];
int i_now;
int dp[200000], i_dp[200000];
int dfs(int u, int prev, int id) {
if (i_dp[id] == i_now) return dp[id];
int res = uf.size(u);
for (int i = 0; i < (adj[u].size()); i++) {
int v = adj[u][i].v, id2 = adj[u][i].id;
if (v != prev) res += dfs(v, u, id2);
}
i_dp[id] = i_now;
return dp[id] = res;
}
int main() {
int n;
scanf("%d", &n);
uf = UnionFind(n);
static Edge E[100000];
for (int i = 0; i < (n - 1); i++) {
int u, v, w;
scanf("%d%d%d", &u, &v, &w);
u--;
v--;
E[i] = Edge(u, v, w, i);
i_dp[i] = i_dp[i + n] = -1;
}
sort(E, E + n - 1);
static long long res[100000];
for (int i = 0; i < n - 1;) {
vector<Edge> E2;
for (int i0 = i; i < n - 1; i++) {
if (i == i0 || E[i - 1].w == E[i].w) {
E2.push_back(E[i]);
int u = uf.find(E[i].u), v = uf.find(E[i].v), id = E[i].id;
adj[u].push_back(Edge(u, v, -1, id));
adj[v].push_back(Edge(v, u, -1, id + n));
} else
break;
}
i_now = i;
for (int j = 0; j < (E2.size()); j++) {
int u = uf.find(E2[j].u), v = uf.find(E2[j].v), id = E2[j].id;
res[id] = 2LL * dfs(v, u, id) * dfs(u, v, id + n);
}
for (int j = 0; j < (E2.size()); j++) {
uf.unite(E2[j].u, E2[j].v);
int u = uf.find(E2[j].u), v = uf.find(E2[j].v);
adj[u].clear();
adj[v].clear();
}
}
long long ans = *max_element(res, res + n - 1);
printf("%I64d %d\n", ans, count(res, res + n - 1, ans));
for (int i = 0; i < (n - 1); i++)
if (res[i] == ans) printf("%d\n", i + 1);
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int ne, res, rr, cur;
int n, k, m;
int main() {
cin >> n >> k;
for (int i = 1; i <= k; i++) {
cin >> m;
int mm = m;
for (int j = 1; j <= m; j++) {
cin >> ne;
if (ne - 1 == cur)
++cur;
else if (cur != 0) {
res = res - cur + 1;
mm = mm - cur + 1;
cur = 0;
}
}
if (cur != 0) {
res = res - cur + 1;
mm = mm - cur + 1;
cur = 0;
}
res += mm - 1;
}
cout << res + n - 1;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void read(T& x) {
bool fu = 0;
char c;
for (c = getchar(); c <= 32; c = getchar())
;
if (c == '-') fu = 1, c = getchar();
for (x = 0; c > 32; c = getchar()) x = x * 10 + c - '0';
if (fu) x = -x;
};
template <class T>
inline void read(T& x, T& y) {
read(x);
read(y);
}
template <class T>
inline void read(T& x, T& y, T& z) {
read(x);
read(y);
read(z);
}
inline char getc() {
char c;
for (c = getchar(); c <= 32; c = getchar())
;
return c;
}
const int inf = int(1e9);
int n, m, i, j, k, l, p2, p, f, ans;
int L[155], R[155];
char a[155][155];
bool kong(int n) {
int i;
for (i = 1; i <= m; i++)
if (a[n][i] == 'W') return 0;
return 1;
}
int main() {
read(n, m);
for (i = 1; i <= n; i++) scanf("%s", a[i] + 1);
for (i = 1; i <= n; i++) L[i] = inf, R[i] = 0;
for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++)
if (a[i][j] == 'W') L[i] = min(L[i], j), R[i] = max(R[i], j);
int t = n;
for (; t > 1 && kong(t); t--)
;
p = 1;
f = 1;
L[n + 1] = inf;
for (i = 1; i <= t; i++) {
if (f == 1) {
p2 = max(max(R[i], R[i + 1]), p);
ans += p2 - p;
p = p2;
f = -1;
ans++;
} else {
p2 = min(min(L[i], L[i + 1]), p);
ans += p - p2;
p = p2;
f = 1;
ans++;
}
}
printf("%d\n", ans - 1);
scanf("\n");
return 0;
}
| 2 |
#include <bits/stdc++.h>
void fo() { fflush(stdout); }
using namespace std;
int main() {
int n, v;
scanf("%d%d", &n, &v);
vector<pair<int, int>> t1, t2;
for (int i = 0; i < n; i++) {
int ty, vl;
scanf("%d%d", &ty, &vl);
if (ty == 1) {
t1.push_back({vl, i + 1});
} else
t2.push_back({vl, i + 1});
}
sort(t1.rbegin(), t1.rend());
sort(t2.rbegin(), t2.rend());
vector<int> ans;
long long sum = 0;
for (int i = 0, j = 0; v && (i < (int)t1.size() || j < (int)t2.size());) {
if (i < (int)t1.size() && j < (int)t2.size()) {
if (v >= 2 && i + 1 < (int)t1.size()) {
if (t2[j].first > t1[i].first + t1[i + 1].first) {
v -= 2;
sum += t2[j].first;
ans.push_back(t2[j].second);
j++;
} else {
v -= 1;
sum += t1[i].first;
ans.push_back(t1[i].second);
i += 1;
}
} else {
if (v >= 2 && t2[j].first > t1[i].first) {
v -= 2;
sum += t2[j].first;
ans.push_back(t2[j].second);
j++;
} else {
v--;
sum += t1[i].first;
ans.push_back(t1[i].second);
i++;
}
}
} else if (v >= 2 && j < (int)t2.size()) {
v -= 2;
sum += t2[j].first;
ans.push_back(t2[j].second);
j++;
} else if (i < (int)t1.size()) {
v--;
sum += t1[i].first;
ans.push_back(t1[i].second);
i++;
} else
break;
}
printf("%lld\n", sum);
for (int i = 0; i < (int)ans.size(); i++) printf("%d ", ans[i]);
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
long long a[205], b[205];
long long f(long long x, long long p) {
long long res = 0;
while (x % p == 0) x /= p, res++;
return res;
}
long long dp[205][20205];
signed main() {
long long x, n, k, ma = 0, mb = 0;
cin >> n >> k;
for (long long i = 1; i <= n; i++) cin >> x, a[i] = f(x, 5), b[i] = f(x, 2);
memset(dp, -1, sizeof(dp));
dp[0][0] = 0;
ma = 10005;
for (long long i = 1; i <= n; i++)
for (long long j = k; j >= 1; j--)
for (long long o = ma; o >= a[i]; o--)
if (dp[j - 1][o - a[i]] != -1)
dp[j][o] = max(dp[j][o], dp[j - 1][o - a[i]] + b[i]);
long long ans = 0;
for (long long i = 0; i <= ma; i++) ans = max(ans, min(i, dp[k][i]));
cout << ans;
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
const int P = 1e9 + 7, INF = 0x3f3f3f3f;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long qpow(long long a, long long n) {
long long r = 1 % P;
for (a %= P; n; a = a * a % P, n >>= 1)
if (n & 1) r = r * a % P;
return r;
}
long long inv(long long first) {
return first <= 1 ? 1 : inv(P % first) * (P - P / first) % P;
}
const int N = 5e3 + 10;
int n, nn, a[N];
int f[N][27], g[N][27], C[N][N];
int main() {
scanf("%d", &n), nn = n;
for (int i = 1; i <= n; ++i) {
char c;
scanf(" %c", &c);
if (c == a[i - 1] + 'a' - 1)
--i, --n;
else
a[i] = c - 'a' + 1;
}
for (int i = 1; i <= n; ++i) {
memcpy(g, f, sizeof f);
for (int j = i - 1; j >= 1; --j) {
for (int k = 1; k <= 26; ++k)
if (k != a[i]) (f[j + 1][a[i]] += g[j][k]) %= P;
(f[j + 1][a[i]] -= g[j + 1][a[i]]) %= P;
}
f[1][a[i]] = 1;
}
for (int i = 0; i <= nn; ++i) {
C[i][0] = 1;
for (int j = 1; j <= i; ++j) C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % P;
}
long long ans = 0;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= 26; ++j)
ans += (long long)C[nn - 1][i - 1] * f[i][j] % P;
printf("%lld\n", (ans % P + P) % P);
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
struct node {
int v, c, limit;
node *opp, *next;
} mapp[41000];
node *listt[210];
int d[210], vd[210];
int e, n;
void addedge(int i, int j, int c) {
mapp[++e].v = j;
mapp[e].c = c;
mapp[e].limit = c;
mapp[e].opp = &mapp[e + 1];
mapp[e].next = listt[i];
listt[i] = &mapp[e];
mapp[++e].v = i;
mapp[e].c = 0;
mapp[e].limit = 0;
mapp[e].opp = &mapp[e - 1];
mapp[e].next = listt[j];
listt[j] = &mapp[e];
}
int min(int x, int y) { return ((x < y) ? x : y); }
int dfs(int i, int flow) {
int j, temp, ff = 0;
node *u;
if (i == n) return (flow);
u = listt[i];
while (u != NULL) {
j = u->v;
if (u->c > 0 && d[i] == d[j] + 1) {
temp = dfs(j, min(u->c, flow - ff));
u->c = u->c - temp;
u->opp->c = u->opp->c + temp;
ff += temp;
if (ff == flow) return (flow);
}
u = u->next;
}
if (d[1] >= n) return (ff);
vd[d[i]]--;
if (vd[d[i]] == 0) d[1] = n;
d[i]++;
vd[d[i]]++;
return (ff);
}
int c[110];
int main() {
e = 0;
for (int i = 0; i < 210; i++) listt[i] = NULL;
int N, M;
scanf("%d%d", &N, &M);
memset(c, 0, sizeof(c));
for (int i = 1; i <= N; i++) {
int rr;
scanf("%d", &rr);
c[rr]++;
}
for (int i = 1; i <= M; i++) {
addedge(1, i + 1, c[i]);
addedge(1 + M + i, 1 + M + M + 1, c[i]);
}
for (int i = 1; i <= M; i++)
for (int j = 1; j <= M; j++)
if (i != j) addedge(1 + i, 1 + M + j, 10000);
n = 1 + M + M + 1;
memset(d, 0, sizeof(d));
memset(vd, 0, sizeof(vd));
vd[0] = n;
int maxflow = 0;
while (d[1] <= n - 1) maxflow = maxflow + dfs(1, 100000000);
printf("%d\n", maxflow);
for (int i = 1; i <= M; i++) {
for (node *u = listt[i + 1]; u != NULL; u = u->next) {
int j = u->v;
for (int k = 1; k <= max(u->limit - u->c, 0); k++) {
printf("%d %d\n", i, j - 1 - M);
c[i]--;
}
}
}
for (int i = 1; i <= M; i++)
for (int j = 1; j <= c[i]; j++) printf("%d %d\n", i, i);
return 0;
}
| 3 |
#include <cstdio>
#include <algorithm>
using namespace std;
int main(){
int l,a,b,c,d;
scanf("%d%d%d%d%d", &l, &a, &b, &c, &d);
printf("%d\n", l-max(a/c+(a%c!=0),b/d+(b%d!=0)));
}
| 0 |
#include<iostream>
#include<cstdio>
#define ll long long
using namespace std;
ll n;
int main()
{
scanf("%lld",&n);
for(int a1=1;a1<=3500;a1++)
for(int a2=a1;a2<=3500;a2++)
{
ll fz=-n*a1-n*a2+4*a1*a2,fm=n*a1*a2;
if(fz>0&&fm>0&&fm%fz==0) {printf("%d %d %lld",a1,a2,fm/fz); return 0;}
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define vec vector
using namespace std;
int n, k;
vec<vec<int>> to;
vec<int> fr, spc;
vec<int> p, sz;
int par(int x) {
if (x != p[x]) p[x] = par(p[x]);
return p[x];
}
bool uni(int x, int y) {
x = par(x);
y = par(y);
if (x == y) return false;
if (sz[x] < sz[y]) swap(x, y);
p[y] = x;
sz[x] += sz[y];
return true;
}
vec<int> stt;
bool dfs(int cur) {
stt[cur] = 1;
if (spc[cur] >= 0) {
if (stt[spc[cur]] == 1) return false;
if (!stt[spc[cur]] && !dfs(spc[cur])) {
// cout << cur << ' ' << spc[cur] << '\n';
return false;
}
}
for (int x : to[cur]) {
if (stt[x] == 1) return false;
if (!stt[x] && !dfs(x)) {
// cout << cur << ' ' << x << '\n';
return false;
}
}
stt[cur] = 2;
return true;
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#ifdef LOCAL
// freopen("in1.txt", "r", stdin);
// freopen("in2.txt", "w", stdout);
#endif
cin >> n >> k;
fr = vec<int>(n);
to = vec<vec<int>>(n);
int str;
for (int i=0; i<n; i++) {
cin >> fr[i];
if (fr[i]--) to[fr[i]].push_back(i);
else str = i;
}
p = vec<int>(n);
sz = vec<int>(n);
for (int i=0; i<n; i++) {
p[i] = i;
sz[i] = 1;
}
spc = vec<int>(n, -1);
vec<bool> visx(n), visy(n);
for (int i=0; i<k; i++) {
int x, y;
cin >> x >> y;
--x; --y;
if (visx[x] || visy[y]) {
cout << 0 << '\n';
return 0;
}
visx[x] = visy[y] = 1;
if (!uni(x, y)) {
cout << 0 << '\n';
return 0;
}
spc[x] = y;
}
// cout << "input done\n";
stt = vec<int>(n);
if (!dfs(str)) {
cout << 0 << '\n';
return 0;
}
vec<vec<int>> grp(n);
vec<int> ina(n), inb(n);
for (int i=0; i<n; i++) {
int pi = par(i);
grp[pi].push_back(i);
for (int x : to[i]) {
int px = par(x);
if (px == pi) ina[x]++;
else inb[px]++;
}
if (spc[i] >= 0) ina[spc[i]]++;
}
// cout << "process done\n";
queue<int> pp;
for (int i=0; i<n; i++) {
if (par(i) == i && inb[i] == 0) {
pp.push(i);
}
}
vec<int> res;
while (!pp.empty()) {
int pcur = pp.front(); pp.pop();
// cout << pcur << ' ';
queue<int> qq;
for (int x : grp[pcur]) {
if (ina[x] == 0) qq.push(x);
}
while (!qq.empty()) {
int cur = qq.front(); qq.pop();
res.push_back(cur);
// cout << cur << ' ';
for (int x : to[cur]) {
int px = par(x);
if (pcur == px) ina[x]--;
else if (--inb[px] == 0) pp.push(px);
}
if (--ina[spc[cur]] == 0) qq.push(spc[cur]);
}
// cout << '\n';
}
if (res.size() != n) cout << 0;
else {
for (int x : res) cout << x+1 << ' ';
}
cout << '\n';
}
| 5 |
#include <iostream>
#include <string>
#include <vector>
#include <unordered_set>
#include <algorithm>
#include <bitset>
using namespace std;
typedef unsigned int ull;
static const ull HASH_BASE = 1000000007ull;
static const char CHARACTERS[] = ".ABCDEFGHIJKLMNOPQRSTUVWXYZ";
bool is_covered(
const string &t, int m, const vector<bitset<65536> *> &pieces)
{
const int n = t.size();
if(m > n){ return false; }
ull hash_remove = 1ull, h = 0ull;
for(int i = 0; i < m; ++i){
hash_remove *= HASH_BASE;
h = (h * HASH_BASE) + t[i];
}
int tail = 0;
for(int i = m; i <= n; ++i){
if(pieces[h >> 16] != nullptr && (*pieces[h >> 16])[h & 0xffff]){
tail = i;
}
//if(pieces.find(h) != pieces.end()){ tail = i; }
if(tail == i - m){ return false; }
h = (h * HASH_BASE) + t[i];
h -= (hash_remove * t[i - m]);
}
return tail == n;
}
int main(){
ios_base::sync_with_stdio(false);
while(true){
int d, n;
cin >> d >> n;
if(d == 0 && n == 0){ break; }
string s;
cin >> s;
vector<string> pieces(n);
for(int i = 0; i < n; ++i){ cin >> pieces[i]; }
const int m = pieces[0].size();
//unordered_set<ull> hashes(n);
vector<bitset<65536> *> hashes(65536, nullptr);
for(int i = 0; i < n; ++i){
ull hash = 0;
for(int j = 0; j < m; ++j){
hash = (hash * HASH_BASE) + pieces[i][j];
}
//hashes.insert(hash);
if(hashes[hash >> 16] == nullptr){
hashes[hash >> 16] = new bitset<65536>();
}
hashes[hash >> 16]->set(hash & 0xffff);
}
n = s.size();
ull hash_remove = 1;
for(int i = 0; i < m; ++i){ hash_remove *= HASH_BASE; }
vector<string> solutions;
if(is_covered(s, m, hashes)){ solutions.push_back(s); }
if(d >= 1){
// insert
for(int i = 0; i <= n; ++i){
string t(n + 1, ' ');
for(int j = 0; j < n; ++j){
t[j >= i ? j + 1 : j] = s[j];
}
for(int x = 0; x < 27; ++x){
t[i] = CHARACTERS[x];
if(is_covered(t, m, hashes)){ solutions.push_back(t); }
}
}
// replace
for(int i = 0; i < n; ++i){
string t(s);
for(int x = 0; x < 27; ++x){
t[i] = CHARACTERS[x];
if(is_covered(t, m, hashes)){ solutions.push_back(t); }
}
}
// remove
for(int i = 0; i < n; ++i){
string t(n - 1, ' ');
for(int j = 0, k = 0; j < n; ++j){
if(i == j){ continue; }
t[k++] = s[j];
}
if(is_covered(t, m, hashes)){ solutions.push_back(t); }
}
}
if(d >= 2){
// insert
for(int i = 0; i <= n; ++i){
string t1(n + 1, ' ');
for(int j = 0; j < n; ++j){
t1[j >= i ? j + 1 : j] = s[j];
}
// insert-insert
for(int j = 0; j <= n + 1; ++j){
string t2(n + 2, ' ');
for(int k = 0; k <= n; ++k){
t2[k >= j ? k + 1 : k] = t1[k];
}
for(int a = 0; a < 27; ++a){
t2[i] = CHARACTERS[a];
for(int b = 0; b < 27; ++b){
t2[j] = CHARACTERS[b];
if(is_covered(t2, m, hashes)){
solutions.push_back(t2);
}
}
}
}
// insert-replace
for(int j = 0; j <= n; ++j){
if(i == j){ continue; }
string t2(t1);
for(int a = 0; a < 27; ++a){
t2[i] = CHARACTERS[a];
for(int b = 0; b < 27; ++b){
t2[j] = CHARACTERS[b];
if(is_covered(t2, m, hashes)){
solutions.push_back(t2);
}
}
}
}
// insert-remove
for(int j = 0; j <= n; ++j){
if(i == j){ continue; }
string t2(n, ' ');
for(int k = 0, p = 0; k <= n; ++k){
if(k == j){ continue; }
t2[p++] = t1[k];
}
const int p = (i >= j ? i - 1 : i);
for(int a = 0; a < 27; ++a){
t2[p] = CHARACTERS[a];
if(is_covered(t2, m, hashes)){
solutions.push_back(t2);
}
}
}
}
// replace
for(int i = 0; i < n; ++i){
// replace-replace
for(int j = i + 1; j < n; ++j){
string t(s);
for(int a = 0; a < 27; ++a){
t[i] = CHARACTERS[a];
for(int b = 0; b < 27; ++b){
t[j] = CHARACTERS[b];
if(is_covered(t, m, hashes)){
solutions.push_back(t);
}
}
}
}
// replace-remove
for(int j = 0; j < n; ++j){
if(i == j){ continue; }
string t(n - 1, ' ');
for(int k = 0, p = 0; k < n; ++k){
if(k == j){ continue; }
t[p++] = s[k];
}
const int p = (i >= j ? i - 1 : i);
for(int a = 0; a < 27; ++a){
t[p] = CHARACTERS[a];
if(is_covered(t, m, hashes)){
solutions.push_back(t);
}
}
}
}
// remove-remove
string t(n - 2, ' ');
for(int i = 0; i < n; ++i){
for(int j = i + 1; j < n; ++j){
for(int k = 0, p = 0; k < n; ++k){
if(k == i || k == j){ continue; }
t[p++] = s[k];
}
if(is_covered(t, m, hashes)){
solutions.push_back(t);
}
}
}
}
sort(solutions.begin(), solutions.end());
solutions.erase(
unique(solutions.begin(), solutions.end()), solutions.end());
cout << solutions.size() << endl;
if(solutions.size() <= 5){
for(const auto &sol : solutions){ cout << sol << endl; }
}
for(auto ptr : hashes){ delete ptr; }
}
return 0;
}
| 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.