oj.uz

답안 #1013415

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1013415 2024-07-03T14:04:07 Z kunzaZa183 마술쇼 (APIO24_show) C++17
100 / 100
 3 ms 1200 KB 
#include "Alice.h"

#include <bits/stdc++.h>
using namespace std;
const int n = 5000;

// you may define some global variables, but it does not work if you try to
// transfer any information from function Alice() to function Bob() through
// these variables. you had better not use the same global variables in function
// Alice() and in function Bob().

vector<pair<int, int>> Alice() {
  // add your code here

  // change below into your code
  long long x = setN(n);
  vector<pair<int, int>> vpii;
  for (int i = 1; i < n; i++) 
    vpii.emplace_back(i + 1, x % i + 1);
  return vpii;
}

#include "Bob.h"

#include <bits/stdc++.h>
using namespace std;

// you may define some global variables, but it does not work if you try to
// transfer any information from function Alice() to function Bob() through
// these variables. you had better not use the same global variables in function
// Alice() and in function Bob().

long long Bob(vector<pair<int, int>> V) {
  for (auto &a : V) {
    if (a.first > a.second) swap(a.first, a.second);
    a.first--, a.second--;
  }
  // cout << "Edges\n";
  // for (auto a : V) cout << a.first << ' ' << a.second << "\n";

  unsigned long long jump = 1;
  int in = 0;
  unsigned long long x = 0;
  for (x = 0; x <= 1e18; x += jump) {
    // cout << x << ' ' << in << ' ' << jump << "\n";
    while (in < V.size()) {
      if (x % V[in].second == V[in].first) {
        if (jump <= 1e15) jump = jump / gcd(jump, V[in].second) * V[in].second;
        in++;
      } else
        break;
    }
    if (in >= V.size()) break;
  }
  for(auto a:V)
    if(x % a.second != a.first)
      while(1)
      {

      }
  return x;
}

Compilation message

Bob.cpp: In function 'long long int Bob(std::vector<std::pair<int, int> >)':
Bob.cpp:24:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |     while (in < V.size()) {
      |            ~~~^~~~~~~~~~
Bob.cpp:25:28: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'int' [-Wsign-compare]
   25 |       if (x % V[in].second == V[in].first) {
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
Bob.cpp:31:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |     if (in >= V.size()) break;
      |         ~~~^~~~~~~~~~~
Bob.cpp:34:21: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'int' [-Wsign-compare]
   34 |     if(x % a.second != a.first)
      |        ~~~~~~~~~~~~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 820 KB Correct.
2 Correct 1 ms 820 KB Correct.
3 Correct 1 ms 832 KB Correct.
4 Correct 1 ms 820 KB Correct.
5 Correct 1 ms 816 KB Correct.
6 Correct 2 ms 820 KB Correct.
7 Correct 1 ms 832 KB Correct.
8 Correct 1 ms 820 KB Correct.
9 Correct 1 ms 832 KB Correct.
10 Correct 1 ms 832 KB Correct.
11 Correct 1 ms 820 KB Correct.
12 Correct 2 ms 1200 KB Correct.

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 820 KB Correct.
2 Correct 1 ms 820 KB Correct.
3 Correct 1 ms 832 KB Correct.
4 Correct 1 ms 820 KB Correct.
5 Correct 1 ms 816 KB Correct.
6 Correct 2 ms 820 KB Correct.
7 Correct 1 ms 832 KB Correct.
8 Correct 1 ms 820 KB Correct.
9 Correct 1 ms 832 KB Correct.
10 Correct 1 ms 832 KB Correct.
11 Correct 1 ms 820 KB Correct.
12 Correct 2 ms 1200 KB Correct.
13 Correct 2 ms 824 KB Correct.
14 Correct 2 ms 820 KB Correct.
15 Correct 3 ms 820 KB Correct.
16 Correct 1 ms 832 KB Correct.
17 Correct 1 ms 928 KB Correct.
18 Correct 1 ms 820 KB Correct.
19 Correct 2 ms 900 KB Correct.
20 Correct 1 ms 820 KB Correct.
21 Correct 1 ms 820 KB Correct.
22 Correct 1 ms 820 KB Correct.
23 Correct 1 ms 820 KB Correct.
24 Correct 2 ms 820 KB Correct.

Subtask #3
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 820 KB Correct.
2 Correct 1 ms 820 KB Correct.
3 Correct 1 ms 832 KB Correct.
4 Correct 1 ms 820 KB Correct.
5 Correct 1 ms 816 KB Correct.
6 Correct 2 ms 820 KB Correct.
7 Correct 1 ms 832 KB Correct.
8 Correct 1 ms 820 KB Correct.
9 Correct 1 ms 832 KB Correct.
10 Correct 1 ms 832 KB Correct.
11 Correct 1 ms 820 KB Correct.
12 Correct 2 ms 1200 KB Correct.
13 Correct 2 ms 824 KB Correct.
14 Correct 2 ms 820 KB Correct.
15 Correct 3 ms 820 KB Correct.
16 Correct 1 ms 832 KB Correct.
17 Correct 1 ms 928 KB Correct.
18 Correct 1 ms 820 KB Correct.
19 Correct 2 ms 900 KB Correct.
20 Correct 1 ms 820 KB Correct.
21 Correct 1 ms 820 KB Correct.
22 Correct 1 ms 820 KB Correct.
23 Correct 1 ms 820 KB Correct.
24 Correct 2 ms 820 KB Correct.
25 Correct 2 ms 820 KB Correct.
26 Correct 2 ms 820 KB Correct.
27 Correct 2 ms 820 KB Correct.
28 Correct 2 ms 820 KB Correct.
29 Correct 2 ms 820 KB Correct.
30 Correct 1 ms 820 KB Correct.
31 Correct 1 ms 820 KB Correct.
32 Correct 2 ms 824 KB Correct.
33 Correct 1 ms 820 KB Correct.
34 Correct 1 ms 820 KB Correct.
35 Correct 1 ms 820 KB Correct.
36 Correct 1 ms 820 KB Correct.
37 Correct 1 ms 820 KB Correct.
38 Correct 2 ms 820 KB Correct.
39 Correct 1 ms 820 KB Correct.
40 Correct 1 ms 820 KB Correct.
41 Correct 2 ms 908 KB Correct.
42 Correct 2 ms 820 KB Correct.
43 Correct 1 ms 828 KB Correct.
44 Correct 2 ms 824 KB Correct.