oj.uz

Submission #166761

# Submission time Handle Problem Language Result Execution time Memory
166761 2019-12-03T20:20:30 Z theStaticMind Ceste (COCI17_ceste) C++14
80 / 160
 2500 ms 26872 KB 
#include<bits/stdc++.h>
#define ii pair<int,int>
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define INF 100000000000000000
#define int long long int
#define modulo 1000000007
using namespace std;
struct data{
      mutable int time,cost;
      data(int x,int y):time(x),cost(y){}
      bool operator<(const data& A)const{
            return time<A.time;
      }
};
struct Cont : set<data>{
      void add(data A){
            if(empty()){
                  insert(A);
                  return;
            }
            iterator pre=upper_bound(A);
            if(pre!=begin()){
                  pre--;
                  if(pre->cost<=A.cost)return;
                  if(pre->time==A.time&&pre->cost>A.cost)erase(pre);
            }
            iterator curr=insert(A).first;
            iterator next=curr;
            next++;
            while(next!=end()&&next->cost>=A.cost)next=erase(next);
      }
};
vector<Cont> val(2002);
vector<int>adj[2002];
vector<pair<ii,ii>>edge;
int32_t main(){
      ios_base::sync_with_stdio(false);
      cin.tie(NULL);
  //    freopen("q.gir","r",stdin);
  //    freopen("q.cik","w",stdout);
      int n,m;
      cin>>n>>m;
      for(int i=0;i<m;i++){
            int x,y,t,c;
            cin>>x>>y>>t>>c;
            edge.pb({{x,y},{t,c}});
      }
      val[1].add(data(0,0));
      for(int q=0;q<=n;q++){
            for(int i=0;i<m;i++){
                  int x,y,t,c;
                  x=edge[i].first.first,y=edge[i].first.second;
                  t=edge[i].second.first,c=edge[i].second.second;
                  for(Cont::iterator itr=val[x].begin();itr!=val[x].end();itr++){
                        val[y].add(data(itr->time+t,itr->cost+c));
                  }
                  swap(x,y);
                  for(Cont::iterator itr=val[x].begin();itr!=val[x].end();itr++){
                        val[y].add(data(itr->time+t,itr->cost+c));
                  }
            }
      }
      for(int i=2;i<=n;i++){
            if(val[i].empty())cout<<-1<<"\n";
            else {
                  int ans=INF;
                  for(Cont::iterator itr=val[i].begin();itr!=val[i].end();itr++){
                        ans=min(ans,itr->time*itr->cost);
                  }
                  cout<<ans<<"\n";
            }
      }
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 632 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 640 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 167 ms 732 KB Output is correct
2 Correct 265 ms 760 KB Output is correct
3 Correct 103 ms 632 KB Output is correct

Subtask #6
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1141 ms 1792 KB Output is correct
2 Correct 1631 ms 1916 KB Output is correct
3 Execution timed out 2538 ms 1144 KB Time limit exceeded

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2530 ms 24704 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2553 ms 6168 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2558 ms 16304 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2535 ms 26872 KB Time limit exceeded
2 Halted 0 ms 0 KB -