QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#746972#8726. Magic ShowKiharaTouma0 0ms1868kbC++231.5kb2024-11-14 16:01:472024-11-14 16:01:47

Judging History

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

  • [2024-11-14 16:01:47]
  • 评测
  • 测评结果:0
  • 用时:0ms
  • 内存:1868kb
  • [2024-11-14 16:01:47]
  • 提交

Alice

//qoj8726
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

#define ALICE
//#define BOB

#ifdef ALICE

#include "Alice.h"

std::vector<std::pair<int, int> > Alice(){
	vector<pair<int, int> > res;
	res.clear();
	ll val = setN(5000);
    for(int i = 2; i <= 5000; ++ i){
        res.emplace_back(val * (i-1) + 1, i);
    }
	return res;
}

#endif

#ifdef BOB

#include "Bob.h"

long long Bob(std::vector<std::pair<int, int>> V){
	__int128 res = 0, nw = 1;
	for(auto i : V){
        __int128 x = i.first - 1, y = i.second - 1;
        while(res % y != x){
            res += nw;
        }
        nw = nw / __gcd(nw, y) * y;
        if(nw > 1e18){
            break;
        }
    }
	return res;
}

#endif

Bob

//qoj8726
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

//#define ALICE
#define BOB

#ifdef ALICE

#include "Alice.h"

std::vector<std::pair<int, int> > Alice(){
	vector<pair<int, int> > res;
	res.clear();
	ll val = setN(5000);
    for(int i = 2; i <= 5000; ++ i){
        res.emplace_back(val * (i-1) + 1, i);
    }
	return res;
}

#endif

#ifdef BOB

#include "Bob.h"

long long Bob(std::vector<std::pair<int, int>> V){
	__int128 res = 0, nw = 1;
	for(auto i : V){
        __int128 x = i.first - 1, y = i.second - 1;
        while(res % y != x){
            res += nw;
        }
        nw = nw / __gcd(nw, y) * y;
        if(nw > 1e18){
            break;
        }
    }
	return res;
}

#endif

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 0
Wrong Answer

Test #1:

score: 0
Wrong Answer
time: 0ms = 0ms + 0ms
memory: 1868kb,1764kb

input:

1
4005

output:

9ff923928e5675d6f7ae686fcfb20beac84bc7b1a47cf13bde24b59497bcae3b4900097049e1c568aa409defdbadf4cfc599c0e496e22068170cce547295ffa4
Edges returned by Alice() have invalid node.

input:

9ff923928e5675d6f7ae686fcfb20beac84bc7b1a47cf13bde24b59497bcae3b4900097049e1c568aa409defdbadf4cfc599c0e496e22068170cce547295ffa4
Edges returned by Alice() have invalid node.

output:

9ff923928e5675d6f7ae686fcfb20beac84bc7b1a47cf13bde24b59497bcae3b4900097049e1c568aa409defdbadf4cfc599c0e496e22068170cce547295ffa4
Edges returned by Alice() have invalid node.

input:

9ff923928e5675d6f7ae686fcfb20beac84bc7b1a47cf13bde24b59497bcae3b4900097049e1c568aa409defdbadf4cfc599c0e496e22068170cce547295ffa4
Edges returned by Alice() have invalid node.

output:

9ff923928e5675d6f7ae686fcfb20beac84bc7b1a47cf13bde24b59497bcae3b4900097049e1c568aa409defdbadf4cfc599c0e496e22068170cce547295ffa4
Edges returned by Alice() have invalid node.

Subtask #2:

score: 0
Wrong Answer

Test #13:

score: 0
Wrong Answer
time: 0ms = 0ms + 0ms
memory: 1868kb,1768kb

input:

1
17476204

output:

9ff923928e5675d6f7ae686fcfb20beac84bc7b1a47cf13bde24b59497bcae3b4900097049e1c568aa409defdbadf4cfc599c0e496e22068170cce547295ffa4
Edges returned by Alice() have invalid node.

input:

9ff923928e5675d6f7ae686fcfb20beac84bc7b1a47cf13bde24b59497bcae3b4900097049e1c568aa409defdbadf4cfc599c0e496e22068170cce547295ffa4
Edges returned by Alice() have invalid node.

output:

9ff923928e5675d6f7ae686fcfb20beac84bc7b1a47cf13bde24b59497bcae3b4900097049e1c568aa409defdbadf4cfc599c0e496e22068170cce547295ffa4
Edges returned by Alice() have invalid node.

input:

9ff923928e5675d6f7ae686fcfb20beac84bc7b1a47cf13bde24b59497bcae3b4900097049e1c568aa409defdbadf4cfc599c0e496e22068170cce547295ffa4
Edges returned by Alice() have invalid node.

output:

9ff923928e5675d6f7ae686fcfb20beac84bc7b1a47cf13bde24b59497bcae3b4900097049e1c568aa409defdbadf4cfc599c0e496e22068170cce547295ffa4
Edges returned by Alice() have invalid node.

Subtask #3:

score: 0
Wrong Answer

Test #25:

score: 0
Wrong Answer
time: 0ms = 0ms + 0ms
memory: 1868kb,1768kb

input:

1
355365355024496523

output:

9ff923928e5675d6f7ae686fcfb20beac84bc7b1a47cf13bde24b59497bcae3b4900097049e1c568aa409defdbadf4cfc599c0e496e22068170cce547295ffa4
Edges returned by Alice() have invalid node.

input:

9ff923928e5675d6f7ae686fcfb20beac84bc7b1a47cf13bde24b59497bcae3b4900097049e1c568aa409defdbadf4cfc599c0e496e22068170cce547295ffa4
Edges returned by Alice() have invalid node.

output:

9ff923928e5675d6f7ae686fcfb20beac84bc7b1a47cf13bde24b59497bcae3b4900097049e1c568aa409defdbadf4cfc599c0e496e22068170cce547295ffa4
Edges returned by Alice() have invalid node.

input:

9ff923928e5675d6f7ae686fcfb20beac84bc7b1a47cf13bde24b59497bcae3b4900097049e1c568aa409defdbadf4cfc599c0e496e22068170cce547295ffa4
Edges returned by Alice() have invalid node.

output:

9ff923928e5675d6f7ae686fcfb20beac84bc7b1a47cf13bde24b59497bcae3b4900097049e1c568aa409defdbadf4cfc599c0e496e22068170cce547295ffa4
Edges returned by Alice() have invalid node.