/* Pham Ngoc Tho aka Chis Pham */
/* [Author : Pham Ngoc Tho] - THPT Chuyen Nguyen Du */
/* [ 2024 - 12TH GO VOI 24 ] - From Nguyen Du with love */
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include<bits/stdc++.h>
using namespace std;
#define oo 0x3f
#define ff first
#define ss second
#define endl "\n"
#define ins insert
#define chis id<<1
#define pham (id<<1) + 1
#define sqr(x) ((x) * 1ll * (x))
#define gcd(a, b) __gcd(a, b)
#define pb push_back
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(),x.rend()
#define repu(i, x, n) for(int i = x; i <= n; ++i)
#define repd(i, n, x) for(int i = n; i >= x; --i)
#define reset(x, val) memset(x, val, sizeof(x))
typedef double db;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
template<class T> bool getbit(T val, int i) { return (val >> i) & 1; }
template<class T> int cntbit(T val) { return val == 0 ? 0 : cntbit(val >> 1) + (val & 1); }
template<class T> ll fpow(T a, const T b) { ll res = 1, x = a, y = b; while(y){if(y & 1)res *= x; x = x * x; y>>=1;}; return res; }
template<class T> ll modfpow(T a, T b, const T &m) { ll res = 1, x = a, y = b; x %= m; while(y){if(y & 1){res *= x; res %= m;}; x = x * x; x %= m; y >>= 1; } return res % m; }
template<class T> T lcm(T &a, T &b) { return a / gcd(a, b) * b; }
const int mod = 1e9 + 7;
const int INF = 1e9 + 7;
const ll LNF = 1e18 + 7;
inline char gc() { static char buf[1 << 23]; static size_t bc, be; if(bc >= be){ buf[0] = 0, bc = 0; be = fread(buf, 1, sizeof(buf), stdin); } return buf[bc++]; }
ll readLL() { ll a, c; while ((a = gc()) < 20); if (a == '-') return -readLL(); while ((c = gc()) >= 48) a = a * 10 + c - 480; return a - 48; }
int readInt() { int a, c; while ((a = gc()) < 10); if (a == '-') return -readInt(); while ((c = gc()) >= 48) a = a * 10 + c - 480; return a - 48; }
mt19937 RND(time(nullptr));
ll rnd(ll l, ll r)
{
assert(l <= r);ll L = l, R = r;
ll aft = (L + RND() * 1LL % (R - L + 1));
return aft;
}
#define TASK "name"
#define FILE "DEBUG"
void setIO()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
if(fopen(FILE".INP", "r")){freopen(FILE".INP", "r", stdin);freopen(FILE".OUT", "w", stdout);}
if(fopen(TASK".INP", "r")){freopen(TASK".INP", "r", stdin);freopen(TASK".OUT", "w", stdout);}
}
template<class T> T multi(const T &a, const T &b) { T res = (a*b)%mod; return res;}
template<class T> bool umax(T &a, T b) { if(a < b){ a = b; return 1;} else return 0;}
template<class T> bool umin(T &a, T b) { if(a > b){ a = b; return 1;} else return 0;}
const int NmX = 1e6 + 7;
const int dx[] = {0, 0, 1, -1};
const int dy[] = {1, -1, 0, 0};
int n;
pii a[NmX];
void read()
{
cin >> n;
repu(i, 1, n) cin >> a[i].ff >> a[i].ss;
}
namespace sub1{
int num[10], check[10];
pii b[NmX];
bool can(){
repu(i, 1, n) b[i] = a[i];
repu(i, 1, n){
if(num[i] == 0) continue;
int nxt = (num[i] == n ? 1 : num[i] + 1);
int vt = num[i];
int val = ((b[vt].ff - b[vt].ss)%2 == 0 ? (b[vt].ff - b[vt].ss)/2 : -1);
if(val == -1) return 0;
b[nxt].ff += val;
b[vt].ff = b[vt].ss;
}
repu(i, 1, n){
// cout << b[i].ff << " " << b[i].ss << endl;
if(b[i].ff != b[i].ss) return 0;
}
return 1;
}
void Try(int x){
repu(j, 0, n) if(!check[j]){
num[x] = j;
if(j != 0) check[j] = 1;
if(x == n){
// repu(i, 1, n) cout << num[i] << " ";
// cout << endl;
if(can()){
cout << "Yes";
exit(0);
}
}else Try(x + 1);
check[j] = 0;
}
}
void solve(){
Try(1);
cout << "No";
}
}
void process()
{
sub1::solve();
}
main()
{
setIO();
int test = 1;
// cin >> test;
while(test--)
{
read();
process();
}
cerr << "Time elapsed: " << (1.0 * clock()/CLOCKS_PER_SEC) * 1000 << "ms.\n";
return 0;
}
Compilation message
remittance.cpp:137:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
137 | main()
| ^~~~
remittance.cpp: In function 'void setIO()':
remittance.cpp:61:39: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
61 | if(fopen(FILE".INP", "r")){freopen(FILE".INP", "r", stdin);freopen(FILE".OUT", "w", stdout);}
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
remittance.cpp:61:71: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
61 | if(fopen(FILE".INP", "r")){freopen(FILE".INP", "r", stdin);freopen(FILE".OUT", "w", stdout);}
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
remittance.cpp:62:39: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
62 | if(fopen(TASK".INP", "r")){freopen(TASK".INP", "r", stdin);freopen(TASK".OUT", "w", stdout);}
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
remittance.cpp:62:71: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
62 | if(fopen(TASK".INP", "r")){freopen(TASK".INP", "r", stdin);freopen(TASK".OUT", "w", stdout);}
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
4444 KB |
Output is correct |
| 2 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 3 |
Correct |
1 ms |
4440 KB |
Output is correct |
| 4 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 5 |
Correct |
1 ms |
4564 KB |
Output is correct |
| 6 |
Correct |
2 ms |
4444 KB |
Output is correct |
| 7 |
Correct |
1 ms |
4572 KB |
Output is correct |
| 8 |
Incorrect |
1 ms |
4444 KB |
Output isn't correct |
| 9 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
4444 KB |
Output is correct |
| 2 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 3 |
Correct |
1 ms |
4440 KB |
Output is correct |
| 4 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 5 |
Correct |
1 ms |
4564 KB |
Output is correct |
| 6 |
Correct |
2 ms |
4444 KB |
Output is correct |
| 7 |
Correct |
1 ms |
4572 KB |
Output is correct |
| 8 |
Incorrect |
1 ms |
4444 KB |
Output isn't correct |
| 9 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
4444 KB |
Output is correct |
| 2 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 3 |
Correct |
1 ms |
4440 KB |
Output is correct |
| 4 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 5 |
Correct |
1 ms |
4564 KB |
Output is correct |
| 6 |
Correct |
2 ms |
4444 KB |
Output is correct |
| 7 |
Correct |
1 ms |
4572 KB |
Output is correct |
| 8 |
Incorrect |
1 ms |
4444 KB |
Output isn't correct |
| 9 |
Halted |
0 ms |
0 KB |
- |
