# | Submission time^{} |
Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|

162586 | 2019-11-08T20:38:46 Z | Mounir | Stove (JOI18_stove) | C++14 | 110 ms | 1528 KB |

#include <iostream> #include <algorithm> #include <vector> #include <cmath> using namespace std; int main(){ int nInvites, nInters; cin >> nInvites >> nInters; vector<int> pos(nInvites), ecart(nInvites - 1); for (int& posCur : pos) cin >> posCur; for (int iInvite = 0; iInvite < nInvites - 1; ++iInvite) ecart[iInvite] = pos[iInvite + 1] - pos[iInvite]; sort(ecart.begin(), ecart.end()); int res = nInvites; for (int iAjout = 0; iAjout < nInvites - nInters; ++iAjout) res += ecart[iAjout] - 1; cout << res << endl; return 0; }

# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|

1 | Correct | 2 ms | 376 KB | Output is correct |

2 | Correct | 2 ms | 256 KB | Output is correct |

3 | Correct | 2 ms | 376 KB | Output is correct |

4 | Correct | 2 ms | 256 KB | Output is correct |

5 | Correct | 2 ms | 376 KB | Output is correct |

6 | Correct | 2 ms | 376 KB | Output is correct |

7 | Correct | 2 ms | 376 KB | Output is correct |

8 | Correct | 2 ms | 256 KB | Output is correct |

9 | Correct | 2 ms | 376 KB | Output is correct |

# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|

1 | Correct | 2 ms | 376 KB | Output is correct |

2 | Correct | 2 ms | 256 KB | Output is correct |

3 | Correct | 2 ms | 376 KB | Output is correct |

4 | Correct | 2 ms | 256 KB | Output is correct |

5 | Correct | 2 ms | 376 KB | Output is correct |

6 | Correct | 2 ms | 376 KB | Output is correct |

7 | Correct | 2 ms | 376 KB | Output is correct |

8 | Correct | 2 ms | 256 KB | Output is correct |

9 | Correct | 2 ms | 376 KB | Output is correct |

10 | Correct | 4 ms | 376 KB | Output is correct |

11 | Correct | 4 ms | 376 KB | Output is correct |

12 | Correct | 4 ms | 376 KB | Output is correct |

13 | Correct | 4 ms | 408 KB | Output is correct |

14 | Correct | 5 ms | 376 KB | Output is correct |

15 | Correct | 4 ms | 376 KB | Output is correct |

# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|

1 | Correct | 2 ms | 376 KB | Output is correct |

2 | Correct | 2 ms | 256 KB | Output is correct |

3 | Correct | 2 ms | 376 KB | Output is correct |

4 | Correct | 2 ms | 256 KB | Output is correct |

5 | Correct | 2 ms | 376 KB | Output is correct |

6 | Correct | 2 ms | 376 KB | Output is correct |

7 | Correct | 2 ms | 376 KB | Output is correct |

8 | Correct | 2 ms | 256 KB | Output is correct |

9 | Correct | 2 ms | 376 KB | Output is correct |

10 | Correct | 4 ms | 376 KB | Output is correct |

11 | Correct | 4 ms | 376 KB | Output is correct |

12 | Correct | 4 ms | 376 KB | Output is correct |

13 | Correct | 4 ms | 408 KB | Output is correct |

14 | Correct | 5 ms | 376 KB | Output is correct |

15 | Correct | 4 ms | 376 KB | Output is correct |

16 | Correct | 82 ms | 1400 KB | Output is correct |

17 | Correct | 82 ms | 1400 KB | Output is correct |

18 | Correct | 83 ms | 1400 KB | Output is correct |

19 | Correct | 83 ms | 1400 KB | Output is correct |

20 | Correct | 82 ms | 1400 KB | Output is correct |

21 | Correct | 110 ms | 1528 KB | Output is correct |

22 | Correct | 84 ms | 1144 KB | Output is correct |

23 | Correct | 83 ms | 1400 KB | Output is correct |

24 | Correct | 83 ms | 1160 KB | Output is correct |