# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1250402 | discontinuous | Souvenirs (IOI25_souvenirs) | C++20 | 0 ms | 0 KiB |
// Author: Anikait Prasar
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
const ll MOD = 1e9 + 7;
const ll INF = 1e15;
const ll N = 1e6;
ll m, k, a, b, c, d, h, l, r, x, y;
vector<int> arr(N);
vector<int> adj[N+1];
// vector<int> brr(N);
// vector<int> crr(N);
vector<int> visited(N);
void sieve(int n) {
vector<bool> primes(N+1, true);
primes[0] = primes[1] = false;
for (int i = 2; i <= n; i++) {
if (primes[i] && (long long)i * i <= n) {
for (int j = i * i; j <= n; j += i)
primes[j] = false;
}
}
}
void dfs(int node) {
visited[node] = true;
for(auto j : adj[node]) {
if(!visited[j]) dfs(j);
}
}
void buy_souvenirs(int n, ll p0) {
if(n==2) {
transaction(p0-1);
return;
}
}
/**
----------------------------------------------------
Problem Notes :-
----------------------------------------------------
**/
// int main() {
// ios::sync_with_stdio(false);
// cout.tie(0); cin.tie(0);
// int tc = 1;
// // cin >> tc;
// while(tc--) {
// solve();
// cout << "\n";
// }
// return 0;
// }