Submission #2887956

---

Source Code Expand

#include<bits/stdc++.h>
#define INF 20000000001
using namespace std;
struct edge{
  int to,cost_y,cost_s;
};

int main(){
  long long int n,m,s,t;
  cin>>n>>m>>s>>t;
  vector<edge> edges[n];
  for(int i=0;i<n;i++){
    edge e={i,0,0};
    edges[i].push_back(e);
  }
  cout<<"is TLE happened?"<<endl;
  //cout<<&edges[0]<<","<<&edges[1]<<endl;
  int u[m],v[m],a[m],b[m];

  for(int i=0;i<m;i++){
    cin>>u[i]>>v[i]>>a[i]>>b[i];
    edge e1={u[i]-1,a[i],b[i]};
    edges[v[i]-1].push_back(e1);
    edge e2={v[i]-1,a[i],b[i]};
    edges[u[i]-1].push_back(e2);

}
//cout<<n<<endl;
  for(int i=0;i<n;i++){
    for(edge e:edges[i]){
      cout<<i<<","<<e.to<<","<<e.cost_s<<","<<e.cost_y<<endl;
    }
  }
vector<int> s_cost_s;
vector<int> q;
for(int i=0;i<n;i++){
  q.push_back(i);
  s_cost_s.push_back((i==s-1)? INF : 0);
}
while (!q.empty()){
  q.pop_back();

}
}

Submission Info

Judge Result