diff options
Diffstat (limited to 'contests/Round860/B')
| -rwxr-xr-x | contests/Round860/B/main | bin | 0 -> 91544 bytes | |||
| -rwxr-xr-x | contests/Round860/B/main.cpp | 163 | ||||
| -rw-r--r-- | contests/Round860/B/main_input0.txt | 22 | ||||
| -rw-r--r-- | contests/Round860/B/main_output0.txt | 3 |
4 files changed, 188 insertions, 0 deletions
diff --git a/contests/Round860/B/main b/contests/Round860/B/main Binary files differnew file mode 100755 index 0000000..f84b662 --- /dev/null +++ b/contests/Round860/B/main diff --git a/contests/Round860/B/main.cpp b/contests/Round860/B/main.cpp new file mode 100755 index 0000000..c215574 --- /dev/null +++ b/contests/Round860/B/main.cpp @@ -0,0 +1,163 @@ +#include<bits/stdc++.h> +using namespace std; + +using ll = long long; +using pii = pair<int, int>; +using vpi = vector<pii>; +using vi = vector<int>; +using vll = vector<long long>; +using mpii = map<int, int>; +using mpll = map<ll, ll>; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b) - 1) / (b)) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template<typename K, typename V> ostream& operator<<(ostream& os, const pair<K, V>& p); +template<typename T> ostream& operator<<(ostream& os, const vector<T>& vec); +template<typename K, typename V> ostream& operator<<(ostream& os, const map<K, V>& m); +template<typename K, typename V> ostream& operator<<(ostream& os, const unordered_map<K, V>& m); +template<typename T> ostream& operator<<(ostream& os, const set<T>& s); +template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s); + +template<typename K, typename V> +ostream& operator<<(ostream& os, const pair<K, V>& p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template<typename T> +ostream& operator<<(ostream& os, const vector<T>& vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + + +template<typename K, typename V> +ostream& operator<<(ostream& os, const map<K, V>& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template<typename K, typename V> +ostream& operator<<(ostream& os, const unordered_map<K, V>& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template<typename T> +ostream& operator<<(ostream& os, const set<T>& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template<typename T> +ostream& operator<<(ostream& os, const unordered_set<T>& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void print() { + cerr << "\n"; +} + +template<typename T, typename... TS> +void print(T val, TS... vals) { + cerr << val << " "; + print(vals...); +} + + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ + +void solve() { + int m; + cin >> m; + vector<int> fq(5e4 + 3, false); + vector<vi> v(m); + for (int i = 0; i < m; i++) { + int n; + cin >> n; + vi tmp(n); + for (int j = 0; j < n; j++) { + int x; + cin >> x; + tmp[j] = x; + fq[x] = i; + } + v[i] = tmp; + } + vi ans; + for (int i = 0; i < m; i++) { + for (int j = 0; j < v[i].size(); j++) { + if (fq[v[i][j]] <= i) { + ans.pb(v[i][j]); + break; + } + } + } + if (ans.size() == m) { + for (auto x : ans) { + cout << x << ' '; + } + cout << '\n'; + } else { + cout << -1 << '\n'; + } +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/contests/Round860/B/main_input0.txt b/contests/Round860/B/main_input0.txt new file mode 100644 index 0000000..361e898 --- /dev/null +++ b/contests/Round860/B/main_input0.txt @@ -0,0 +1,22 @@ +3 +3 +4 +1 2 4 8 +3 +2 9 1 +2 +1 4 +2 +2 +1 2 +2 +2 1 +4 +4 +1 2 3 4 +1 +1 +1 +4 +1 +3 diff --git a/contests/Round860/B/main_output0.txt b/contests/Round860/B/main_output0.txt new file mode 100644 index 0000000..a055cdd --- /dev/null +++ b/contests/Round860/B/main_output0.txt @@ -0,0 +1,3 @@ +8 2 1 +-1 +2 1 4 3 |
