TaoSama's Microcosm

本博客不再更新,新博客地址: http://taosama.github.io

Codeforces #332 B. Spongebob and Joke (思路)

题意:

nf,mb,fai=b[i],m
Ambiguity,Impossible,Possible

分析:

f,,Ambiguous,1
,Impossible
AmbiguityAmbiguous,,思维不够缜密啊!!!

数据:

3 1
2 1 1
2

ans:
Possible
1

代码:

//
//  Created by TaoSama on 2015-11-21
//  Copyright (c) 2015 TaoSama. All rights reserved.
//
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>

using namespace std;
#define pr(x) cout << #x << " = " << x << "  "
#define prln(x) cout << #x << " = " << x << endl
const int N = 1e5 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7;

int n, m, f[N], a[N], b[N], wh[N];

int main() {
#ifdef LOCAL
    freopen("C:\\Users\\TaoSama\\Desktop\\in.txt", "r", stdin);
//  freopen("C:\\Users\\TaoSama\\Desktop\\out.txt","w",stdout);
#endif
    ios_base::sync_with_stdio(0);

    while(scanf("%d%d", &n, &m) == 2) {
        memset(wh, 0, sizeof wh);
        memset(a, 0, sizeof a);
        for(int i = 1; i <= n; ++i) {
            scanf("%d", f + i);
            if(wh[f[i]]) wh[f[i]] = -1;
            else wh[f[i]] = i;
        }

        bool Ambiguity = false, Impossible = false;
        for(int i = 1; i <= m; ++i) {
            scanf("%d", b + i);
            if(!wh[b[i]]) Impossible = true;
            else if(wh[b[i]] == -1) Ambiguity = true;
            a[i] = wh[b[i]];
        }
        if(Impossible) puts("Impossible");
        else if(Ambiguity) puts("Ambiguity");
        else {
            puts("Possible");
            for(int i = 1; i <= m; ++i)
                printf("%d%c", a[i], " \n"[i == m]);
        }
    }
    return 0;
}
阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/lwt36/article/details/49961281
文章标签: codeforces
上一篇Codeforces #332 A. Laurenty and Shop (枚举)
下一篇Codeforces #332 C. Day at the Beach (贪心)
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭