From ba391960d9d26180335fccc2f3d593021324de76 Mon Sep 17 00:00:00 2001 From: omagdy7 Date: Sun, 19 Mar 2023 11:58:33 +0200 Subject: Solved new problems from codeforces --- codeforces/RecentActions/main | Bin 0 -> 72984 bytes codeforces/RecentActions/main.cpp | 119 ++++++++++++++++++++++++++++++ codeforces/RecentActions/main_input0.txt | 21 ++++++ codeforces/RecentActions/main_output0.txt | 10 +++ 4 files changed, 150 insertions(+) create mode 100755 codeforces/RecentActions/main create mode 100755 codeforces/RecentActions/main.cpp create mode 100644 codeforces/RecentActions/main_input0.txt create mode 100644 codeforces/RecentActions/main_output0.txt (limited to 'codeforces/RecentActions') diff --git a/codeforces/RecentActions/main b/codeforces/RecentActions/main new file mode 100755 index 0000000..0db811c Binary files /dev/null and b/codeforces/RecentActions/main differ diff --git a/codeforces/RecentActions/main.cpp b/codeforces/RecentActions/main.cpp new file mode 100755 index 0000000..3ee1841 --- /dev/null +++ b/codeforces/RecentActions/main.cpp @@ -0,0 +1,119 @@ +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +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 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}; + +//pretty printing +template +void printm(const map &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template +void printv(const vector &v) { + cerr << "["; + for (int i = 0; i < v.size(); i++) { + if (i == v.size() - 1) { + cerr << v[i]; + } else { + cerr << v[i] << ", "; + } + } + cerr << "]\n"; +} + +template +void printvv(const vector> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +void print() { + cerr << "\n"; +} + +template +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 n, m; + cin >> n >> m; + vi v(m); + deque dq; + for (int i = 1; i <= n; i++) { + dq.pb(i); + } + unordered_map mp; + for (auto &x : v) cin >> x; + for (int i = 0; i < m; i++) { + int back = dq.back(); + auto it = find(all(dq), v[i]); + if (it != dq.end()) { // found + continue; + } else { + mp[back] = i + 1; + dq.pop_back(); + dq.push_front(v[i]); + } + } + for (int i = 1; i <= n; i++) { + if (mp[i] != 0) { + cout << mp[i] << ' '; + } else { + cout << -1 << ' '; + } + } + cout << '\n'; +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/codeforces/RecentActions/main_input0.txt b/codeforces/RecentActions/main_input0.txt new file mode 100644 index 0000000..a6aa411 --- /dev/null +++ b/codeforces/RecentActions/main_input0.txt @@ -0,0 +1,21 @@ +10 +1 1 +2 +3 2 +5 4 +4 5 +5 9 9 5 7 +5 5 +6 7 8 9 10 +3 4 +4 4 4 4 +4 4 +5 5 6 6 +3 5 +4 5 5 5 4 +4 20 +5 5 24 24 24 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 +5 7 +7 8 7 11 7 12 10 +6 7 +8 11 7 8 8 8 12 diff --git a/codeforces/RecentActions/main_output0.txt b/codeforces/RecentActions/main_output0.txt new file mode 100644 index 0000000..0594b15 --- /dev/null +++ b/codeforces/RecentActions/main_output0.txt @@ -0,0 +1,10 @@ +1 +-1 2 1 +-1 5 2 1 +5 4 3 2 1 +-1 -1 1 +-1 -1 3 1 +-1 2 1 +8 7 3 1 +7 6 4 2 1 +-1 -1 7 3 2 1 -- cgit v1.2.3