top of page

CCC 2014 J5: Assigning Partners

Use a dictionary to store members of each other. if can not find a pair,

print "bad, otherwise print "good".

N = int(input())
name1 = input().split()
name2 = input().split()

pairtable = dict()

for i in range(N):
    pairtable[name1[i]] = name2[i]

result = True

for x in pairtable:
    if x == pairtable[x]:
        result = False
    y = pairtable[x]
    z = pairtable[y]
    if z != x:
        result = False
if result:

Recent Posts

See All

CCC '24 J5 - Harvest Waterloo

#include<iostream> #include <vector> #include <algorithm> #include <cmath> #include <stack> using namespace std; int main() { int r, c, sr, sc; cin >> r; cin >> c; int p[r][c]; bool v

CCC '24 J4 - Troublesome Keys

#include <iostream> #include <string> #include <map> #include <vector> #include <algorithm> #include <cmath> using namespace std; int main() { string ps; string ds; cin >> ps; cin >> ds;

CCC '22 J5 - Square Pool

#include<iostream> #include <vector> #include <algorithm> #include <cmath> using namespace std; bool rowcom(pair<int, int> a, pair<int, int> b){ return a.first < b.first; } bool colcom(pair<int,


bottom of page