250 简单题
// BEGIN CUT HERE
// END CUT HERE
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <ctime>
#include <utility>
#include <iterator>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef set<int> si;
typedef map<int,int> mii;
typedef map<string,int> msi;
typedef priority_queue<int,vector<int>,greater<int> > pless;
typedef priority_queue<int> pgreater;
#define clr(x,a) memset(x,a,sizeof(x))
#define sz(x) (int)x.size()
#define pb push_back
#define mp make_pair
#define REP(i,n) for(i=0;i<(n);++i)
#define FOR(i,l,h) for(i=(l);i<=(h);++i)
#define FORD(i,h,l) for(i=(h);i>=(l);--i)
class CatchTheBeatEasy
{
private:
vector<pair<int,int> > vp;
public:
int myabs(int x){
if(x>=0) return x;
return -x;
}
string ableToCatchAll(vector <int> x, vector <int> y)
{
int n=sz(x);
vp.clear();
int prex=0,pret=0;
for(int i=0;i<n;i++)
vp.pb(mp(y[i],x[i]));
sort(vp.begin(),vp.end());
for(int i=0;i<n;i++){
int t=myabs(prex-vp[i].second);
int rest=vp[i].first-pret;
if(rest<t)
return "Not able to catch";
prex=vp[i].second;
pret=vp[i].first;
}
return "Able to catch";
}
// BEGIN CUT HERE
// END CUT HERE
};
// BEGIN CUT HERE
450 简单题
// BEGIN CUT HERE
// END CUT HERE
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <ctime>
#include <utility>
#include <iterator>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef set<int> si;
typedef map<int,int> mii;
typedef map<string,int> msi;
typedef priority_queue<int,vector<int>,greater<int> > pless;
typedef priority_queue<int> pgreater;
#define clr(x,a) memset(x,a,sizeof(x))
#define sz(x) (int)x.size()
#define pb push_back
#define mp make_pair
#define REP(i,n) for(i=0;i<(n);++i)
#define FOR(i,l,h) for(i=(l);i<=(h);++i)
#define FORD(i,h,l) for(i=(h);i>=(l);--i)
typedef pair<int,int> pii;
class CatAndRat
{
public:
double getTime(int R, int T, int Vrat, int Vcat)
{
double pi=acos(-1.0);
if(Vrat>=Vcat && T!=0)
return -1.0;
if(T==0)
return 0.0;
double C=pi*2*R;
double dist;
if(Vrat*T>=C/2.0) dist=C/2.0;
else dist=Vrat*T;
return dist/(Vcat-Vrat);
}
// BEGIN CUT HERE
// END CUT HERE
};
// BEGIN CUT HERE
// BEGIN CUT HERE
// END CUT HERE
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <ctime>
#include <utility>
#include <iterator>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef set<int> si;
typedef map<int,int> mii;
typedef map<string,int> msi;
typedef pair<int,int> pii;
typedef priority_queue<int,vector<int>,greater<int> > pless;
typedef priority_queue<int> pgreater;
#define clr(x,a) memset(x,a,sizeof(x))
#define sz(x) (int)x.size()
#define pb push_back
#define mp make_pair
#define REP(i,n) for(i=0;i<(n);++i)
#define FOR(i,l,h) for(i=(l);i<=(h);++i)
#define FORD(i,h,l) for(i=(h);i>=(l);--i)
class ApplesAndPears
{
public:
int sa[55][55];
int sp[55][55];
int se[55][55];
int getArea(vector <string> board, int K)
{
int n=sz(board);
clr(sa,0);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++){
int ret=0;
if(board[i-1][j-1]=='A') ret=1;
sa[i][j]=sa[i-1][j]+sa[i][j-1]-sa[i-1][j-1]+ret;
}
clr(sp,0);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++){
int ret=0;
if(board[i-1][j-1]=='P') ret=1;
sp[i][j]=sp[i-1][j]+sp[i][j-1]-sp[i-1][j-1]+ret;
}
clr(se,0);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++){
int ret=0;
if(board[i-1][j-1]=='.') ret=1;
se[i][j]=se[i-1][j]+se[i][j-1]-se[i-1][j-1]+ret;
}
int ret=0;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
for(int x=i;x<=n;x++)
for(int y=j;y<=n;y++){
int l=y-j+1;
int w=x-i+1;
int a=sa[x][y]-sa[i-1][y]-sa[x][j-1]+sa[i-1][j-1];
int p=sp[x][y]-sp[i-1][y]-sp[x][j-1]+sp[i-1][j-1];
int e=se[x][y]-se[i-1][y]-se[x][j-1]+se[i-1][j-1];
if(sa[n][n]>=l*w&&(p==0||se[n][n]!=0))
if(p*2+e<=K)
ret=max(ret,l*w);
if(sp[n][n]>=l*w&&(a==0||se[n][n]!=0))
if(a*2+e<=K)
ret=max(ret,l*w);
if(se[n][n]>=l*w)
if(l*w-e<=K)
ret=max(ret,l*w);
}
return ret;
}
// BEGIN CUT HERE
// END CUT HERE
};
// BEGIN CUT HERE