当前位置: 代码迷 >> 综合 >> 2019 计蒜之道 初赛 第六场
  详细解决方案

2019 计蒜之道 初赛 第六场

热度:41   发布时间:2024-01-18 18:44:08.0

 A. VIPKID大数据“黑科技”:为小朋友智能匹配最佳外教
 

#include<iostream>
#include<stack>
#include<cstring>
using namespace std;
char a[1000005];
stack<int> s;
int ans[1000005];
bool f;
int len;
bool judge(char a[]) {int len = strlen(a);for(int i = 0;i < len; i++) {if(a[i] == a[len - i - 1]) return true;}return false;
}
int main(){cin>>a;len=strlen(a);f=true;for(int i=0;i<len;i++){if(a[i]=='('){s.push(i+1);}else {if(!s.empty()){ans[i+1]=s.top();s.pop();}else {f=false;break;}}}if(!s.empty()){f=false;}if(f && !judge(a)) cout << "YES" << endl;else cout << "NO" << endl;return 0;
}

 B. 语音评测系统(简单)

#include<iostream>
#include<cmath>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAXN = 1e6 + 10;
long long a[MAXN],t[MAXN],b[MAXN],a1[MAXN],b1[MAXN];
int n,m;
int q;
int ans;
int main() {cin >> n;for(int i = 0; i< n;i++) {cin >> a[i];}for(int i = 0; i < n;i++) {cin >> b[i];}cin >> m;for(ans = 0;ans < m; ans++) {cin >> q;memset(a1,0,sizeof a1);for(int j = 0;j < n;j++) {a1[j] = (q - a[j]) * (q - a[j]) + b[j];}sort(a1,a1+n);b1[ans] = a1[0];}for(int i = 0 ;i < ans -1 ;i++) {cout << b1[i] <<" ";}cout << b1[ans - 1] << endl;return  0;
}

 C. 语音评测系统(中等)

#include<iostream>
#include<cmath>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAXN = 1e6 + 10;
long long a[MAXN],t[MAXN],b[MAXN],a1[MAXN],b1[MAXN];
int n,m;
int q;
int ans;
int main() {cin >> n;for(int i = 0; i< n;i++) {cin >> a[i];}for(int i = 0; i < n;i++) {cin >> b[i];}cin >> m;for(ans = 0;ans < m; ans++) {cin >> q;memset(a1,0,sizeof a1);for(int j = 0;j < n;j++) {a1[j] = (q - a[j]) * (q - a[j]) + b[j];}sort(a1,a1+n);b1[ans] = a1[0];}for(int i = 0 ;i < ans -1 ;i++) {cout << b1[i] <<" ";}cout << b1[ans - 1] << endl;return  0;
}