QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#560788	#9239. Hieroglyphs	chenxinyang2006^#	Compile Error	/	/	C++20	1.9kb	2024-09-12 17:59:09	2024-09-12 17:59:16

Judging History

This is the latest submission verdict.

[2024-09-12 17:59:16]
Judged

Verdict: Compile Error
Time: 0ms
Memory: 0kb

Show

[2024-09-12 17:59:09]
Submitted

answer

#include "hieroglyphs.h"
#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
  if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
  if(x > y) x = y;
}

inline int popcnt(int x){
  return __builtin_popcount(x);
}

inline int ctz(int x){
  return __builtin_ctz(x);
}
int n,m;
int a[100005],b[100005];
vector <int> occ[2][200005],res[200005],temp;

#define lowbit(x) (x & (-x))
int tree[100005];
void upd(int pos,int C){
    while(pos <= m){
        chkmax(tree[pos],C);
        pos += lowbit(pos);
    }
}

int qry(int pos){
    int ret = 0;
    while(pos){
        chkmax(ret,tree[pos]);
        pos -= lowbit(pos);
    }
    return ret;
}

namespace f2{
    int tree[100005];
    void upd(int pos,int C){
        while(pos <= m){
            tree[pos] += C;
            pos += lowbit(pos);
        }
    }

    int qry(int pos){
        int ret = 0;
        while(pos){
            ret += tree[pos];
            pos -= lowbit(pos);
        }
        return ret;
    }    
}
int vval[200005];

vector<int> ucs(vector<int> A,vector<int> B) {
    n = SZ(A);m = SZ(B);
    rep(i,1,n){
        a[i] = A[i - 1];
        occ[0][a[i]].eb(i);
    }
    rep(i,1,m){
        b[i] = B[i - 1];
        occ[1][b[i]].eb(i);
    }
    rep(i,1,n) if(a[i] != b[i]) return vector<int> ans(1,-1);
    return A;
}
/*
g++ hieroglyphs.cpp grader.cpp -o grader.exe -Wall -Wshadow -O2
*/

源文件, 语言: C++20

详细

answer.code: In function ‘std::vector<int> ucs(std::vector<int>, std::vector<int>)’:
answer.code:90:52: error: expected primary-expression before ‘ans’
   90 |     rep(i,1,n) if(a[i] != b[i]) return vector<int> ans(1,-1);
      |                                                    ^~~
answer.code:90:51: error: expected ‘;’ before ‘ans’
   90 |     rep(i,1,n) if(a[i] != b[i]) return vector<int> ans(1,-1);
      |                                                   ^~~~
      |                                                   ;
answer.code:90:52: error: ‘ans’ was not declared in this scope; did you mean ‘abs’?
   90 |     rep(i,1,n) if(a[i] != b[i]) return vector<int> ans(1,-1);
      |                                                    ^~~
      |                                                    abs