QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#578684#9319. Bull FarmwangwxTL 2670ms36792kbC++142.2kb2024-09-20 20:48:312024-09-20 20:48:33

Judging History

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

  • [2024-09-20 20:48:33]
  • 评测
  • 测评结果:TL
  • 用时:2670ms
  • 内存:36792kb
  • [2024-09-20 20:48:31]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mxn=2e3+5,inf=4e6+10;
string s;
int a,b,c;
int cnt[mxn];
int t,n,l,q;
int bucket[mxn];
int h[mxn],tot;
struct E{
    int nx,to,w;
}e[inf];

int mp[mxn][mxn];



void add(int u,int v,int i){
    e[++tot]={h[u],v,i};
    h[u]=tot;
}

void sx(int x){
    for(int i=1;i<=n;++i){
        if(mp[i][cnt[i]]) continue;
        add(i,cnt[i],x);
        mp[i][cnt[i]]=1;
    }
}

void dx(int x){
    int l,r;
    for(int i=1;i<=n;++i){
        if(bucket[i]==0) l=i;
        if(bucket[i]==2) r=i;
    }
    for(int i=1;i<=n;++i){
        if(mp[i][l]) continue;
        if(cnt[i]==r) add(i,l,x);
        mp[i][l]=1;
    }
   
}


int jm(string &s){
    int js=0;
    memset(bucket,0,sizeof bucket);
    int zc=s.size();
    for(int i=0;i<zc;i+=2){
        cnt[i/2+1]=(s[i]-'0')*50+(s[i+1]-'0');
        bucket[cnt[i/2+1]]++;
        if(bucket[cnt[i/2+1]]==1) js++;
    }
    if(js==n) return 1;
    else if(js==n-1) return 2;
    else return 0;
}

int vis[mxn];

int check(int c){
    queue<int> q;
    q.push(a);
    memset(vis,0,sizeof vis);
    while(!q.empty()){
        int now=q.front();
        q.pop();
        if(vis[now]) continue;
        vis[now]=1;
        for(int i=h[now];~i;i=e[i].nx){
            int cs=e[i].w;
            int to=e[i].to;
            if(cs>c) continue;
            if(vis[to]) continue;
            q.push(to);
            if(to==b) return 1;
        }

    }
    return vis[b];
}


signed main(){
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    cin>>t;
    while(t--){
        memset(mp,0,sizeof mp);
        tot=0;
        memset(h,-1,sizeof h);
        cin>>n>>l>>q;
        for(int i=1;i<=l;++i){
            cin>>s;
            int ed=jm(s);
            if(!ed) continue;
            else if(ed==1) sx(i);
            else    dx(i);
        }

        for(int i=1;i<=q;++i){
            cin>>s;
            a=(s[0]-'0')*50+s[1]-'0';
            b=(s[2]-'0')*50+s[3]-'0';
            c=(s[4]-'0')*50+s[5]-'0';
           
            if(check(c)) cout<<'1';
            else        cout<<'0';

        }
        cout<<'\n';
    }
    
return 0;}



Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 2ms
memory: 35384kb

input:

2
5 2 4
0305040201
0404040404
030300
020500
050102
020501
6 2 4
030603010601
010203060504
030202
060402
050602
060401

output:

1011
0100

result:

ok 2 lines

Test #2:

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

input:

1
3 3 6
020202
030301
030201
020102
030203
010201
010303
020303
010202

output:

010101

result:

ok single line: '010101'

Test #3:

score: 0
Accepted
time: 439ms
memory: 36792kb

input:

200
10 10 5000
01060:04020305080709
0103070:060204050908
09070503080401060:02
050308010204090:0607
03010502040607080:09
03080109020504060:07
06050:09040302080107
07080305010409060:02
030809010:0204060507
0:060908070201050304
060700
090:03
09080:
070405
010703
0:0100
080601
030600
070206
0:0:09
08040...

output:

011110001101101111111111111111111101111111110111011110110110111011010111111111111111111101111111111110111111110111111111111101111111111110111111111111111111110001100111111111111111111111111011101111111111111111111111111111111111111111011011110100111110111111110111111100111111101110111111111101111110...

result:

ok 200 lines

Test #4:

score: 0
Accepted
time: 2670ms
memory: 35368kb

input:

1
2000 1 1000000
M=:]A@8UAY7W2JJ4KEHIA[HSCQ1ENSC`JXR;F3PJ:_@41P9Z=9HR8P<<:DUXRR9^WOQFL?NZP6S@=J0^WE32=6;\U0?88]Q_RNPUMT6YU<4<S]H?:7OCQYOT4YAV1^764ENWSDBED>M7A:BI>KSIR48JQ9B=N\5T3N4A2aF0@>3TI81<G7;YE>W`NMP<:IT4CI3D0=GZC3I\CLQJQBA9BDIS9SAM55KaVA<Z@D=>:Y?CQHUQ5U3a6UVI8OKX9_FAF^7=5M85;<0;8YPAM<7Z7PP7A=N...

output:

000101000101100010001000000010010110000001000001001100000000010000100001000000101100000000010000001000000001110000010110100000111100100000001000000000011001010001000001001000100000000100011001100110010000010000101100000011111000000010000101010010000000010101000001010111100000100000000000000101000100...

result:

ok single line: '000101000101100010001000000010...0101000101000000000010101001000'

Test #5:

score: -100
Time Limit Exceeded

input:

1
2000 2000 1000000
FVAaH7GRPO;_11Da5J18@3SMG==\G8E8S^6:M4L0JH>MN5IXT>2<7WJ3U8LVJS=;;3F13>0D0>VOIIU@EPHG6ABL6;K?T1PXDERLG07]5C9^GDKG<SBMIW;`4W8P3=469TIPKH0O34523_J5C2MJ17D25Z@=K8H@M>WK<CMK7EO]BPD7B6AW741J5YIHIa1:ERSG>L3N2^F3<4F`DLE@2AA5=8GZK6:192FB736[WMV7:^DA2C:<LK040VJBM3M]WXU50`407TR_?PLF@5VL7OSL...

output:


result: