QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#557183#8726. Magic ShowLe0ChanCompile Error//C++201.3kb2024-09-11 07:48:312024-09-11 07:48:32

Judging History

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

  • [2024-09-11 07:48:32]
  • 评测
  • [2024-09-11 07:48:31]
  • 提交

Alice

#include <bits/stdc++.h>
using namespace std;
#include "Alice.h"
#define LL long long
#define pii pair<int,int>
#define fi first 
#define se second
std::vector<std::pair<int, int>> Alice();
long long setN(int n);
vector<pii> Alice(){
    int n=4943;
    LL V=setN(4943);
    vector<pii> as;
    as.push_back({1,2});
    for(int l=3;l<=4943;l+=61){
        int now=l;
        for(int i=0;i<=60;i++){
            if(V&(1ll<<i)) as.push_back({now,now-2});
            else as.push_back({now,now-1});
            now++;
        }
    }
    return as;
}
int main(){
    Alice();return 0;
}

Bob

#include <bits/stdc++.h>
#include "Bob.h"
using namespace std;
#define LL long long
#define pii pair<int,int>
#define fi first 
#define se second
long long Bob(std::vector<std::pair<int, int>> V);
const int N=5e3+5;
bool vis[N];
int fa[N],ans[N];
int n=4943;
vector<int> g[N];
void add(int x,int y){g[x].push_back(y);}
LL Bob(vector<pii> as){
    for(auto [x,y]:as){
        if(x<y) fa[y]=x;
        else fa[x]=y;
    }
    for(int l=3;l<=n;l+=61){
        int now=l;
        for(int j=0;j<=60;j++){
            if(fa[now]){
                ans[j]=now-fa[now]-1;
            }
            now++;
        }
    }
    LL rs=0;
    for(int j=0;j<=60;j++) rs+=1ll<<ans[j];
    cout<<rs<<"\n";
}

Details

/usr/bin/ld: /tmp/cc7OM76y.o: in function `main':
Alice.code:(.text.startup+0x0): multiple definition of `main'; /tmp/cchHFzxA.o:grader_Alice.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status