oj.uz

Submission #9140

# Submission time Handle Problem Language Result Execution time Memory
9140 2014-09-27T17:46:02 Z dolpang2 Penalty calculation (kriii2_PE) C++
4 / 4
 0 ms 1236 KB 
#include <algorithm>
#include <cstdio>
#include <vector>

const size_t kMaxNumberOfSubmit = 100;

struct SubmitInfo {
  int number_of_submit;
  int time_of_submit;
  int score_of_submit;

  bool operator <(const SubmitInfo& a) const {
    if (this->score_of_submit > a.score_of_submit) {
      return true;
    }
    else if (this->score_of_submit == a.score_of_submit) {
      if (this->number_of_submit < a.number_of_submit) {
        return true;
      }
    }
    return false;
  }
};

int main() {
  int number_of_submit = 0;
  std::vector<SubmitInfo> bundle_of_submit_info;

  scanf(" %d", &number_of_submit);
  for (int i = 0; i < number_of_submit; ++i) {
    SubmitInfo submit_info;
    submit_info.number_of_submit = i + 1;
    scanf(" %d %d", &submit_info.time_of_submit, &submit_info.score_of_submit);
    bundle_of_submit_info.push_back(submit_info);
  }
  std::sort(bundle_of_submit_info.begin(), bundle_of_submit_info.end());
  const int f = bundle_of_submit_info.at(0).number_of_submit;

  if (bundle_of_submit_info.at(0).score_of_submit == 0) {
    printf("%d\n", 0);
  }
  else {
    printf("%d\n", bundle_of_submit_info.at(0).time_of_submit + (f - 1) * 20);
  }
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1236 KB Output is correct
2 Correct 0 ms 1236 KB Output is correct
3 Correct 0 ms 1236 KB Output is correct
4 Correct 0 ms 1236 KB Output is correct
5 Correct 0 ms 1236 KB Output is correct
6 Correct 0 ms 1236 KB Output is correct
7 Correct 0 ms 1236 KB Output is correct
8 Correct 0 ms 1236 KB Output is correct
9 Correct 0 ms 1236 KB Output is correct
10 Correct 0 ms 1236 KB Output is correct
11 Correct 0 ms 1236 KB Output is correct
12 Correct 0 ms 1236 KB Output is correct
13 Correct 0 ms 1236 KB Output is correct
14 Correct 0 ms 1236 KB Output is correct
15 Correct 0 ms 1236 KB Output is correct
16 Correct 0 ms 1236 KB Output is correct
17 Correct 0 ms 1236 KB Output is correct
18 Correct 0 ms 1236 KB Output is correct
19 Correct 0 ms 1236 KB Output is correct
20 Correct 0 ms 1236 KB Output is correct
21 Correct 0 ms 1236 KB Output is correct
22 Correct 0 ms 1236 KB Output is correct
23 Correct 0 ms 1236 KB Output is correct
24 Correct 0 ms 1236 KB Output is correct
25 Correct 0 ms 1236 KB Output is correct
26 Correct 0 ms 1236 KB Output is correct
27 Correct 0 ms 1236 KB Output is correct
28 Correct 0 ms 1236 KB Output is correct
29 Correct 0 ms 1236 KB Output is correct
30 Correct 0 ms 1236 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1236 KB Output is correct
2 Correct 0 ms 1236 KB Output is correct
3 Correct 0 ms 1236 KB Output is correct
4 Correct 0 ms 1236 KB Output is correct
5 Correct 0 ms 1236 KB Output is correct
6 Correct 0 ms 1236 KB Output is correct
7 Correct 0 ms 1236 KB Output is correct
8 Correct 0 ms 1236 KB Output is correct
9 Correct 0 ms 1236 KB Output is correct
10 Correct 0 ms 1236 KB Output is correct
11 Correct 0 ms 1236 KB Output is correct
12 Correct 0 ms 1236 KB Output is correct
13 Correct 0 ms 1236 KB Output is correct
14 Correct 0 ms 1236 KB Output is correct
15 Correct 0 ms 1236 KB Output is correct
16 Correct 0 ms 1236 KB Output is correct
17 Correct 0 ms 1236 KB Output is correct
18 Correct 0 ms 1236 KB Output is correct
19 Correct 0 ms 1236 KB Output is correct
20 Correct 0 ms 1236 KB Output is correct
21 Correct 0 ms 1236 KB Output is correct
22 Correct 0 ms 1236 KB Output is correct
23 Correct 0 ms 1236 KB Output is correct
24 Correct 0 ms 1236 KB Output is correct
25 Correct 0 ms 1236 KB Output is correct
26 Correct 0 ms 1236 KB Output is correct
27 Correct 0 ms 1236 KB Output is correct
28 Correct 0 ms 1236 KB Output is correct
29 Correct 0 ms 1236 KB Output is correct
30 Correct 0 ms 1236 KB Output is correct