text stringlengths 49 983k |
|---|
#include "bits/stdc++.h"
using namespace std;
int main(){
int n,i,a,s;
cin >> n;
s=0;
for(i=0;i<n;i++){
cin >> a;
s+=a;
}
cout << s-n << endl;
return 0;
} |
#include<stdio.h>
int main()
{
int i,s=0,n,a[3001];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
s+=a[i]-1;
}
printf("%d\n",s);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,a;
int64_t ans=0;
cin >> n;
for(int i=0;i<n;i++){
cin >> a;
ans+=a-1;
}
cout << ans << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,num;
cin>>n;
int sum=0;
for(int i=0;i<n;i++){
cin>>num;
sum+=num-1;
}
cout<<sum<<endl;
} |
#include <iostream>
using namespace std;
int main(){
int n,x;
int sum=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>x;
sum+=x;
}
cout<<sum-n<<endl;
} |
#include <iostream>
using namespace std;
int main() {
int N; cin >> N;
int a,f = 0;
for (int i = 0; i < N; i++) {
cin >> a;
f += a - 1;
}
cout << f;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int a[n],ans=0-n;
for(int i=0;i<n;i++)
{
cin>>a[i];
ans+=a[i];
}
cout<<ans;
return 0;
} |
#include<iostream>
using namespace std;
int main()
{
int n,t,i,res=0;
cin >> n;
for(i=0;i<n;i++){
cin >> t;
res+=t-1;
}
cout << res << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N, a, ans = 0;
cin >> N;
for(int i = 0; i < N; i++)
{
cin >> a;
ans += a-1;
}
cout << ans << endl;
}
|
#include<iostream>
using namespace std;
int main()
{
long long n;
cin>>n;
long long a,s=0;
for(int i=0;i<n;i++)
{
cin>>a;
s+=a;
}
cout<<s-n<<endl;
} |
#include<iostream>
using namespace std;
int main(){
int n,i,sum,k;
cin >> n;
for(i=0;i<n;i++){
cin >> k;
sum += k;
}
cout << sum-n << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N, A, sum = 0;
cin>>N;
for(int i = 0; i < N; i++){
cin>>A;
sum += A-1;
}
cout<<sum<<endl;
return 0;
} |
#include <iostream>
using namespace std;
int main(){
int n,a=0,t;
cin>>n;
while(n--){
cin>>t;
a+=t-1;
}
cout<<a;
return 0;
} |
#include<iostream>
using namespace std;
int main(){
int n,a=0; cin>>n; for(int i=0;i<n;i++) {int x; cin>>x; a+=x;} cout<<a-n<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,i,k,kotae=0;
cin>>n;
int a[n];
for(i=0;i<n;i++){
cin>>a[i];
kotae+=a[i]-1;
}
cout<<kotae;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
int ans=0;
for(int i=0;i<n;i++){
int c;cin>>c;
ans+=c-1;
}
cout<<ans<<endl;
} |
#include<iostream>
using namespace std;
int main(){
int n,a[3001],sum=0;
cin >> n;
for(int i=0;i<n;i++){
cin >> a[i];
sum+=a[i]-1;
}
cout << sum;
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,x,sum=0;
scanf("%d",&n);
for(int i=1;i<=n;++i)
{
scanf("%d",&x);
sum+=x-1;
}
printf("%d\n",sum);
} |
#include<cstdio>
int main()
{
int n,x,ans=0;
scanf("%d",&n);
while (n--)
{
scanf("%d",&x);
ans+=x-1;
}
printf("%d\n",ans);
}
|
#include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
int b[a];
int ans = 0;
for (int i = 0;i < a;i++) {
cin >> b[i];
ans += b[i] - 1;
}
cout << ans;
} |
#include <bits/stdc++.h>
#define int long long
using namespace std;
int sum;
signed main(){
int n,a;
cin>>n;
for(int i=0;i<n;i++){
cin>>a;
sum+=a-1;
}
cout<<sum<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,i,s=0,a;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a);
s+=a;
}
printf("%d",s-n);
return 0;
} |
#include<stdio.h>
int main()
{ int n,sum=0,i,k;
scanf("%d",&n);
for(i=1;i<=n;i++)
{scanf("%d",&k);sum=sum+(k-1);}
printf("%d",sum);
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int N; cin >> N;
int a,f = 0;
for (int i = 0; i < N; i++) {
cin >> a;
f += a - 1;
}
cout << f << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,a;
cin>>a;
for(;cin>>n;) a-=n;
cout<<-a<<endl;
} |
#include <stdio.h>
int main(){
int n,s,answer = 0;
scanf("%d",&n);
for(int i =0; i<n; i++){
scanf("%d",&s);
answer += s-1;
}
printf("%d\n",answer);
} |
#import <iostream>
using namespace std;
int main(){
int N,f=0;
cin>>N;
int a[N];
for(int i=0;i<N;i++){
cin>>a[i];
f+=a[i]-1;
}
cout<<f<<endl;
return 0;
}
|
#include<stdio.h>
int main(void){
int n,a,ans;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&a);
ans+=a-1;
}
printf("%d",ans);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int res = 0;
for(int i = 0; i < n; i++){
int t;
cin>>t;
res+=(t-1);
}
cout<<res;
} |
#include<iostream>
using namespace std;
int main(){
int n;cin>>n;
long long sum=0;
for(int i=0;i<n;i++){
int a;cin>>a;
sum+=a-1;
}
cout<<sum<<endl;
}
|
#include<stdio.h>
int main(void){
int n;
scanf("%d",&n);
int a[n];
int sum = 0;
for(int i=0;i<n;i++){
scanf("%d",a+i);
sum += a[i];
}
printf("%d",sum-n);
return 0;
} |
#include<cstdio>
using namespace std;
int main(){
int n,sum=0;
scanf("%d",&n);
for (int i=1;i<=n;i++){
int x;
scanf("%d",&x);
sum+=x-1;
}
printf("%d",sum);
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n; cin>>n;
int res=-n;
for(int a; n--; res+=a) cin>>a;
cout<<res<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
int n,tmp,ans;
int main(){
cin>>n;
while(n--){
cin>>tmp;
ans+=(tmp-1);
}
cout<<ans<<endl;
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int n,a,s;
s=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>a;
s+=a;
}
cout<<s-n;
} |
#include <stdio.h>
int main()
{
long long sum=0;
int n,i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&j);
sum=sum+j-1;
}
printf("%lld\n",sum);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int a=0,b;
for(int i=0;i<n;i++){
cin>>b;
a+=b-1;
}
cout<<a<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int s=0;
for(int i=0;i<n;i++){
int a;
cin>>a;
s+=a-1;
}
cout<<s<<endl;
} |
#include <iostream>
int main()
{
std::cin.tie(0);
int n, ans, a = 0;
std::cin >> n;
while(n--){
std::cin >> a;
ans += a-1;
}
std::cout << ans << '\n';
}
|
#include<iostream>
using namespace std;
int m,a;
int main()
{
cin>>m;long long mt=0;
for(int i=0;i<m;i++)
{
cin>>a;
mt+=a-1;
}
cout<<mt<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,s=0,i;
cin>>n;
int a[n+1];
for (i=1;i<=n;i++)
{
cin>>a[i];
s+=a[i]-1;
}
cout<<s;
return 0;
} |
#include<iostream>
using namespace std;
int main()
{
int n;
cin>>n;
int a[n];
long long sum=0;
for(int i=0;i<n;i++)
{
cin>>a[i];
sum+=a[i];
}
sum-=n;
cout<<sum;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, A;
cin >> N;
N = 0;
while (cin >> A) N += --A;
cout << N << "\n";
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,a;
cin >> n;
int ans=-n;
for(int i=0;i<n;i++){
cin >> a;
ans+=a;
}
cout << ans<< endl;
}
|
#include <iostream>
using namespace std;
int n,a;
long long ans;
int main()
{
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a;
ans+=a-1;
}
cout<<ans;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll n,c=0,a;
cin>>n;
for(ll i=0;i<n;i++){
cin>>a;
c+=a-1;
}
cout<<c;
} |
#include<iostream>
#include<stdio.h>
using namespace std;
int n,a,ans;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a;
ans+=(a-1);
}
cout<<ans;
} |
#include <bits/stdc++.h>
using namespace std;
const int maxn=112345;
typedef pair<int,int> pii;
int n,m,l,r,x,d[maxn],vis[maxn];
vector<pii> G[maxn];
bool dfs(int u,int dep) {
vis[u]=1;
d[u]=dep;
for (int i=0;i<(int)G[u].size();++i) {
int v=G[u][i].first,w=G[u][i].second;
if (vis[v]&&d[u]+w!=d[v]) return false;
if (!vis[v]&&!dfs(v,dep+w)) return false;
}
return true;
}
int main()
{
scanf("%d%d",&n,&m);
for (int i=0;i<m;++i) {
scanf("%d%d%d",&l,&r,&x);
G[l].push_back(pii(r,x));
G[r].push_back(pii(l,-x));
}
for (int i=1;i<=n;++i) if (!vis[i]&&!dfs(i,0))
return 0*puts("No");
return 0*puts("Yes");
}
|
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
const int INF=(int)(1<<30);
vector<pair<int, int> > graph[101010];
int vis[101010];
int d[101010];
void dfs(int cur, long long S) {
if(vis[cur] == 1) {
if(d[cur] != S) {
cout << "No" << endl;
exit(0);
}
return;
}
vis[cur] = 1;
d[cur] = S;
for(auto g:graph[cur]) dfs(g.first, S+g.second);
}
int main() {
int N, M; cin >> N >> M;
vector<int> L(M), R(M), D(M);
for(int i = 0; i < M; ++i) {
cin >> L[i] >> R[i] >> D[i];
L[i]--, R[i]--;
graph[L[i]].push_back(make_pair(R[i], D[i]));
graph[R[i]].push_back(make_pair(L[i], -D[i]));
}
for(int i = 0; i < N; ++i) {
if(vis[i] == 0) dfs(i, 0);
}
cout << "Yes" << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int N,M;
int v[100001];
vector<pair<int,int>>e[100001];
void dfs(int i,int x){
v[i]=x;
for(auto a:e[i]){
if(v[a.first]){
if(v[i]+a.second!=v[a.first]){
cout<<"No";
exit(0);
}
}else{
dfs(a.first,v[i]+a.second);
}
}
}
int main(){
cin>>N>>M;
for(int i=0;i<M;++i){
int L,R,D;
scanf("%d%d%d",&L,&R,&D);
e[L].push_back({R,D});
e[R].push_back({L,-D});
}
for(int i=1;i<=N;++i){
if(!v[i]){
dfs(i,(int)1e9);
}
}
cout<<"Yes";
} |
#prag\
ma GCC optimize("O3")
#include <bits/stdc++.h>
typedef long long ll;
#define N 100005
using namespace std;
int n,m,fa[N],dist[N];
void Init()
{
for(int i=1;i<=n;++i)
{
fa[i]=i;
dist[i]=0;
}
}
int Find(int x)
{
if(fa[x]==x) return x;
int tmp=fa[x]; fa[x]=Find(fa[x]); dist[x]+=dist[tmp];
return fa[x];
}
int main()
{
scanf("%d%d",&n,&m);
Init();
for(int i=1;i<=m;++i)
{
int l,r,d; scanf("%d%d%d",&l,&r,&d);
int tl=Find(l),tr=Find(r);
if(tl==tr)
{
if(dist[l]+d!=dist[r])
{
printf("No\n");
return 0;
}
}
else
{
fa[tr]=tl;
dist[tr]=dist[l]-dist[r]+d;
}
}
printf("Yes\n");
return 0;
}
|
#include <cstdio>
#include <vector>
#include <cstdlib>
#define N 100005
int n, m, l, r, d, v[N], w[N];
std::vector<int> g[N], h[N];
void f(int p, int q) {
if(v[p]) {
if(q != w[p]) {puts("No"); exit(0);}
return;
}
v[p] = 1;
w[p] = q;
for(int i=0; i<g[p].size(); i++) {
f(g[p][i], q + h[p][i]);
}
}
int main() {
scanf("%d%d", &n, &m);
while(m--) {
scanf("%d%d%d", &l, &r, &d);
g[l].push_back(r);
g[r].push_back(l);
h[l].push_back(d);
h[r].push_back(-d);
}
for(int i=1; i<=n; i++) {
if(!v[i]) f(i, 0);
}
puts("Yes");
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
const long long INFLL = 0x3f3f3f3f3f3f3f3fLL;
long long D[101010];
vector<pair<int, int> > conn[101010];
void dfs(int a, int d)
{
if(D[a] == INFLL)
{
D[a] = d;
for(auto x: conn[a])
{
int u, v; tie(u, v) = x;
dfs(u, d+v);
}
}
if(D[a] != d) { puts("No"); exit(0);}
}
int N, M;
int main()
{
scanf("%d%d", &N, &M);
for(int i=0; i<M; ++i)
{
int l, r, d; scanf("%d%d%d", &l, &r, &d);
conn[l].emplace_back(r, d);
conn[r].emplace_back(l, -d);
}
memset(D, 0x3f, sizeof D);
for(int i=1; i<=N; ++i)
{
if(D[i] == INFLL) dfs(i, 0);
}
puts("Yes");
} |
#include<bits/stdc++.h>
using namespace std;
const int N = 100007;
vector< pair<int,int> > g[N];
bool ok = 1;
bool vis[N];
vector<int> A(N);
void dfs(int x){
vis[x] = 1;
for(int i = 0; i < (int)g[x].size();i++){
int to = g[x][i].first;
int len = g[x][i].second;
if(!vis[to]){
A[to] = A[x]+len;
dfs(to);
} else {
if(A[to]!=A[x]+len) ok = 0;
}
}
}
int main(){
int n,m;
cin>>n>>m;
for(int i = 0;i<m;i++){
int l,r,d;
cin>>l>>r>>d;
g[l].push_back(make_pair(r,d));
g[r].push_back(make_pair(l,-d));
}
for(int i = 1;i < n;i++){
if(!vis[i]) dfs(i);
}
if(ok) cout<<"Yes";
else cout<<"No";
} |
#include <bits/stdc++.h>
using namespace std;
struct edge {
int from;
int to;
int w;
};
int const N = 1234567;
vector<edge> edges[N];
int d[N];
int was[N];
void dfs(int v, int val) {
d[v] = val;
was[v] = true;
for (auto &e : edges[v]) {
if (!was[e.to]) {
dfs(e.to, val + e.w);
}
}
}
int main() {
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int v, u, d;
cin >> v >> u >> d;
--v;
--u;
edges[v].push_back({v, u, d});
edges[u].push_back({u, v, -d});
}
for (int i = 0; i < n; i++) was[i] = false;
for (int i = 0; i < n; i++) {
if (!was[i]) {
dfs(i, 0);
}
}
for (int i = 0; i < n; i++) {
for (auto &e : edges[i]) {
if (d[e.from] + e.w != d[e.to]) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes\n";
}
|
#include "bits/stdc++.h"
using namespace std;
typedef pair<int, int> P;
int x[100000];
vector<P> G[100000];
bool vis[100000];
bool dfs(int v, int now) {
vis[v] = 1;
x[v] = now;
for (auto e : G[v]) {
int to = e.first;
int d = e.second;
if (!vis[to]) {
if (!dfs(to, now + d)) return false;
}
else if (x[v] + d != x[to]) {
return false;
}
}
return true;
}
int main() {
int N, M;
cin >> N >> M;
for (int i = 0; i < M; i++) {
int L, R, D;
cin >> L >> R >> D;
L--; R--;
G[L].push_back(P(R, D));
G[R].push_back(P(L, -D));
}
for (int i = 0; i < N; i++) {
if (!vis[i]) {
if (!dfs(i, 0)) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
} |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100000;
vector<pair<int, int>> edges[MAXN];
int dist[MAXN];
bool bio[MAXN];
bool dfs(int i)
{
for (const auto& edge: edges[i])
{
if (!bio[edge.first])
{
dist[edge.first] = dist[i] + edge.second;
bio[edge.first] = true;
if (dfs(edge.first))
return true;
}
else if (dist[edge.first] != dist[i] + edge.second)
return true;
}
return false;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, m, i;
int l, r, d;
cin>>n>>m;
while (m--)
{
cin>>l>>r>>d;
--l, --r;
edges[l].push_back({r, d});
edges[r].push_back({l, -d});
}
for (i = 0; i < n; ++i) if (!bio[i])
{
dist[i] = 0;
bio[i] = true;
if (dfs(i))
{
cout<<"No\n";
return 0;
}
}
cout<<"Yes\n";
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100100;
int n , m ;
int vis[N];
ll dis[N];
vector<pair<int,ll>>adj[N];
bool dfs(int u,ll d){
if( vis[u] )return dis[u]==d;
vis[u]=1;
dis[u]=d;
for(auto p:adj[u]){
int v = p.first;
ll dx = p.second;
if( !dfs(v,d+dx) )
return 0;
}
return 1;
}
int main(){
scanf("%d %d",&n,&m);
while( m-- ){
int i,j;
ll d;
scanf("%d %d %lld",&i,&j,&d);
adj[i].push_back({j,d});
adj[j].push_back({i,-d});
}
for(int i=1;i<=n;i++)
if( !vis[i] )
if( !dfs(i,0) ){
printf("No\n");
return 0;
}
printf("Yes\n");
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int N,M;
int v[100001];
vector<pair<int,int>>e[100001];
void dfs(int i,int x){
v[i]=x;
for(auto a:e[i]){
if(v[a.first]){
if(v[i]+a.second!=v[a.first]){
cout<<"No";
exit(0);
}
}else{
dfs(a.first,v[i]+a.second);
}
}
}
int main(){
cin>>N>>M;
for(int i=0;i<M;++i){
int L,R,D;
cin>>L>>R>>D;
e[L].push_back({R,D});
e[R].push_back({L,-D});
}
for(int i=1;i<=N;++i){
if(!v[i]){
dfs(i,(int)1e9);
}
}
cout<<"Yes";
}
|
#include<bits/stdc++.h>
using namespace std;
const int size=100010;
int n,m;
int used[size];
int d[size];
bool flag=false;
struct edge//from left to right
{
int to,val;
edge(int to=0,int val=0):to(to),val(val) {}
};
vector<edge> V[size];
void dfs(int from,int to,int len)
{
if(used[to])
if(d[from]+len!=d[to])
{
cout<<"No"<<endl;
exit(0);
}
else return;
used[to]=1;
d[to]=d[from]+len;
for(int i=0;i<V[to].size();i++)
{
int nto=V[to][i].to;
dfs(to,nto,V[to][i].val);
}
}
int main()
{
cin>>n>>m;
if(m==0)
{
cout<<"Yes"<<endl;
return 0;
}
for(int i=0;i<m;i++)
{
int L,R,len;
cin>>L>>R>>len;
V[L].push_back(edge(R,len));
V[R].push_back(edge(L,-len));
}
for(int i=1;i<=n;i++)
if(!used[i])
dfs(i,i,0);
cout<<"Yes"<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int Nmax = int(1e5 + 2);
int n, m, val[Nmax];
bool vis[Nmax];
vector<pair<int, int>>G[Nmax];
void dfs(int x) {
vis[x] = 1;
for(auto it : G[x]) {
int y = it.first, cost = it.second;
if(!vis[y]) {
val[y] = val[x] + cost;
dfs(y);
} else if(val[y] != val[x] + cost) {
cout << "No";
exit(0);
}
}
}
int32_t main() {
//ifstream cin("a.in");
cin >> n >> m;
for(int i = 1; i <= m; ++i) {
int l, r, c;
cin >> l >> r >> c;
G[l].emplace_back(r, c);
G[r].emplace_back(l, -c);
}
for(int i = 1; i <= n; ++i)
if(!vis[i]) dfs(i);
cout << "Yes";
}
|
#include <stdio.h>
#include <string.h>
#include <algorithm>
#define rep(i,st,ed) for (int i=st;i<=ed;++i)
#define drp(i,st,ed) for (int i=st;i>=ed;--i)
const int N=1011111;
int fa[N],d[N];
int read() {
int x=0,v=1; char ch=getchar();
for (;ch<'0'||ch>'9';v=(ch=='-')?(-1):(v),ch=getchar());
for (;ch<='9'&&ch>='0';x=x*10+ch-'0',ch=getchar());
return x*v;
}
int find(int x) {
if (!fa[x]) return x;
int f=find(fa[x]);
d[x]+=d[fa[x]];
return fa[x]=f;
}
int main(void) {
int n=read(),m=read();
for (;m--;) {
int x=read(),y=read(),k=read();
int fx=find(x),fy=find(y);
if (fx==fy) {
if (d[y]-d[x]!=k) return 0&puts("No");
} else fa[fy]=fx,d[fy]=d[x]+k-d[y];
}
return 0&puts("Yes");
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<ll,ll> P;
#define pb push_back
#define mp make_pair
#define fr(i,n) for(int i=0;i<n;i++)
#define Fr(i,n) for(int i=0;i++<n;)
#define ifr(i,n) for(int i=n-1;i>=0;i--)
#define iFr(i,n) for(int i=n;i>0;i--)
ll n,m,l,r,d,val[100010]={};
vector<P> v[100010];
bool vis[100010]={},ans=1;
void dfs(ll i,ll va,bool key=0){
if(vis[i]){
if(key&&val[i]!=va) ans=0;
return;
}
vis[i]=1;val[i]=va;
fr(j,v[i].size()) dfs(v[i][j].first,va+v[i][j].second,1);
}
int main(){
cin>>n>>m;
fr(i,m){
cin>>l>>r>>d;
v[l].pb(mp(r,d));
v[r].pb(mp(l,-d));
}
Fr(i,n) dfs(i,0);
cout<<(ans?"Yes":"No")<<endl;
} |
#prag\
ma GCC optimize("Ofast")
#include <bits/stdc++.h>
typedef long long ll;
#define N 100005
using namespace std;
int n,m,fa[N],dist[N];
int fl,fr;
int Find(int x)
{
if(fa[x]==x) return x;
int tmp=fa[x]; fa[x]=Find(fa[x]); dist[x]+=dist[tmp];
return fa[x];
}
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;++i)
{
fa[i]=i;
dist[i]=0;
}
while(m--)
{
int l,r,d; scanf("%d%d%d",&l,&r,&d);
int tl=Find(l),tr=Find(r);
if(tl!=tr)
{
fa[tr]=tl;
dist[tr]=dist[l]-dist[r]+d;
}
else if(dist[r]-dist[l]!=d)
{
printf("No\n");
return 0;
}
}
printf("Yes\n");
return 0;
} |
#include<iostream>
#include<cstdio>
#include<cstring>
namespace fuck
{
const int N=101000,M=N*4;
int begin[N],next[M],to[M],w[M];
int n,m,e;
void add(int x,int y,int z,bool k=1)
{
to[++e]=y;
next[e]=begin[x];
begin[x]=e;
w[e]=z;
if(k)add(y,x,-z,0);
}
void initialize()
{
scanf("%d%d",&n,&m);
for(int i=1,u,v,k;i<=m;i++)
{
scanf("%d%d%d",&u,&v,&k);
add(u,v,k);
}
}
bool vis[N];
int f[N];
bool dfs(int p,int x)
{
if(vis[p])return f[p]==x;
vis[p]=1,f[p]=x;
for(int i=begin[p];i;i=next[i])
if(!dfs(to[i],x+w[i]))return 0;
return 1;
}
bool judge()
{
for(int i=1;i<=n;i++)
if(!vis[i] && !dfs(i,0))
return 0;
return 1;
}
void solve()
{
initialize();
printf("%s\n",judge()?"Yes":"No");
}
}
int main()
{
fuck::solve();
return 0;
}
|
#include<cstdio>
const int N=1e5+7;
int flag,fa[N],val[N],n,m,i,j,x,y,z,p,q;
int find(int x){
if(x==fa[x])return x;
else{
int tmp=fa[x];fa[x]=find(fa[x]);
val[x]+=val[tmp];
return fa[x];
}
}
int main(){
for(scanf("%d%d",&n,&m),i=1;i<=n;++i)fa[i]=i;
for(;m--;){
scanf("%d%d%d",&x,&y,&z);
if(flag)continue;
p=find(x);q=find(y);
if(p==q){
if(val[x]-val[y]!=z)flag=1;
}else{
fa[p]=q;
val[p]=z+val[y]-val[x];
}
}
puts(flag?"No":"Yes");
} |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
typedef long long ll;
int n, m, fa[N];
ll dis[N];
int getfa(int w) {
if (fa[w] == w) return w;
int tmp = fa[w];
fa[w] = getfa(fa[w]);
dis[w] += dis[tmp];
return fa[w];
}
int get_dis(int w) {
return fa[w] == w ? 0 : get_dis(fa[w]) + dis[w];
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i <= n; i++) fa[i] = i;
for (int i = 1; i <= m; i++) {
int L, R, D;
scanf("%d%d%d", &L, &R, &D);
int fl = getfa(L), fr = getfa(R);
if (fl == fr) {
if (dis[L] + D != dis[R]) {
puts("No"); return 0;
}
} else {
fa[fr] = fl;
dis[fr] = get_dis(L) - get_dis(R) + D;
}
}
puts("Yes");
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
bool vis[100001];
map<int,int> mp;
int n,m;
vector<pair<int,int> > v[100001];
void dfs(int now,int shen){
//cout<<now<<endl;
if(vis[now]){
if(mp[now]!=shen){
cout<<"No";
exit(0);
}
else
return;
}
vis[now]=true;
mp[now]=shen;
for(int i=0;i<v[now].size();i++){
int c=v[now][i].first;
dfs(c,shen+v[now][i].second);
}
}
int main(){
cin>>n>>m;
for(int i=1;i<=m;i++){
int l,r,d;
cin>>l>>r>>d;
v[l].push_back(make_pair(r,d));
v[r].push_back(make_pair(l,-d));
}
for(int i=1;i<=n;i++)
if(!vis[i])
dfs(i,0);
cout<<"Yes";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
typedef pair<int, int> ii;
const int N = 1e5 + 5;
const int M = 2e5 + 5;
int n, m;
int l[M], r[M], d[M], mark[N];
long long sum[N];
vector<ii> adj[N];
void dfs(int u) {
mark[u] = 1;
for (ii v : adj[u]) {
if (!mark[v.fi]) {
sum[v.fi] = sum[u] + v.se;
dfs(v.fi);
}
}
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i ++) {
scanf("%d%d%d", &l[i], &r[i], &d[i]);
adj[l[i]].push_back(mp(r[i], d[i]));
adj[r[i]].push_back(mp(l[i], -d[i]));
}
for (int u = 1; u <= n; u ++) {
if (mark[u] == 0) {
dfs(u);
}
}
for (int i = 1; i <= m; i ++) {
if (sum[r[i]] - sum[l[i]] != d[i]) {
printf("No\n");
exit(0);
}
}
printf("Yes\n");
} |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const long long inf = 1e18;
long long dp[N];
vector<pair<int, int>> edge[N];
bool dfs(int now, long long cost) {
if (dp[now] != inf) return dp[now] == cost;
dp[now] = cost;
for (auto it : edge[now]) {
if (dfs(it.first, cost + it.second) == 0) {
return 0;
}
}
return 1;
}
int main() {
int n, m;
scanf("%d %d", &n, &m);
for (int i = 0; i < m; i++) {
int l, r, d;
scanf("%d %d %d", &l, &r, &d);
edge[l].emplace_back(r, d);
edge[r].emplace_back(l, -d);
}
fill(dp, dp + N, inf);
for (int i = 1; i <= n; i++) {
if (dp[i] == inf) {
if (dfs(i, 0) == 0) {
puts("No");
return 0;
}
}
}
puts("Yes");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
constexpr int maxn = 100000 + 10;
vector<tuple<int, int, int>> edges;
vector<pair<int, int>> vec[maxn] = {};
int poz[maxn] = {};
int in_deg[maxn] = {};
int main(){
int n, m;
cin >> n >> m;
for(int i = 0, x, y, z; i < m; ++i){
cin >> x >> y >> z;
edges.emplace_back(x, y, z);
vec[x].emplace_back(y, z);
++in_deg[y];
}
queue<int> de_viz;
for(int i =0; i < n; ++i)
if(in_deg[i] == 0)
de_viz.push(i);
while(!de_viz.empty()){
int cur = de_viz.front();
de_viz.pop();
for(auto next : vec[cur]){
poz[next.first] = poz[cur] + next.second;
if(--in_deg[next.first] == 0)
de_viz.push(next.first);
}
}
bool good = true;
for(auto& x : edges)
good = (good && poz[get<0>(x)] + get<2>(x) == poz[get<1>(x)]);
cout << (good ? "Yes" : "No");
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
struct edge {
int nxt, to, w;
} e[N << 2];
int n, m, cnt = 1;
int vis[N], h[N], val[N];
bool dfs(int u) {
vis[u] = 1;
for(int i = h[u]; i; i = e[i].nxt) {
if(vis[e[i].to]) {
if(val[e[i].to] != val[u] + e[i].w) {
return false;
}
} else {
val[e[i].to] = val[u] + e[i].w;
if(!dfs(e[i].to)) {
return false;
}
}
}
return true;
}
void link(int u, int v, int w) {
e[++cnt].nxt = h[u];
h[u] = cnt;
e[cnt].to = v;
e[cnt].w = w;
}
int main() {
scanf("%d%d", &n, &m);
for(int i = 1; i <= m; ++i) {
int u, v, w;
scanf("%d%d%d", &u, &v, &w);
link(u, v, w);
link(v, u, -w);
}
for(int i = 1; i <= n; ++i) {
if(!vis[i]) {
if(!dfs(i)) {
puts("No");
return 0;
}
}
}
puts("Yes");
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1e5+5;
vector< pair<ll,ll> > adj[N];
ll vis[N],dist[N],n,m;
void dfs(ll u,ll d){
if(vis[u]==1){
if(dist[u]!=d){
cout<<"No";
exit(0);
}
return;
}
vis[u]=1;
dist[u]=d;
for(auto &node:adj[u])dfs(node.first,d+node.second);
}
int main(){
ios_base:: sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
cin>>n>>m;
for(ll i=0;i<m;i++){
ll x,y,d;cin>>x>>y>>d;
adj[x].push_back({y,d});
adj[y].push_back({x,-d});
}
for(ll i=1;i<=n;i++)if(!vis[i])dfs(i,0);
cout<<"Yes";
} |
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int n,m,fa[N],di[N];
inline int ask(int x){
if (fa[x]==x) return x;
int t=ask(fa[x]);
di[x]+=di[fa[x]];
return fa[x]=t;
}
int main(){
scanf("%d%d",&n,&m);
for (int i=1;i<=n;++i) fa[i]=i;
for (int id=1,x,y,z;id<=m;++id){
scanf("%d%d%d",&x,&y,&z);
int u=ask(x),v=ask(y),dx=di[x],dy=di[y];
if (u!=v){
fa[u]=v;
di[u]=dy-dx-z;
}else{
if (dx+z!=dy) return puts("No"),0;
}
}
puts("Yes");
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int N=100005;
int n,m,f[N],d[N];
bool flag=1;
int find(int x){
if(x==f[x])return x;
int tmp=find(f[x]);
d[x]+=d[f[x]];
return f[x]=tmp;
}
bool work(int x,int y,int z){
int rx=find(x),ry=find(y);
if(rx==ry){
if(d[y]-d[x]==z)return 1;
else return 0;
}
f[ry]=rx;
d[ry]=d[x]+z-d[y];
return 1;
}
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)f[i]=i;
for(int i=1;i<=m;i++){
int x,y,z;
scanf("%d%d%d",&x,&y,&z);
if(flag)flag=work(x,y,z);
}
if(flag)puts("Yes");
else puts("No");
return 0;
} |
#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 5;
vector<P> g[maxn];
bool vis[maxn];
int f[maxn];
bool dfs(int u,int d) {
if(vis[u]) return f[u] == d;
f[u] = d;
vis[u] = 1;
for(auto v:g[u]) {
if(!dfs(v.fi,d + v.se)) return false;
}
return true;
}
int main() {
#ifdef CX_TEST
freopen("E:\\program--GG\\test_in.txt", "r", stdin);
#endif
int n, m, i, j, u, v, w;
scanf("%d%d", &n, &m);
for(i = 0; i < m; i++) {
scanf("%d%d%d", &u, &v, &w);
g[u].push_back(P(v, w));
g[v].push_back(P(u, -w));
}
for(i = 1; i <= n; i++) {
if(!vis[i] && !dfs(i, 0)) return puts("No"),0;
}
puts("Yes");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<pair<int, int> > adj[100010];
int assigned[100010], val[100010];
bool poss = false;
void possible(int a, int v)
{
if (assigned[a] && val[a] != v) poss = false;
if (assigned[a]) return;
assigned[a] = true;
val[a] = v;
for (auto b : adj[a]) possible(b.first, v + b.second);
}
int main()
{
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++)
{
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
adj[a].emplace_back(b, c);
adj[b].emplace_back(a, -c);
}
poss = true;
for (int i = 0; i < n; i++)
{
if (!assigned[i]) possible(i, 0);
}
if (!poss) printf("No\n");
else printf("Yes\n");
}
|
#include <cstdio>
const int N = 100000;
int n, m, p[N], d[N];
int find(int u)
{
if (p[u] == u) {
return u;
}
int r = find(p[u]);
d[u] += d[p[u]];
p[u] = r;
return r;
}
int main()
{
scanf("%d%d", &n, &m);
for (int i = 0; i < n; ++ i) {
p[i] = i, d[i] = 0;
}
while (m --) {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
a --;
b --;
int pa = find(a);
int pb = find(b);
if (pa == pb) {
if (d[b] - d[a] != c) {
puts("No");
return 0;
}
} else {
p[pb] = pa;
d[pb] = c - d[b] + d[a];
}
}
puts("Yes");
} |
#include <bits/stdc++.h>
using namespace std;
#define ll int64_t
typedef pair<int,int> P;
const int INF=numeric_limits<int>::max();
const int N=1e5+5;
int n,m,dist[N];
vector<P> adj[N];
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);
cin>>n>>m;
for(int i=0;i<m;++i){
int l,r,d;
cin>>l>>r>>d;
adj[l].emplace_back(r,d);
adj[r].emplace_back(l,-d);
}
for(int i=1;i<=n;++i) dist[i]=INF;
for(int i=1;i<=n;++i)
if(dist[i]==INF){
dist[i]=0;
queue<int> Q;
Q.push(i);
while(!Q.empty()){
int u=Q.front();
Q.pop();
for(P nxt:adj[u]){
int v=nxt.first;
int d=nxt.second;
if(dist[v]==INF){
dist[v]=dist[u]+d;
Q.push(v);
}
else if(dist[v]!=dist[u]+d){
return cout<<"No\n",0;
}
}
}
}
cout<<"Yes\n";
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct Edge{
int to;
ll D;
};
vector<Edge> G[100000];
ll X[100000];
int vis[100000];
bool ok = 1;
void dfs(int v){
vis[v] = 1;
for(auto e : G[v]){
if(vis[e.to]){
if(X[v] + e.D != X[e.to]) ok = 0;
}
else{
X[e.to] = X[v] + e.D;
dfs(e.to);
}
}
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
#ifdef LOCAL
std::ifstream in("in");
std::cin.rdbuf(in.rdbuf());
#endif
int N, M;
cin >> N >> M;
for(int i = 0; i < M; i++){
int L, R, D;
cin >> L >> R >> D;
L--, R--;
G[L].push_back({ R, D });
G[R].push_back({ L, -D });
}
for(int i = 0; i < N; i++){
if(vis[i]) continue;
X[i] = 0;
dfs(i);
}
if(ok){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
}
|
#include "bits/stdc++.h"
using namespace std;
int N, M;
vector<pair<int,int>>adj[100005];
int dist[100005];
bool vis[100005];
bool dfs(int u, int cur){
if(vis[u]){
if(dist[u] != cur)
return 0;
return 1;
}
vis[u] = 1;
dist[u] = cur;
bool ret = 1;
for(auto v : adj[u])ret &= dfs(v.first, cur + v.second);
return ret;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> N >> M;
while(M--){
int u, v, w;
cin >> u >> v >> w;
adj[u].push_back(make_pair(v,w));
adj[v].push_back(make_pair(u,-w));
}
bool f = 1;
for(int i = 1; i <= N; i++)if(!vis[i])f &= dfs(i,0);
cout << ( f ? "Yes\n" : "No\n");
}
|
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int>> g[100005];
vector<long long> dist(100005, 1LL << 60);
int n, m;
void dfs(int x) {
for (auto &p : g[x]) {
int to = p.first;
long long d = p.second;
if (dist[to] != 1LL << 60) {
if (dist[to] != dist[x] + d) {
cout << "No" << endl;
exit(0);
}
continue;
}
dist[to] = dist[x] + d;
dfs(to);
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
for (int i = 0; i < m; i++) {
int l, r, d;
cin >> l >> r >> d;
l--, r--;
g[l].emplace_back(r, d);
g[r].emplace_back(l, -d);
}
for (int i = 0; i < n; i++) {
if (dist[i] != 1LL << 60) continue;
dist[i] = 0;
dfs(i);
}
cout << "Yes" << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int N,M;
bool d[100001];
int v[100001];
vector<pair<int,int>>e[100001];
void dfs(int i,int x){
d[i]=true;
v[i]=x;
for(auto a:e[i]){
if(d[a.first]){
if(v[i]+a.second!=v[a.first]){
cout<<"No";
exit(0);
}
}else{
dfs(a.first,v[i]+a.second);
}
}
}
int main(){
cin>>N>>M;
for(int i=0;i<M;++i){
int L,R,D;
cin>>L>>R>>D;
e[L].push_back({R,D});
e[R].push_back({L,-D});
}
for(int i=1;i<=N;++i){
if(!d[i]){
dfs(i,0);
}
}
cout<<"Yes";
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
vector < pair <int, long long> > g[N];
bool used[N];
long long d[N];
long long mx;
void dfs(int x) {
used[x] = 1;
for (auto &e : g[x]) {
int to = e.first;
int dist = e.second;
if (used[to] && d[to] != d[x] + dist) {
puts("No");
exit(0);
} else if (!used[to]) {
d[to] = d[x] + dist;
mx = max(mx, d[to]);
dfs(to);
}
}
}
int main() {
int n, m;
scanf("%d %d", &n, &m);
int st = 0;
for (int i = 0; i < m; ++i) {
int x, y, z;
scanf("%d %d %d", &x, &y, &z);
g[x].push_back({y, z});
g[y].push_back({x, -z});
st = x;
}
mx = -1;
for (int i = 1; i <= n; ++i) {
if (!used[i]) {
++mx;
dfs(i);
}
}
puts("Yes");
return 0;
} |
#include <bits/stdc++.h>
const int M = 2e5+10;
int f[M];
int d[M];
int find(int x) {
if(f[x] == -1) return x;
int fa = f[x];
f[x] = find(fa);
d[x] += d[fa];
return f[x];
}
int main() {
int n, m;
scanf("%d%d", &n, &m);
memset(f, -1, sizeof(f));
bool flag = true;
for(int i = 0; i < m; i ++) {
int u, v, w;
scanf("%d%d%d", &u, &v, &w);
u --, v --;
int fa = find(u);
int fb = find(v);
// printf("%d %d\n", fa, fb);
if(fa == fb) {
if(d[v]-d[u] != w) flag = false;
} else {
f[fb] = fa;
d[fb] = d[u] - d[v] + w;
}
}
if(flag) puts("Yes");
else puts("No");
}
|
#include<bits/stdc++.h>
using namespace std;
int N,M;
bool d[100001];
int v[100001];
vector<pair<int,int>>e[100001];
void dfs(int i){
d[i]=true;
for(auto a:e[i]){
if(d[a.first]){
if(v[i]+a.second!=v[a.first]){
cout<<"No";
exit(0);
}
}else{
v[a.first]=v[i]+a.second;
dfs(a.first);
}
}
}
int main(){
cin>>N>>M;
for(int i=0;i<M;++i){
int L,R,D;
cin>>L>>R>>D;
e[L].push_back({R,D});
e[R].push_back({L,-D});
}
for(int i=1;i<=N;++i){
if(!d[i]){
dfs(i);
}
}
cout<<"Yes";
}
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#define MAXN 100000
using namespace std;
int n,m;
int fa[MAXN+5],val[MAXN+5];
int find_fa(int x)
{
if(fa[x]==x)
return x;
int dad=find_fa(fa[x]);
val[x]+=val[fa[x]];
fa[x]=dad;
return dad;
}
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
fa[i]=i;
int l,r,va;
for(int i=1;i<=m;i++)
{
scanf("%d%d%d",&l,&r,&va);
int fl=find_fa(l),fr=find_fa(r);
if(fl==fr)
{
int t=val[r]-val[l];
if(-t!=va)
{
printf("No\n");
return 0;
}
}
else
{
fa[fr]=fl;
val[fr]=-va+val[l]-val[r];
}
}
printf("Yes");
}
|
#include <bits/stdc++.h>
using namespace std;
#define BUF (200005)
#define ll long long
int n,m;
vector<pair<int,int>> e[BUF];
int used[BUF];
int pos[BUF];
int dfs(int nd){
vector<int> next;
for(auto x:e[nd]){
if(used[x.first]==0){
used[x.first]=1;
pos[x.first]=pos[nd]+x.second;
next.push_back(x.first);
}else{
if(pos[x.first]!=pos[nd]+x.second) return -1;
}
}
int ret=0;
for(auto x:next){
if(dfs(x)<0)ret = -1;
}
return ret;
}
int main(void){
cin >> n >> m;
for(int i=1;i<=m;i++){
pair<int,int> p;
int l,r,d;
cin >> l >> r >> d;
p.first=r;
p.second=d;
e[l].push_back(p);
p.first=l;
p.second=-d;
e[r].push_back(p);
}
for(int i=1;i<=n;i++){
if(used[i]==0){
if(dfs(i)<0){
cout << "No\n";
return 0;
}
}
}
cout << "Yes\n";
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
ll n, m;
vector<pair<ll, ll>> v[100000];
bool used[100000];
ll koko[100000];
bool dfs(ll now){
bool ret = 1;
for(pair<ll, ll> next : v[now]){
if(used[next.first]){
if(koko[next.first] != koko[now] + next.second) return false;
}else{
used[next.first] = 1;
koko[next.first] = koko[now] + next.second;
ret &= dfs(next.first);
}
}
return ret;
}
int main(){
cin >> n >> m;
for(ll i = 0; i < m; i++){
ll l, r, d; cin >> l >> r >> d;
v[--l].push_back(pair<ll, ll>(--r, d));
v[r].push_back(pair<ll, ll>(l, -d));
}
bool ans = 1;
for(ll i = 0; i < n; i++){
if(!used[i]){
used[i] = 1;
}
ans &= dfs(i);
}
cout << (ans ? "Yes\n" : "No\n");
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int father[100500];
int dis[100500];
int find_father(int x) {
if(father[x]==x)return x;
int a1=father[x];
int a2=find_father(father[x]);
father[x]=a2;
dis[x]=dis[x]+dis[a1];
return a2;
}
int find_dis(int x) {
if(father[x]==x)return 0;
return find_dis(father[x])+dis[x];
}
int main(void) {
int num,cas,L,R,D;
cin>>num>>cas;
for(int i=0; i<=num; i++) {
father[i]=i;
dis[i]=0;
}
while(cas--) {
cin>>L>>R>>D;
int fl=find_father(L);
int fr=find_father(R);
if(fl==fr) {
if(dis[L]+D!=dis[R]) {
cout<<"No"<<endl;
return 0;
}
} else {
father[fr]=fl;
dis[fr]=find_dis(L)-find_dis(R)+D;
}
}
cout<<"Yes"<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int maxn=112345;
int n,m,l,r,x,f[maxn],d[maxn];
int F(int x) {
if (x==f[x]) return x;
int fa=f[x];
f[x]=F(f[x]);
d[x]+=d[fa];
return f[x];
}
inline bool U(int a,int b,int l) {
int fa=F(a),fb=F(b);
if (fa==fb) {
if (d[b]-d[a]!=l) return false;
return true;
}
d[fa]=-d[a]+d[b]-l;
f[fa]=fb;
return true;
}
int main()
{
scanf("%d%d",&n,&m);
for (int i=1;i<=n;++i) f[i]=i;
for (int i=1;i<=m;++i) {
scanf("%d%d%d",&l,&r,&x);
if (!U(r,l,x)) {
puts("No");
return 0;
}
}
puts("Yes");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
const int MAXN = 2e5 + 5;
int N, M;
vector <pii> E[MAXN];
int l[MAXN], r[MAXN], d[MAXN];
bool bio[MAXN];
ll x[MAXN];
void load() {
scanf("%d%d", &N, &M);
for (int i = 0; i < M; i++) {
scanf("%d%d%d", l + i, r + i, d + i);
E[l[i]].push_back({r[i], d[i]});
E[r[i]].push_back({l[i], -d[i]});
}
}
void dfs(int node, ll curr) {
bio[node] = true;
x[node] = curr;
for (auto it : E[node])
if (!bio[it.first])
dfs(it.first, curr + it.second);
}
bool solve() {
for (int i = 1; i <= N; i++)
if (!bio[i])
dfs(i, 0);
for (int i = 0; i < M; i++)
if (x[r[i]] - x[l[i]] != d[i])
return false;
return true;
}
int main() {
load();
puts(solve() ? "Yes" : "No");
return 0;
} |
#include <iostream>
using namespace std;
typedef long long ll;
ll n,m,l,r,d,fa[200001],ra[200001],diff_weight[200001];
ll find(ll x){
if(fa[x]==x)return x;
ll xx=find(fa[x]);
diff_weight[x]+=diff_weight[fa[x]];
return fa[x]=xx;
}
ll weight(ll x){
find(x);
return diff_weight[x];
}
bool uni(ll x,ll y,ll w){
w+=weight(x),w-=weight(y);
x=find(x);
y=find(y);
if(x==y)return false;
if(ra[x]<ra[y]){swap(x,y);w=-w;}
fa[y]=x;
if(ra[x]==ra[y])ra[x]++;
diff_weight[y]=w;
return true;
}
int main(void){
cin>>n>>m;
for(int i=1;i<=n;i++)fa[i]=i;
for(int i=0;i<m;i++){
cin>>l>>r>>d;
if(find(l)!=find(r))uni(l,r,d);
else{
if(weight(r)-weight(l)!=d){cout<<"No"<<endl;return 0;}
}
}
cout<<"Yes"<<endl;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
vector<pair<int,int> >G[1<<17];
int n,m;
long x[1<<17];bool used[1<<17];
bool dfs(int u,int p)
{
used[u]=1;
for(int i=0;i<G[u].size();i++)
{
if(G[u][i].first==p)continue;
if(used[G[u][i].first]&&x[G[u][i].first]!=x[u]+G[u][i].second)return false;
else if(!used[G[u][i].first])
{
x[G[u][i].first]=x[u]+G[u][i].second;
if(!dfs(G[u][i].first,u))return false;
}
}
return true;
}
int main()
{
cin>>n>>m;
for(int i=0;i<m;i++)
{
int l,r,d;cin>>l>>r>>d;
G[l].push_back(make_pair(r,d));
G[r].push_back(make_pair(l,-d));
}
for(int i=1;i<=n;i++)
{
if(!used[i])x[i]=0;
if(!dfs(i,0))
{
cout<<"No"<<endl;
return 0;
}
}
cout<<"Yes"<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+5;
ll n,m,fa[N],a[N];
int find(int x)
{
if(x==fa[x])
return x;
int t=fa[x];
int ft=find(t);
a[x]+=a[t];
return fa[x]=ft;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n>>m;
for(int i=1;i<=n;i++)
fa[i]=i,a[i]=0;
ll u,v,d;
bool ok=true;
while(m--)
{
cin>>u>>v>>d;
ll x=find(u),y=find(v);
if(x!=y)
{
if(x>y)
{
fa[x]=y;
a[x]=a[v]-(a[u]+d);
}
else
{
fa[y]=x;
a[y]=a[u]-(a[v]-d);
}
}
else
{
ll t=a[v]-a[u];
if(t!=d)
ok=false;
}
}
for(int i=1;i<=n;i++)
{
find(i);
if(a[i]>1e9)
ok=false;
}
puts(ok?"Yes":"No");
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int N,M;
pair<bool,int>v[100001];
vector<pair<int,int>>e[100001];
void dfs(int i,int x){
v[i]={true,x};
for(auto a:e[i]){
if(v[a.first].first){
if(v[i].second+a.second!=v[a.first].second){
cout<<"No";
exit(0);
}
}else{
dfs(a.first,v[i].second+a.second);
}
}
}
int main(){
cin>>N>>M;
for(int i=0;i<M;++i){
int L,R,D;
cin>>L>>R>>D;
e[L].push_back({R,D});
e[R].push_back({L,-D});
}
for(int i=1;i<=N;++i){
if(!v[i].first){
dfs(i,0);
}
}
cout<<"Yes";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int n, m;
cin >> n >> m;
vector<vector<pair<int,int>>> edges(n);
for(int i = 0; i < m; i++){
int l, r, d;
cin >> l >> r >> d;
l--; r--;
edges[l].emplace_back(r, d);
edges[r].emplace_back(l, -d);
}
vector<int> done(n);
vector<int> x(n);
for(int i = 0; i < n; i++){
if(done[i]) continue;
done[i] = 1;
vector<int> bfs{i};
for(int s = 0; s < int(bfs.size()); s++){
int v = bfs[s];
for(auto z : edges[v]){
int w = z.first;
int nx = z.second + x[v];
if(!done[w]){
done[w] = 1;
x[w] = nx;
bfs.push_back(w);
} else if(x[w] != nx){
cout << "No" << '\n';
exit(0);
}
}
}
}
cout << "Yes" << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
int n, m, L[200010], R[200010], D[200010];
long long ans[maxn];
vector<pair<int, int>> G[maxn];
bool used[maxn];
void dfs(int v) {
used[v] = 1;
for (auto p : G[v]) {
if (used[p.first]) continue;
ans[p.first] = ans[v] + p.second, dfs(p.first);
}
}
int main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= m; i++) {
scanf("%d %d %d", &L[i], &R[i], &D[i]);
G[L[i]].push_back({R[i], D[i]});
G[R[i]].push_back({L[i], -D[i]});
}
for (int i = 1; i <= n; i++) {
if (!used[i]) dfs(i);
}
for (int i = 1; i <= m; i++) {
if (ans[R[i]] - ans[L[i]] != D[i]) printf("No\n"), exit(0);
}
printf("Yes\n");
return 0;
} |
#include <bits/stdc++.h>
#define x first
#define y second
#define pb push_back
#define Set(i, v) memset(i, v, sizeof i)
#define For(i, j, k) for(int i = j; i <= k; i++)
#define Forr(i, j, k) for(int i = j; i >= k; i--)
typedef long long LL;
using namespace std;
const int N = 1e5 + 10;
int n, m;
int X[N];
bool vis[N];
vector<int> G[N], w[N];
void DFS(int o){
vis[o] = true;
For(i, 0, (int)G[o].size() - 1){
int v = G[o][i], d = w[o][i];
if(vis[v] && X[v] != X[o] + d){
puts("No");
exit(0);
}
else if(!vis[v]){
X[v] = X[o] + d;
DFS(v);
}
}
}
int main(){
scanf("%d%d", &n, &m);
For(i, 1, m){
int u, v, d;
scanf("%d%d%d", &u, &v, &d);
G[u].pb(v), G[v].pb(u);
w[u].pb(d), w[v].pb(-d);
}
For(i, 1, n) if(!vis[i]) DFS(i);
puts("Yes");
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
const int N=100005;
int read(){
int x=0,f=1; char ch=getchar();
while (ch<'0'||ch>'9'){if (ch=='-') f=-1; ch=getchar();}
while (ch>='0'&&ch<='9'){x=x*10+ch-'0'; ch=getchar();}
return x*f;
}
int f[N],d[N];
int find(int x){
if (x==f[x]) return x;
int fa=find(f[x]);
d[x]=d[x]+d[f[x]];
return f[x]=fa;
}
int main(){
int n=read(),m=read();
for (int i=1;i<=n;i++){
d[i]=0; f[i]=i;
}
bool pd=0;
while (m--){
int l=read(),r=read(),v=read();
int fl=find(l),fr=find(r);
if (fl==fr){
if (d[l]-d[r]!=v) pd=1;
}else{
f[fl]=fr;
d[fl]=v+d[r]-d[l];
}
}
if (pd==1) printf("No\n");
else printf("Yes\n");
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.