#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N=1e6+5;
ll n,a[N],b[N],c[N],save[N];
bool ok;
void ql(int i)
{
if (i>n)
{
for (int i=1;i<=n;i++)
c[i]=a[i];
for (int i=1;i<=n;i++)
{
c[i]-=save[i]*2;
c[i%n+1]+=save[i];
}
ok=true;
for (int i=1;i<=n;i++)
if (c[i]!=b[i])
{
ok=false;
break;
}
if (ok)
{
cout << "Yes";
exit(0);
}
return;
}
for (save[i]=0;save[i]<=8;save[i]++)
ql(i+1);
}
int main()
{
ios_base::sync_with_stdio(NULL);
cin.tie(NULL); cout.tie(NULL);
cin >> n;
for (int i=1;i<=n;i++)
cin >> a[i] >> b[i];
ql(1);
cout << "No";
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |