目录
A-面包店故事_牛客周赛 Round 56 (nowcoder.com)
B-放课后故事_牛客周赛 Round 56 (nowcoder.com)
C-异或故事_牛客周赛 Round 56 (nowcoder.com)
D-构造故事_牛客周赛 Round 56 (nowcoder.com)
E-约会故事_牛客周赛 Round 56 (nowcoder.com)
A-面包店故事_牛客周赛 Round 56 (nowcoder.com)
思路:
打卡题
代码:
#include<iostream>
#define int long long
using namespace std;
const int N = 1e6 + 10;
int a[N];
void slove()
{
int x, y, n;
cin >> x >> y >> n;
if (x + y <= n)
cout << "YES\n";
else
cout << "NO\n";
}
signed main()
{
int t=1;
//cin >> t;
while (t--)
{
slove();
}
}
B-放课后故事_牛客周赛 Round 56 (nowcoder.com)
思路:
文字游戏,注意小S也是留下来的同学之一,所以留下的同学一共有m+1个
代码:
#include<iostream>
#define int long long
using namespace std;
const int N = 1e6 + 10;
int a[N];
void slove()
{
int n, m, k;
cin >> n >> m >> k;
int sum = 0;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
sum+=a[i];
}
int ans = sum / k;
if(ans<m+1)
cout << ans << "\n";
else
cout<<m+1;
}
signed main()
{
int t=1;
//cin >> t;
while (t--)
{
slove();
}
}
C-异或故事_牛客周赛 Round 56 (nowcoder.com)
思路:
构造+思维+位运算,根据异或的性质我们得出,用1去异或上一个数n,如果n为奇数则得到n-1,否则会得到n+1,由此,们发现,直接用1去异或就好了嘛,但考虑特殊的两个数,输入为1或1e9时,我们发现,用1去异或得到的两个数为0和1e9+1,不在要求范围内,
所以我们特判一下这两个数即可。
代码:
#include<iostream>
#include<algorithm>
#define int long long
using namespace std;
const int N = 1e6 + 10;
int a[N];
void slove()
{
int a;
cin >> a;
if (a == 1)
cout << "2 3\n";
else if (a == 1e9)
cout << "999999999 1023\n";
else
cout << 1 << " " << (1 ^ a) << "\n";
}
signed main()
{
int t=1;
cin >> t;
while (t--)
{
slove();
}
}
D-构造故事_牛客周赛 Round 56 (nowcoder.com)
思路:
我们的目标是得到周长最大的三角形,那我们肯定考虑拿最长的对吧,我们对所有火柴排序后,从大到小直接枚举,能构成三角形则直接输出即可!
代码:
#include<iostream>
#include<algorithm>
#define int long long
using namespace std;
const int N = 1e6 + 10;
int a[N];
bool cmp(int a, int b)
{
return a > b;
}
void slove()
{
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + 1 + n,cmp);
int ans = -1;
for (int i = 1; i <= n - 2; i++)
{
if (a[i] < a[i + 2] + a[i + 1])
{
ans = a[i] + a[i + 2] + a[i + 1];
break;
}
}
cout << ans << "\n";
}
signed main()
{
int t=1;
cin >> t;
while (t--)
{
slove();
}
}
E-约会故事_牛客周赛 Round 56 (nowcoder.com)
思路:
就是模拟,模拟即可
代码:
#include<iostream>
#include<algorithm>
#include<cstring>
#include<map>
#include<set>
#define int long long
using namespace std;
const int N = 1e6 + 10;
int a[N];
set<string>tea;
void slove()
{
int n, m;
cin >> n >> m;
memset(a, 0, sizeof(a));
for (int i = 1; i <= n; i++)
{
string s, e;
cin >> s >> e;
int star = (s[0] - '0') * 10 * 60 + (s[1] - '0') * 60 + (s[3] - '0') * 10 + (s[4] - '0');
int end = (e[0] - '0') * 10 * 60 + (e[1] - '0') * 60 + (e[3] - '0') * 10 + (e[4] - '0');
if(star<end)
for (int i = star; i <= end; i++)
a[i] = 1;
else
for(int i=0;i<=end;i++)
a[i]=1;
}
for (int i = 1; i <= m; i++)
{
string s;
cin >> s;
tea.insert(s);
}
int q;
cin >> q;
while(q--)
{
string s;
cin >> s;
int flag1 = 0;
int flag2 = 0;
if (s >= "00:00" && s <= "01:59")
flag1 = 1;
int star= (s[0] - '0') * 10 * 60 + (s[1] - '0') * 60 + (s[3] - '0') * 10 + (s[4] - '0');
if (a[star] == 1)
flag2 = 1;
string xqq, c;
cin >> xqq >> c;
int flag3 = 0;
if (xqq <= c)
flag3 = 1;
string naicha;
cin >> naicha;;
int flag4 = 0;
if (tea.count(naicha))
flag4 = 1;
if (flag1 == 1&&flag2==1)
{
if (flag3 == 1 && flag4 == 1)
cout << "Winner xqq\n";
else
cout << "Joker xqq\n";
}
else
{
cout << "Loser xqq\n";
}
}
}
signed main()
{
int t=1;
//cin >> t;
while (t--)
{
slove();
}
}