#include<bits/stdc++.h>
using namespace std;voidfre(){freopen("A.txt","r",stdin);freopen("Ans.txt","w",stdout);}voidFre(){freopen("A.txt","r",stdin);}#define ios ios::sync_with_stdio(false)#define Pi acos(-1)#define pb push_back#define fi first#define se second#define ll long long#define ull unsigned long long #define db double#define Pir pair<int, int>#define PIR pair<Pir, Pir>#define INF 0x3f3f3f3f#define mod 998244353constint mxn =2e2+10;int mz[mxn][mxn];int row[mxn];int col[mxn];intmain(){/* fre(); */int T;scanf("%d",&T);while(T --){memset(row,0,sizeof(row));memset(col,0,sizeof(col));int n, m;scanf("%d %d",&n,&m);for(int i =1; i <= n; i ++)for(int j =1; j <= m; j ++){scanf("%d",&mz[i][j]);if(mz[i][j]==1)
row[i]=1, col[j]=1;}int sum =0;for(int i =1; i <= n; i ++){if(row[i]==0){for(int j =1; j <= m; j ++){if(col[j]==0){
sum ++;
row[i]=1, col[j]=1;break;}}}}if(sum %2)printf("Ashish\n");elseprintf("Vivek\n");}return0;}
B. Trouble Sort(思維)
分析
題意
給我們一個序列,這個序列中的元素值爲ai,類型爲bi = 0或1,如果在這個序列中 bi != bj ,我們可以交互兩個數的位置,問經過若干次這樣的操作之後,能否把這個序列變成 按ai值 非嚴格遞增?
#include<bits/stdc++.h>
using namespace std;voidfre(){freopen("A.txt","r",stdin);freopen("Ans.txt","w",stdout);}voidFre(){freopen("A.txt","r",stdin);}#define ios ios::sync_with_stdio(false)#define Pi acos(-1)#define pb push_back#define fi first#define se second#define ll long long#define ull unsigned long long #define db double#define Pir pair<int, int>#define PIR pair<Pir, Pir>#define INF 0x3f3f3f3f#define mod 998244353constint mxn =2e5+10;int ar[mxn], br[mxn];intmain(){/* fre(); */int T;scanf("%d",&T);while(T --){int n;scanf("%d",&n);
Pir fg(0,0);for(int i =1; i <= n; i ++)scanf("%d",&ar[i]);
bool zeng =1;for(int i =1; i <= n; i ++){scanf("%d",&br[i]);if(br[i]==0)
fg.fi =1;else
fg.se =1;if(ar[i]- ar[i -1]<0)
zeng =0;}if(fg.fi && fg.se)printf("Yes\n");elseif(zeng)printf("Yes\n");elseprintf("No\n");}return0;}
#include<bits/stdc++.h>
using namespace std;voidfre(){freopen("A.txt","r",stdin);freopen("Ans.txt","w",stdout);}voidFre(){freopen("A.txt","r",stdin);}#define ios ios::sync_with_stdio(false)#define Pi acos(-1)#define pb push_back#define fi first#define se second#define ll long long#define ull unsigned long long #define db double#define Pir pair<int, int>#define PIR pair<Pir, Pir>#define INF 0x3f3f3f3f#define mod 998244353constint mxn =2e5+10;int a[mxn], b[mxn];int pa[mxn], pb[mxn];int br[mxn];intmain(){/* fre(); */int n;scanf("%d",&n);for(int i =1; i <= n; i ++)scanf("%d",&a[i]), pa[a[i]]= i;for(int j =1; j <= n; j ++)scanf("%d",&b[j]), pb[b[j]]= j;for(int i =1; i <= n; i ++){
br[(pa[i]- pb[i]+ n)% n]++;}int ans =0;for(int i =0; i < n; i ++){
ans =max(ans, br[i]);}printf("%d\n", ans);return0;}
#include<bits/stdc++.h>
using namespace std;voidfre(){freopen("A.txt","r",stdin);freopen("Ans.txt","w",stdout);}voidFre(){freopen("A.txt","r",stdin);}#define ios ios::sync_with_stdio(false)#define Pi acos(-1)#define pb push_back#define fi first#define se second#define ll long long#define ull unsigned long long #define db double#define Pir pair<int, int>#define PIR pair<Pir, Pir>#define INF 0x3f3f3f3f#define mod 998244353constint mxn =2e2+10;char mz[mxn][mxn];int mov[4][2]={{1,0},{0,1},{-1,0},{0,-1}};int sum =0;int n, m;voiddfs(int x,int y){for(int i =0; i <4; i ++){int tx = x + mov[i][0];int ty = y + mov[i][1];if(tx <1|| ty <1|| tx > n || ty > m || mz[tx][ty]=='#')continue;if(mz[tx][ty]=='G') sum ++;
mz[tx][ty]='#';dfs(tx, ty);}}
bool judge(int x,int y){if(x >=1&& y >=1&& x <= n && y <= m && mz[x][y]=='G')return true;return false;}voidchange(int x,int y){if(x >=1&& y >=1&& x <= n && y <= m && mz[x][y]!='B')
mz[x][y]='#';}intmain(){/* fre(); */int T;scanf("%d",&T);while(T --){
sum =0;scanf("%d %d",&n,&m);int cg =0;for(int i =1; i <= n; i ++){scanf("%s", mz[i]+1);for(int j =1; j <= m; j ++)if(mz[i][j]=='G')
cg ++;}int fg =1;for(int i =1; i <= n; i ++){for(int j =1; j <= m; j ++)if(mz[i][j]=='B'&&judge(i, j +1)){
fg =0;break;}elseif(mz[i][j]=='B'){change(i -1, j);change(i +1, j);change(i, j -1);change(i, j +1);}if(! fg)break;}if(fg ==0){printf("No\n");continue;}if(mz[n][m]=='#'){if(cg ==0)printf("Yes\n");elseprintf("No\n");}else{dfs(n, m);if(sum == cg)printf("Yes\n");elseprintf("No\n");}}return0;}
#include<bits/stdc++.h>
using namespace std;voidfre(){freopen("A.txt","r",stdin);freopen("Ans.txt","w",stdout);}voidFre(){freopen("A.txt","r",stdin);}#define ios ios::sync_with_stdio(false)#define Pi acos(-1)#define pb push_back#define fi first#define se second#define ll long long#define ull unsigned long long #define db double#define Pir pair<int, int>#define PIR pair<Pir, Pir>#define INF 0x3f3f3f3f#define mod 998244353constint mxn =2e3+10;
ll ar[mxn];intmain(){/* fre(); */int n;scanf("%d",&n);for(int i =1; i <= n; i ++)scanf("%lld",&ar[i]);
ll ans =0;for(int i =1; i <= n; i ++)for(int j =1; j <= n; j ++)for(int k =1; k <= n; k ++)
ans =max(ans, ar[i]| ar[j]| ar[k]);printf("%lld", ans);return0;}