QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#232971#7637. Exactly Three Neighborsnicksms#AC ✓1ms3708kbC++171.6kb2023-10-31 05:49:262023-10-31 05:49:27

Judging History

你现在查看的是最新测评结果

  • [2023-10-31 05:49:27]
  • 评测
  • 测评结果:AC
  • 用时:1ms
  • 内存:3708kb
  • [2023-10-31 05:49:26]
  • 提交

answer

/**
 *      Author:  Nicholas Winschel
 *      Created: 10.30.2023 13:59:23
**/

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using db=long double;
template<class T> using V=vector<T>;
using vi = V<int>;
using vl = V<ll>;
using pi = pair<int,int>;
#define f first
#define s second
#define sz(x) (int)((x).size())
#define each(a,b) for (auto &a : b)

int main() {
  cin.tie(0)->sync_with_stdio(0); // initialize fast I/O


  int p,q; cin >> p >> q;

  int g = gcd(p,q);
  p/=g, q/=g;
  if (p == 3 && q == 4) {
    cout << R"(4 4
.###
##.#
##.#
.###)" << "\n";
    return 0;
  }
  if (p == 7 && q == 10) {
    cout << R"(4 5
.###.
##.##
##.##
.###.)" << "\n";
    return 0;
  }
  if (p == 5 && q == 7) {
    cout << R"(4 14
.###.###.#####
##.###.###...#
##.###.###...#
.###.###.#####)" << "\n";
    return 0;
  }
  if (p == 4 && q == 5) {
    cout << R"(5 5
.####
##.##
####.
#.###
###.#)" << "\n";
    return 0;
  }
  
  if (p == 7 && q == 9) {
    cout << R"(6 18
##.####.##.####.##
.####.####.##.####
###.####.####.##.#
#.####.####.####.#
#.##.####.####.###
####.##.####.####.)" << "\n";
    return 0;
  }
  for (int x = 0; x < 100; x++)
    for (int y = 0; y < 100; y++) {
      if (!x && !y) continue;
      int b = 2*x;
      int w = x + y;
      int g = gcd(b,w);
      b/=g, w/=g;
      if (b == p && b+w == q) {
        cout << "1 " << 3*x + y << "\n";
        while (x--) cout << ".##";
        while (y--) cout << ".";
        cout << "\n";
        return 0;
      }
    }
  cout << "-1 -1\n";
  return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3540kb

input:

2 3

output:

1 3
.##

result:

ok good solution

Test #2:

score: 0
Accepted
time: 1ms
memory: 3704kb

input:

1 1

output:

-1 -1

result:

ok no solution

Test #3:

score: 0
Accepted
time: 0ms
memory: 3676kb

input:

3 4

output:

4 4
.###
##.#
##.#
.###

result:

ok good solution

Test #4:

score: 0
Accepted
time: 0ms
memory: 3552kb

input:

3 5

output:

1 10
.##.##.##.

result:

ok good solution

Test #5:

score: 0
Accepted
time: 0ms
memory: 3624kb

input:

4 5

output:

5 5
.####
##.##
####.
#.###
###.#

result:

ok good solution

Test #6:

score: 0
Accepted
time: 0ms
memory: 3608kb

input:

7 10

output:

4 5
.###.
##.##
##.##
.###.

result:

ok good solution

Test #7:

score: 0
Accepted
time: 0ms
memory: 3576kb

input:

5 7

output:

4 14
.###.###.#####
##.###.###...#
##.###.###...#
.###.###.#####

result:

ok good solution

Test #8:

score: 0
Accepted
time: 0ms
memory: 3616kb

input:

7 9

output:

6 18
##.####.##.####.##
.####.####.##.####
###.####.####.##.#
#.####.####.####.#
#.##.####.####.###
####.##.####.####.

result:

ok good solution

Test #9:

score: 0
Accepted
time: 0ms
memory: 3580kb

input:

0 1

output:

1 1
.

result:

ok good solution

Test #10:

score: 0
Accepted
time: 0ms
memory: 3608kb

input:

1 2

output:

1 4
.##.

result:

ok good solution

Test #11:

score: 0
Accepted
time: 0ms
memory: 3640kb

input:

1 3

output:

1 6
.##...

result:

ok good solution

Test #12:

score: 0
Accepted
time: 0ms
memory: 3616kb

input:

1 4

output:

1 8
.##.....

result:

ok good solution

Test #13:

score: 0
Accepted
time: 0ms
memory: 3640kb

input:

1 5

output:

1 10
.##.......

result:

ok good solution

Test #14:

score: 0
Accepted
time: 0ms
memory: 3548kb

input:

1 6

output:

1 12
.##.........

result:

ok good solution

Test #15:

score: 0
Accepted
time: 0ms
memory: 3620kb

input:

1 7

output:

1 14
.##...........

result:

ok good solution

Test #16:

score: 0
Accepted
time: 0ms
memory: 3604kb

input:

1 8

output:

1 16
.##.............

result:

ok good solution

Test #17:

score: 0
Accepted
time: 0ms
memory: 3548kb

input:

1 9

output:

1 18
.##...............

result:

ok good solution

Test #18:

score: 0
Accepted
time: 0ms
memory: 3708kb

input:

1 10

output:

1 20
.##.................

result:

ok good solution

Test #19:

score: 0
Accepted
time: 0ms
memory: 3612kb

input:

2 5

output:

1 5
.##..

result:

ok good solution

Test #20:

score: 0
Accepted
time: 0ms
memory: 3580kb

input:

2 7

output:

1 7
.##....

result:

ok good solution

Test #21:

score: 0
Accepted
time: 0ms
memory: 3640kb

input:

2 9

output:

1 9
.##......

result:

ok good solution

Test #22:

score: 0
Accepted
time: 0ms
memory: 3624kb

input:

3 7

output:

1 14
.##.##.##.....

result:

ok good solution

Test #23:

score: 0
Accepted
time: 0ms
memory: 3612kb

input:

3 8

output:

1 16
.##.##.##.......

result:

ok good solution

Test #24:

score: 0
Accepted
time: 0ms
memory: 3708kb

input:

3 10

output:

1 20
.##.##.##...........

result:

ok good solution

Test #25:

score: 0
Accepted
time: 0ms
memory: 3608kb

input:

4 7

output:

1 7
.##.##.

result:

ok good solution

Test #26:

score: 0
Accepted
time: 0ms
memory: 3544kb

input:

4 9

output:

1 9
.##.##...

result:

ok good solution

Test #27:

score: 0
Accepted
time: 1ms
memory: 3640kb

input:

5 6

output:

-1 -1

result:

ok no solution

Test #28:

score: 0
Accepted
time: 0ms
memory: 3576kb

input:

5 8

output:

1 16
.##.##.##.##.##.

result:

ok good solution

Test #29:

score: 0
Accepted
time: 0ms
memory: 3704kb

input:

5 9

output:

1 18
.##.##.##.##.##...

result:

ok good solution

Test #30:

score: 0
Accepted
time: 0ms
memory: 3572kb

input:

6 7

output:

-1 -1

result:

ok no solution

Test #31:

score: 0
Accepted
time: 1ms
memory: 3704kb

input:

7 8

output:

-1 -1

result:

ok no solution

Test #32:

score: 0
Accepted
time: 0ms
memory: 3672kb

input:

8 9

output:

-1 -1

result:

ok no solution

Test #33:

score: 0
Accepted
time: 1ms
memory: 3632kb

input:

9 10

output:

-1 -1

result:

ok no solution

Extra Test:

score: 0
Extra Test Passed