A-阿宁的柠檬
https://ac.nowcoder.com/acm/contest/39100/A
水:
#include <cstdio>
#include <iostream>
using namespace std ;
using ll = long long ;
int main(){
ll a , b , n ;
cin >> a >> b >> n ;
cout << n << ' ' << n * (a + b) << '\n' ;
return 0 ;
}
B-阿宁与猫咪
https://ac.nowcoder.com/acm/contest/39100/B
全部输出1,水:
#include <iostream>
using namespace std ;
int main(){
int n ;
cin >> n ;
cout << n << '\n' ;
for(int i = 0 ; i < n ; i ++) {
cout << 1 << " \n"[i == n - 1] ;
}
return 0 ;
}
C-阿宁吃粽子
https://ac.nowcoder.com/acm/contest/39100/C
题目的答案可能有多组解,题目要求输出的就是如果有相同的答案,那么好吃的先吃。首先从大到小排序,然后比如有20组数,那么先从{19 , 9} , {18 , 8} , {17 , 7} ... {10 , 0}这样不断的给这些位置赋值:
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int a[N], b[N];
int solve(int x, int num) { //返回的是以num为结尾的小于x的最大数字
int a = x % 10;
if (a >= num) {
return x / 10 * 10 + num;
} else {
return x / 10 * 10 - 10 + num;
}
}
bool cmp(int x, int y){
return x > y;
}
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + 1 + n ,cmp);
int cnt = 0;
for (int i = 9; i >= 0; i--) {
for (int j = solve(n, i); j >= i; j -= 10) {
b[j] = a[++cnt];
}
}
for (int i = 1; i <= n; i++) {
cout << b[i] << " \n"[i == n ];
}
return 0;
}
D-阿宁的质数
https://ac.nowcoder.com/acm/contest/39100/D
题目数据水了,暴力都能过,这个能过但不是正解:
#include <bits/stdc++.h>
using namespace std ;
const int N = 1e7 + 8 ;
bool vis[N] ;
void init(){
for(int i = 2 ; i <= N ; i ++) {
if(!vis[i])
for(int j = i + i ; j <= N ; j += i)
vis[j] = true ;
}
}
int ans[N] ;
int main(){
int n , q ;
init() ;
cin >> n >> q;
int t = 2 ;
for(int i = 1 ; i <= n; i ++) {
int op ;
cin >> op ;
if(op <= N) vis[op] = true ;
while(vis[t]) t ++ ;
ans[i] = t ;
}
while(q --){
int x ;
cin >> x ;
cout << ans[x] << '\n' ;
}
return 0 ;
}
E-阿宁睡大觉
https://ac.nowcoder.com/acm/contest/39100/E
首先记录每个大Z相互之间的距离,把距离排序,用k依次减掉距离,贪心,每次增加的价值都是4
#include <bits/stdc++.h>
using namespace std ;
vector<int> interval ; //记录每个Z相互之间的距离
using ll = long long ;
int main(){
int n , m ;
cin >> n >> m ;
string s ;
cin >> s ;
int t = -1 ;
for(int i = 0 ; i < n ; i ++){
if(s[i] == 'Z'){
if(t != -1) {interval.push_back(i - t - 1); }
t = i ;
}
}
sort(interval.begin() , interval.end()) ; //排序
ll ans = 0 ;
for(auto i : interval){
m -= i ; //删除z
if(m >= 0) ans += 4 ;
else break ;
}
cout << ans << '\n' ;
return 0 ;
}
F-阿宁去游玩
https://ac.nowcoder.com/acm/contest/39100/F
最短路SPFA
#include <bits/stdc++.h>
using namespace std ;
using ll = long long ;
const int N = 2e5 + 8 ;
int a[N] ;
vector<int>e[N] ;
ll dis[N] ;
bool vis[N] ;
queue<int>q ;
int x , y , z ;
void SPFA(){
memset(vis, false , sizeof(vis)) ;
memset(dis , 0x3f , sizeof(dis)) ;
dis[1] = 0 , q.push(1) , vis[1] = true ;
while(!q.empty()){
int u = q.front() ; q.pop() ;
vis[u] = false ;
for(int i = 0 ; i < e[u].size() ; i ++) {
int v= e[u][i] , w1 , w2 ;
if(a[u] == a[v]) { //比较改变属性和不改变属性之间的大小
w1 = x , w2 = z + y ;
}else w1 = y, w2 = x + z ;
if(dis[v] > dis[u] + w1 || dis[v] > dis[u] + w2){
dis[v] = min(dis[v] , dis[u] + min(w1,w2)) ;
if(!vis[v]) {
q.push(v) , vis[v] = true ;
}
}
}
}
}
int main(){
int n , m ;
cin >> n >> m ;
cin >> x >> y >> z ;
for(int i = 1 ; i <= n ; i ++) {
cin >> a[i] ;
}
for(int i = 1 ; i <= m ; i ++) {
int u , v ;
cin >> u >> v ;
e[u].push_back(v) , e[v].push_back(u) ;
}
SPFA() ;
cout << dis[n] << '\n' ;
return 0 ;
}