oj.uz

Submission #132725

# Submission time Handle Problem Language Result Execution time Memory
132725 2019-07-19T11:55:32 Z cfalas Dreaming (IOI13_dreaming) C++14
0 / 100
 33 ms 2552 KB 
#include "dreaming.h"
#include<bits/stdc++.h>
using namespace std;

int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
    long long ans=0;
    for(int i=0;i<M;i++){
        ans+=T[i];
    }
    ans-=(N-M-1)*L;
    return ans;
}

/*int main(){
    int n, m, l;
    cin>>n>>m>>l;

    int a[m], b[m], t[m];
    for(int i=0;i<m;i++){
        cin>>a[i]>>b[i]>>t[i];
    }
    cout<<travelTime(n, m, l, a, b, t)<<endl;
}*/

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 2552 KB Output is correct
2 Correct 32 ms 2552 KB Output is correct
3 Incorrect 24 ms 2040 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 2552 KB Output is correct
2 Correct 32 ms 2552 KB Output is correct
3 Incorrect 24 ms 2040 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 2552 KB Output is correct
2 Correct 32 ms 2552 KB Output is correct
3 Incorrect 24 ms 2040 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 1116 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 2552 KB Output is correct
2 Correct 32 ms 2552 KB Output is correct
3 Incorrect 24 ms 2040 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 2552 KB Output is correct
2 Correct 32 ms 2552 KB Output is correct
3 Incorrect 24 ms 2040 KB Output isn't correct
4 Halted 0 ms 0 KB -