Submission #950297

#TimeUsernameProblemLanguageResultExecution timeMemory
950297vjudge1Remittance (JOI19_remittance)C++17
0 / 100
2 ms604 KiB
// #pragma GCC target("avx2") // #pragma GCC optimize("O3") // #include <x86intrin.h> #include <bits/stdc++.h> #include <chrono> #include <random> // @author: Vlapos namespace operators { template <typename T1, typename T2> std::istream &operator>>(std::istream &in, std::pair<T1, T2> &x) { in >> x.first >> x.second; return in; } template <typename T1, typename T2> std::ostream &operator<<(std::ostream &out, std::pair<T1, T2> x) { out << x.first << " " << x.second; return out; } template <typename T1> std::istream &operator>>(std::istream &in, std::vector<T1> &x) { for (auto &i : x) in >> i; return in; } template <typename T1> std::ostream &operator<<(std::ostream &out, std::vector<T1> &x) { for (auto &i : x) out << i << " "; return out; } template <typename T1> std::ostream &operator<<(std::ostream &out, std::set<T1> &x) { for (auto &i : x) out << i << " "; return out; } template <typename T1> std::ostream &operator<<(std::ostream &out, std::multiset<T1> &x) { for (auto &i : x) out << i << " "; return out; } } // name spaces using namespace std; using namespace operators; // end of name spaces // defines #define ll long long #define ull unsigned long long #define pb push_back #define mp make_pair #define pii pair<int, int> #define pll pair<ll, ll> #define f first #define s second #define uint unsigned int #define all(vc) vc.begin(), vc.end() // end of defines // usefull stuff void boost() { ios_base ::sync_with_stdio(false); cin.tie(0); cout.tie(0); } inline int getbit(int &x, int &bt) { return (x >> bt) & 1; } const int dx4[4] = {-1, 0, 0, 1}; const int dy4[4] = {0, -1, 1, 0}; const int dx8[8] = {-1, -1, -1, 0, 0, 1, 1, 1}; const int dy8[8] = {-1, -0, 1, -1, 1, -1, 0, 1}; const ll INF = (1e18) + 500; const int BIG = (1e9) * 2 + 100; const int MAXN = (1e5) + 5; const int MOD7 = (1e9) + 7; const int MOD9 = (1e9) + 9; const uint MODFFT = 998244353; #define int ll struct test { int n; vector<int> a, b; map<vector<int>, int> was; bool solve(int cntM) { if (was.find(a) != was.end()) return false; bool good = true; for (int i = 0; i < n; ++i) if (a[i] != b[i]) good = false; if (good) return true; if (cntM == 0) return false; for (int i = 0; i < n; ++i) if (a[i] >= 2) { a[i] -= 2; a[(i + 1) % n] += 1; if (solve(cntM - 2)) return true; a[(i + 1) % n] -= 1; a[i] += 2; } was[a]; return false; } void solve() { boost(); cin >> n; a.resize(n); b.resize(n); bool good = true; for (int i = 0; i < n; ++i) { cin >> a[i] >> b[i]; if (b[i] < a[i]) good = false; } // if (good) // { // int d = 0; // for (int i = 0; i < n; ++i) // d += a[i] - b[i]; // if (d % ((1LL << n) - 1)) // cout << "No\n"; // else // cout << "Yes\n"; // return; // } int cntM = 0; for (int i = 0; i < n; ++i) cntM += a[i]; if (solve(cntM)) cout << "Yes\n"; else cout << "No\n"; } }; main() { boost(); int q = 1; // cin >> q; for (int i = 0; i < q; i++) { test t; t.solve(); } return 0; } //[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]// // // // Coded by Der_Vlἀpos // // // //[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]//

Compilation message (stderr)

remittance.cpp: In member function 'void test::solve()':
remittance.cpp:144:8: warning: variable 'good' set but not used [-Wunused-but-set-variable]
  144 |   bool good = true;
      |        ^~~~
remittance.cpp: At global scope:
remittance.cpp:172:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  172 | main()
      | ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...