A - Park Lighting CodeForces - 1358A
题意 思路:没啥好说的n*m/2向上取整即可
代码:
#include<iostream>
#include<queue>
#include<stack>
#include<cstring>
#include<stdlib.h>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<map>
#include<stdio.h>
#include<string>
#define LL long long
using namespace std;
#define MAXN 111
#define inf 100000001
#define sd1(i) scanf("%d", &i)
#define sd2(i, j) scanf("%d%d", &i, &j)
#define sl2(i, j) scanf("%lld%lld", &i, &j)
#define sd3(i, j, k) scanf("%d%d%d", &i, &j, &k)
int T;
void solve(){
int n, m;
sd2(n,m);
int ans = n * m;
if(ans % 2 == 0) cout << ans / 2 << endl;
else cout << ans / 2 + 1 << endl;
}
int main(){
cin >> T;
while(T--){
solve();
}
//system("pause");
return 0;
}
B - Maria Breaks the Self-isolation CodeForces - 1358B
思路: 先将a[i]升序排序,然后假设最终玛利亚能聚集除她之外的x人,一次性将x人同时邀请,此时一定满足x>=a[x](x=x-自己+玛利亚),问题答案就是满足x>=a[x]的最大的x。关键在于可以同时邀请多人个,只需要考虑邀请人数x与排序后最大的a[x]的关系即可。
#include<iostream>
#include<queue>
#include<stack>
#include<cstring>
#include<stdlib.h>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<map>
#include<stdio.h>
#include<string>
#define LL long long
using namespace std;
#define MAXN 100011
#define inf 100000001
#define sd1(i) scanf("%d", &i)
#define sl1(i) scanf("%lld", &i)
#define sd2(i, j) scanf("%d%d", &i, &j)
#define sl2(i, j) scanf("%lld%lld", &i, &j)
#define sd3(i, j, k) scanf("%d%d%d", &i, &j, &k)
#define For(i, j, n) for(int i = j; i < n; i++)
#define For_(i, j, n) for(int i = j; i > n; i--)
int T;
int n, a[MAXN];
void solve(){
sd1(n);
For(i, 0, n){
sd1(a[i]);
}
sort(a, a+n);
int cnt = 0;
For(i, 0, n){
if(i+1 >= a[i]) cnt = i+1;
}
cout << cnt + 1 << endl;
}
int main(){
cin >> T;
while(T--){
solve();
}
//system("pause");
return 0;
}
C - Celex Update CodeForces - 1358C
题意思路: 数学题 (x2 - x1)*(y2 - y1)即可
代码:
#include<iostream>
#include<queue>
#include<stack>
#include<cstring>
#include<stdlib.h>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<map>
#include<stdio.h>
#include<string>
#define LL long long
using namespace std;
#define MAXN 111
#define inf 100000001
#define sd1(i) scanf("%d", &i)
#define sl1(i) scanf("%lld", &i)
#define sd2(i, j) scanf("%d%d", &i, &j)
#define sl2(i, j) scanf("%lld%lld", &i, &j)
#define sd3(i, j, k) scanf("%d%d%d", &i, &j, &k)
#define For(i, j, n) for(int i = j; i < n; i++)
#define For_(i, j, n) for(int i = j; i > n; i--)
int T;
void solve(){
LL x1, x2, y1, y2;
sl2(x1, y1);
sl2(x2, y2);
LL ans = (x2 - x1)*(y2 - y1) + 1;
cout << ans << endl;
}
int main(){
cin >> T;
while(T--){
solve();
}
//system("pause");
return 0;
}