oj.uz

답안 #1101867

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1101867 2024-10-17T05:27:45 Z simona1230 Toll (BOI17_toll) C++17
7 / 100
 74 ms 15796 KB 
// Online C++ compiler to run C++ program online
#include <bits/stdc++.h>
using namespace std;
int k,n,m,o;
vector<pair<int,int> > v[200001],op[200001];
void read()
{
    cin>>k>>n>>m>>o;
    for(int i=1;i<=m;i++)
    {
        int a,b,t;
        cin>>a>>b>>t;
        v[a].push_back({b,t});
        op[b].push_back({a,t});
    }
}


pair<int,int> q[200001];

long long p[200001];

void subt1()
{
    for(int i=0;i<n;i++)
    {
        p[i+1]=1e9;
        for(int j=0;j<v[i].size();j++)
        {
            long long nb=v[i][j].second;
            p[i+1]=min(p[i+1],nb);
        }
        p[i+1]+=p[i];
    }
    
    for(int i=1;i<=o;i++)
        if(p[q[i].second]-p[q[i].first]<1e9)cout<<p[q[i].second]-p[q[i].first]<<endl;
        else cout<<-1<<endl;
    exit(0);
}

int dp[200001];

void subt2()
{
    for(int i=1;i<n;i++)
    {
        dp[i]=1e9;
        for(int j=0;j<op[i].size();j++)
        {
            pair<int,int> nb=op[i][j];
            dp[i]=min(dp[i],dp[nb.first]+nb.second);
        }
    }
    
    for(int i=1;i<=o;i++)
        cout<<dp[q[i].second]<<endl;
}

int lf=0;
void solve()
{
    for(int i=1;i<=o;i++)
    {
        cin>>q[i].first>>q[i].second;
        lf=min(lf,q[i].first);
    }
    
    if(k==1)subt1();
    if(lf==1)subt2();
    
    
}

int main() {
    read();
    solve();
    return 0;
}

Compilation message

toll.cpp: In function 'void subt1()':
toll.cpp:28:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |         for(int j=0;j<v[i].size();j++)
      |                     ~^~~~~~~~~~~~
toll.cpp: In function 'void subt2()':
toll.cpp:49:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |         for(int j=0;j<op[i].size();j++)
      |                     ~^~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 15052 KB Output is correct
2 Correct 3 ms 11520 KB Output is correct
3 Correct 3 ms 11348 KB Output is correct
4 Correct 3 ms 11348 KB Output is correct
5 Correct 5 ms 11604 KB Output is correct
6 Correct 5 ms 11604 KB Output is correct
7 Correct 5 ms 11604 KB Output is correct
8 Correct 51 ms 15796 KB Output is correct
9 Correct 57 ms 15704 KB Output is correct
10 Correct 21 ms 12216 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 74 ms 14408 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 11344 KB Output is correct
2 Incorrect 3 ms 11348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 11344 KB Output is correct
2 Incorrect 3 ms 11348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 15052 KB Output is correct
2 Correct 3 ms 11520 KB Output is correct
3 Correct 3 ms 11348 KB Output is correct
4 Correct 3 ms 11348 KB Output is correct
5 Correct 5 ms 11604 KB Output is correct
6 Correct 5 ms 11604 KB Output is correct
7 Correct 5 ms 11604 KB Output is correct
8 Correct 51 ms 15796 KB Output is correct
9 Correct 57 ms 15704 KB Output is correct
10 Correct 21 ms 12216 KB Output is correct
11 Incorrect 74 ms 14408 KB Output isn't correct
12 Halted 0 ms 0 KB -