01 2021 档案
摘要:最短路(堆优化) #include <bits/stdc++.h> using namespace std; const int inf = 1000000000; void dij() { int n, m, s; cin >> n >> m >> s; vector<vector<pair<in
阅读全文
摘要:A https://atcoder.jp/contests/abc177/tasks/abc177_c?lang=en #include <bits/stdc++.h> using namespace std; const int P = 1000000007; int main() { ios::
阅读全文