A. Cards for Friends
思路
水题。。。。
代码
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <string>
#include <string>
#include <map>
#include <bitset>
#include <vector>
void fre() { system("clear"), freopen("A.txt", "r", stdin); freopen("Ans.txt","w",stdout); }
void Fre() { system("clear"), freopen("A.txt", "r", stdin);}
void Run(int x = 0) {
#ifdef ACM //宏定义免注释 freopen
if(! x) fre(); else Fre();
#endif
}
#define ios ios::sync_with_stdio(false)
#define Pi acos(-1)
#define pb push_back
#define fi first
#define se second
#define db double
#define ll long long
#define ull unsigned long long
#define Pir pair<ll, ll>
#define m_p make_pair
#define for_(i, s, e) for(ll i = (ll)(s); i <= (ll)(e); i ++)
#define rep_(i, e, s) for(ll i = (ll)(e); i >= (ll)(s); i --)
#define memset(a, b, c) memset(a, (int)b, c);
#define size() size() * 1LL
#define sc scanf
#define pr printf
#define sd(a) scanf("%lld", &a)
#define ss(a) scanf("%s", a)
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
#define esp 1e-7
#define mod (ll)(1e9 + 7)
using namespace std;
/*=========================ACMer===========================*/
const ll mxn = 2e5 + 10;
ll ar[mxn];
int main()
{
Run();
ll T; sd(T);
while(T --)
{
ll w, h, n;
sc("%lld %lld %lld", &w, &h, &n);
ll x = 1, y = 1;
while(w % 2 == 0) x *= 2, w /= 2;
while(h % 2 == 0) y *= 2, h /= 2;
/* ll ans = max(x * y, 1LL); */
if(x * y >= n)
pr("YES\n");
else
pr("NO\n");
}
return 0;
}
B. Fair Division
思路
水题。。。。
代码
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <string>
#include <string>
#include <map>
#include <bitset>
#include <vector>
void fre() { system("clear"), freopen("A.txt", "r", stdin); freopen("Ans.txt","w",stdout); }
void Fre() { system("clear"), freopen("A.txt", "r", stdin);}
void Run(int x = 0) {
#ifdef ACM //宏定义免注释 freopen
if(! x) fre(); else Fre();
#endif
}
#define ios ios::sync_with_stdio(false)
#define Pi acos(-1)
#define pb push_back
#define fi first
#define se second
#define db double
#define ll long long
#define ull unsigned long long
#define Pir pair<ll, ll>
#define m_p make_pair
#define for_(i, s, e) for(ll i = (ll)(s); i <= (ll)(e); i ++)
#define rep_(i, e, s) for(ll i = (ll)(e); i >= (ll)(s); i --)
#define memset(a, b, c) memset(a, (int)b, c);
#define size() size() * 1LL
#define sc scanf
#define pr printf
#define sd(a) scanf("%lld", &a)
#define ss(a) scanf("%s", a)
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
#define esp 1e-7
#define mod (ll)(1e9 + 7)
using namespace std;
/*=========================ACMer===========================*/
const ll mxn = 2e5 + 10;
ll ar[mxn];
int main()
{
Run();
ll T; sd(T);
while(T --)
{
ll n; sd(n);
ll x = 0, y = 0, sum = 0;
for_(i, 1, n)
{
sd(ar[i]);
if(ar[i] == 1) x ++;
else y ++;
sum += ar[i];
}
if(sum % 2)
{
pr("NO\n");
continue;
}
ll cnt = sum / 2;
ll flag = 0;
if(cnt % 2)
{
if(x) flag = 1;
}
else
{
flag = 1;
}
if(flag)
pr("YES\n");
else
pr("NO\n");
}
return 0;
}
C. Long Jumps
思路
水题。。
代码
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <string>
#include <string>
#include <map>
#include <bitset>
#include <vector>
void fre() { system("clear"), freopen("A.txt", "r", stdin); freopen("Ans.txt","w",stdout); }
void Fre() { system("clear"), freopen("A.txt", "r", stdin);}
void Run(int x = 0) {
#ifdef ACM //宏定义免注释 freopen
if(! x) fre(); else Fre();
#endif
}
#define ios ios::sync_with_stdio(false)
#define Pi acos(-1)
#define pb push_back
#define fi first
#define se second
#define db double
#define ll long long
#define ull unsigned long long
#define Pir pair<ll, ll>
#define m_p make_pair
#define for_(i, s, e) for(ll i = (ll)(s); i <= (ll)(e); i ++)
#define rep_(i, e, s) for(ll i = (ll)(e); i >= (ll)(s); i --)
#define memset(a, b, c) memset(a, (int)b, c);
#define size() size() * 1LL
#define sc scanf
#define pr printf
#define sd(a) scanf("%lld", &a)
#define ss(a) scanf("%s", a)
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
#define esp 1e-7
#define mod (ll)(1e9 + 7)
using namespace std;
/*=========================ACMer===========================*/
const ll mxn = 2e5 + 10;
ll ar[mxn], suf[mxn];
int main()
{
Run();
ll T; sd(T);
while(T --)
{
ll n; sd(n);
for_(i, 1, n) sd(ar[i]);
suf[n + 1] = 0;
ll mx = 0;
rep_(i, n, 1)
{
ll id = min(n + 1, i + ar[i]);
suf[i] = suf[id] + ar[i];
mx = max(mx, suf[i]);
}
pr("%lld\n", mx);
}
return 0
D. Even-Odd Game
思路
把数字从小到大拍个序,Alice 和 Bob 轮流从当前的所有数字中选择最大个那个,因为选择最大的那个数,如果可以给自己加分的话就是加的最多分的那个数,如果那个数字,不给自己加分的话,就一定给对手加分,所以把这个数字选择掉也可以变相最大程度的减少对手的分数,从而自己得到的分数之后更可能比对手多
代码
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <string>
#include <string>
#include <map>
#include <bitset>
#include <vector>
void fre() { system("clear"), freopen("A.txt", "r", stdin); freopen("Ans.txt","w",stdout); }
void Fre() { system("clear"), freopen("A.txt", "r", stdin);}
void Run(int x = 0) {
#ifdef ACM //宏定义免注释 freopen
if(! x) fre(); else Fre();
#endif
}
#define ios ios::sync_with_stdio(false)
#define Pi acos(-1)
#define pb push_back
#define fi first
#define se second
#define db double
#define ll long long
#define ull unsigned long long
#define Pir pair<ll, ll>
#define m_p make_pair
#define for_(i, s, e) for(ll i = (ll)(s); i <= (ll)(e); i ++)
#define rep_(i, e, s) for(ll i = (ll)(e); i >= (ll)(s); i --)
#define memset(a, b, c) memset(a, (int)b, c);
#define size() size() * 1LL
#define sc scanf
#define pr printf
#define sd(a) scanf("%lld", &a)
#define ss(a) scanf("%s", a)
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
#define esp 1e-7
#define mod (ll)(1e9 + 7)
using namespace std;
/*=========================ACMer===========================*/
const ll mxn = 2e5 + 10;
ll ar[mxn], suf[mxn];
int main()
{
Run();
ll T; sd(T);
while(T --)
{
ll n; sd(n);
for_(i, 1, n) sd(ar[i]);
sort(ar + 1, ar + 1 + n, greater<ll>());
ll x = 0, y = 0;
for_(i, 1, n)
{
if(i % 2)
{
if(ar[i] % 2 == 0) x += ar[i];
}
else
{
if(ar[i] % 2 == 1) y += ar[i];
}
}
if(x > y) pr("Alice\n");
else if(x < y) pr("Bob\n");
else pr("Tie\n");
}
return 0;
}
E. Correct Placement
思路
- 开个结构体,第 w、h、id ,在存数据的时候,默认小的数存到 w 中,大的那个数村道的 h 中,id 表示这个人的编号,,
- 之后对这个结构体先按 w 进行排序,再按 h 从小到大进行排序,
- 因为同一个数的时候,可能相同的 w 有多个人,这个时候我们维护一个前缀 h 最小值,对于相同的 w 我们先不进行维护,当对所有的相同的 w 进行处理之后,我们在把这些拥有相同的 w 的信息进行遍历维护一遍,
- 当我们讨论下一批拥有相同的 w 的时候,就可以利用之前维护的信息了,,,,,
代码
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <string>
#include <string>
#include <map>
#include <bitset>
#include <vector>
void fre() { system("clear"), freopen("A.txt", "r", stdin); freopen("Ans.txt","w",stdout); }
void Fre() { system("clear"), freopen("A.txt", "r", stdin);}
void Run(int x = 0) {
#ifdef ACM //宏定义免注释 freopen
if(! x) fre(); else Fre();
#endif
}
#define ios ios::sync_with_stdio(false)
#define Pi acos(-1)
#define pb push_back
#define fi first
#define se second
#define db double
#define ll long long
#define ull unsigned long long
#define Pir pair<ll, ll>
#define m_p make_pair
#define for_(i, s, e) for(ll i = (ll)(s); i <= (ll)(e); i ++)
#define rep_(i, e, s) for(ll i = (ll)(e); i >= (ll)(s); i --)
#define memset(a, b, c) memset(a, (int)b, c);
#define size() size() * 1LL
#define sc scanf
#define pr printf
#define sd(a) scanf("%lld", &a)
#define ss(a) scanf("%s", a)
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
#define esp 1e-7
#define mod (ll)(1e9 + 7)
using namespace std;
/*=========================ACMer===========================*/
const ll mxn = 2e5 + 10;
struct Node
{
ll w, h, id;
} ar[mxn], br[mxn];
ll idx[mxn], ans[mxn];
bool cmp(Node a, Node b)
{
if(a.w == b.w)
return a.h < b.h;
return a.w < b.w;
}
int main()
{
Run();
ll T; sd(T);
while(T --)
{
ll n; sd(n);
ll w, h;
for_(i, 1, n)
{
sc("%lld %lld", &w, &h);
if(w > h) swap(w, h);
ar[i] = Node{ w, h, i };
}
sort(ar + 1, ar + 1 + n, cmp);
for_(i, 1, n)
{
idx[ar[i].id] = i;
}
ll mn = INF, index = -1;
for_(i, 1, n)
{
ll t = i;
while(t <= n && ar[t].w == ar[i].w)
{
if(ar[t].h > mn)
{
ans[ar[t].id] = index;
}
else
{
ans[ar[t].id] = -1;
}
t ++;
}
for_(j, i, t - 1)
{
if(mn > ar[j].h) mn = ar[j].h, index = ar[j].id;
}
i = t - 1;
}
for_(i, 1, n) pr("%lld ", ans[i]);
pr("\n");
}
return 0;
}