From ff7585043c5f48cf94bc7ace4ad1b8fe9b4df9ef Mon Sep 17 00:00:00 2001 From: omagdy7 Date: Sat, 13 Apr 2024 16:15:35 +0200 Subject: Solved 4 problems in last Div.3 --- codeforces/SeraphimTheOwl/main.cpp | 65 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 65 insertions(+) create mode 100755 codeforces/SeraphimTheOwl/main.cpp (limited to 'codeforces/SeraphimTheOwl/main.cpp') diff --git a/codeforces/SeraphimTheOwl/main.cpp b/codeforces/SeraphimTheOwl/main.cpp new file mode 100755 index 0000000..34bad85 --- /dev/null +++ b/codeforces/SeraphimTheOwl/main.cpp @@ -0,0 +1,65 @@ +#include + +using namespace std; + +using ll = long long; +using pii = pair; +using vpii = 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 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}; + +#ifdef LOCAL +#include "debug.h" +#else +#define dbg(...) 42 +#endif + +/* 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 a(n); + vi b(n); + for (auto &x : a) { + cin >> x; + } + for (auto &x : b) { + cin >> x; + } +} + +int main() { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while (tt--) { + solve(); + } +} -- cgit v1.2.3