Codeforces Round #408 (Div. 2), problem: (D) Police Stations Solution in C
#include <iostream> #include <string> #include <vector> #include <map> #include <queue> #include <algorithm> #include <numeric> #include <climits> using namespace std; int main(int argc, char **argv) { ios_base::sync_with_stdio(false); cin.tie(0); int N, K, D; cin >> N >> K >> D; vector<int> P(N, N); vector<vector<int>> E(N); map<pair<int, [...]