首页 > 代码库 > Test
Test
autumn
#include<bits/stdc++.h>using namespace std;const int maxn = 200005;int p[maxn],a[maxn],b[maxn];bool vis[maxn];set<pair<int,int> >s[5];int main(){ int n,m,t; scanf("%d",&n); for (int i = 0;i < n;i++) scanf("%d",&p[i]); for (int i = 0;i < n;i++) scanf("%d",&a[i]); for (int i = 0;i < n;i++) scanf("%d",&b[i]); for (int i = 0;i < n;i++) { s[a[i]].insert(make_pair(p[i],i)); s[b[i]].insert(make_pair(p[i],i)); vis[i] = true; } scanf("%d",&m); while (m--) { int ans = -1; scanf("%d",&t); while (!s[t].empty()) { int pos = (*(s[t].begin())).second; s[t].erase(s[t].begin()); if (!vis[pos]) continue; ans = p[pos]; vis[pos] = false; break; } printf("%d ",ans); } puts(" "); return 0;}
emacs
#include<bits/stdc++.h>using namespace std;const int maxn = 200005;int p[maxn],a[maxn],b[maxn];bool vis[maxn];set<pair<int,int> >s[5];int main(){ int n,m,t; scanf("%d",&n); for (int i = 0;i < n;i++) scanf("%d",&p[i]); for (int i = 0;i < n;i++) scanf("%d",&a[i]); for (int i = 0;i < n;i++) scanf("%d",&b[i]); for (int i = 0;i < n;i++) { s[a[i]].insert(make_pair(p[i],i)); s[b[i]].insert(make_pair(p[i],i)); vis[i] = true; } scanf("%d",&m); while (m--) { int ans = -1; scanf("%d",&t); while (!s[t].empty()) { int pos = (*(s[t].begin())).second; s[t].erase(s[t].begin()); if (!vis[pos]) continue; ans = p[pos]; vis[pos] = false; break; } printf("%d ",ans); } puts(" "); return 0;}
colorful
#include<bits/stdc++.h>using namespace std;const int maxn = 200005;int p[maxn],a[maxn],b[maxn];bool vis[maxn];set<pair<int,int> >s[5];int main(){ int n,m,t; scanf("%d",&n); for (int i = 0;i < n;i++) scanf("%d",&p[i]); for (int i = 0;i < n;i++) scanf("%d",&a[i]); for (int i = 0;i < n;i++) scanf("%d",&b[i]); for (int i = 0;i < n;i++) { s[a[i]].insert(make_pair(p[i],i)); s[b[i]].insert(make_pair(p[i],i)); vis[i] = true; } scanf("%d",&m); while (m--) { int ans = -1; scanf("%d",&t); while (!s[t].empty()) { int pos = (*(s[t].begin())).second; s[t].erase(s[t].begin()); if (!vis[pos]) continue; ans = p[pos]; vis[pos] = false; break; } printf("%d ",ans); } puts(" "); return 0;}
perldoc
#include<bits/stdc++.h>using namespace std;const int maxn = 200005;int p[maxn],a[maxn],b[maxn];bool vis[maxn];set<pair<int,int> >s[5];int main(){ int n,m,t; scanf("%d",&n); for (int i = 0;i < n;i++) scanf("%d",&p[i]); for (int i = 0;i < n;i++) scanf("%d",&a[i]); for (int i = 0;i < n;i++) scanf("%d",&b[i]); for (int i = 0;i < n;i++) { s[a[i]].insert(make_pair(p[i],i)); s[b[i]].insert(make_pair(p[i],i)); vis[i] = true; } scanf("%d",&m); while (m--) { int ans = -1; scanf("%d",&t); while (!s[t].empty()) { int pos = (*(s[t].begin())).second; s[t].erase(s[t].begin()); if (!vis[pos]) continue; ans = p[pos]; vis[pos] = false; break; } printf("%d ",ans); } puts(" "); return 0;}
pastie
#include<bits/stdc++.h>using namespace std;const int maxn = 200005;int p[maxn],a[maxn],b[maxn];bool vis[maxn];set<pair<int,int> >s[5];int main(){ int n,m,t; scanf("%d",&n); for (int i = 0;i < n;i++) scanf("%d",&p[i]); for (int i = 0;i < n;i++) scanf("%d",&a[i]); for (int i = 0;i < n;i++) scanf("%d",&b[i]); for (int i = 0;i < n;i++) { s[a[i]].insert(make_pair(p[i],i)); s[b[i]].insert(make_pair(p[i],i)); vis[i] = true; } scanf("%d",&m); while (m--) { int ans = -1; scanf("%d",&t); while (!s[t].empty()) { int pos = (*(s[t].begin())).second; s[t].erase(s[t].begin()); if (!vis[pos]) continue; ans = p[pos]; vis[pos] = false; break; } printf("%d ",ans); } puts(" "); return 0;}
Test
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。