637B - Chat Order - CodeForces Solution


*special problem binary search constructive algorithms data structures sortings *1200

Please click on ads to support us..

Python Code:

s = set()
l = list()
n = int(input())
for _ in range(n):
  l.append(input())
for i in range(n-1,-1,-1):
  if l[i] not in s:
    s.add(l[i])
    print(l[i])

C++ Code:

#define ll long long
#define MAXN 200010
#define INF 0x3f3f3f3f
#include <bits/stdc++.h>
using namespace std;

stack<string> a;
set<string> r;

int main(){
#ifdef _DEBUG
    freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
#endif
#define int ll
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin >> n;
    while (n--) {
        string s;
        cin >> s;
        a.push(s);
    }
    while (!a.empty()) {
        if (!r.count(a.top())) {
            cout << a.top() << endl;
            r.insert(a.top());
        }
        a.pop();
    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

1699A - The Third Three Number Problem
1617B - GCD Problem
841A - Generous Kefa
1690B - Array Decrements
1692C - Where's the Bishop
104A - Blackjack
1438A - Specific Tastes of Andre
1711C - Color the Picture
1194C - From S To T
110B - Lucky String
1114A - Got Any Grapes
224B - Array
125B - Simple XML
567B - Berland National Library
431B - Shower Line
282C - XOR and OR
1582B - Luntik and Subsequences
609A - Флеш-карты
1207A - There Are Two Types Of Burgers
371C - Hamburgers
343B - Alternating Current
758B - Blown Garland
1681B - Card Trick
1592A - Gamer Hemose
493D - Vasya and Chess
1485A - Add and Divide
337B - Routine Problem
1392D - Omkar and Bed Wars
76E - Points
762C - Two strings