oj.uz

Submission #912753

# Submission time Handle Problem Language Result Execution time Memory
912753 2024-01-19T20:12:26 Z amirhoseinfar1385 Stray Cat (JOI20_stray) C++17
15 / 100
 39 ms 17020 KB 
#include "Anthony.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn=20000+10;
struct yal{
	int u,v,w;	
	int getad(int fu){
		return (fu^u^v);
	}
}alle[maxn];

namespace {
	int a,b,n,m,high[maxn];
}

vector<int>res;
vector<int>adj[maxn];

void bfs(int u){
	vector<int>bf;
	bf.push_back(u);
	int dis=1;
	while((int)bf.size()>0){
		for(auto x:bf){
			high[x]=dis;
		}
		vector<int>fake;
		for(auto x:bf){
			for(auto y:adj[x]){
				int v=alle[y].getad(x);
				if(high[v]==0){
					high[v]=dis+1;
					fake.push_back(v);
				}
			}
		}
		swap(fake,bf);
		dis++;
	}
}

vector<int> Mark(int N, int M, int A, int B,std::vector<int> U, std::vector<int> V) {
  	a=A;
  	b=B;
  	n=N;
  	m=M;
  	res.resize(m);
  	for(int i=0;i<m;i++){
 		alle[i].u=U[i];
 		alle[i].v=V[i]; 		
  		adj[alle[i].u].push_back(i);
  		adj[alle[i].v].push_back(i);
  	}
  	if(a>=3){
  		bfs(0);
  		for(int i=0;i<m;i++){
  			if(high[alle[i].u]==high[alle[i].v]){
  				res[i]=(high[alle[i].v]+1)%3;
  				continue;
  			}
  			if(high[alle[i].u]>high[alle[i].v]){
  				swap(alle[i].u,alle[i].v);
  			}
  			res[i]=high[alle[i].v]%3;
  		}
  		return res;
  	}
  	return res;
}

#include "Catherine.h"
#include<bits/stdc++.h>
using namespace std;

namespace {
  int a,b;
}

void Init(int A, int B) {
  a=A;
  b=B;
}

int Move(std::vector<int> y) {
  if(a>=3){
    vector<int>tof;
    for(int i=0;i<(int)y.size();i++){
      if(y[i]!=0){
        tof.push_back(i);
      }
    }
    if((int)tof.size()==0){
      return -1;
    }
    if((int)tof.size()==1){
      return tof[0];
    }
    if(tof[0]==0&&tof[1]==1){
      return 0;
    }
    if(tof[0]==0&&tof[1]==2){
      return 2;
    }
    if(tof[0]==1&&tof[1]==2){
      return 1;
    }
  }
  return -1;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 16244 KB Output is correct
2 Correct 1 ms 1312 KB Output is correct
3 Correct 28 ms 15180 KB Output is correct
4 Correct 38 ms 17016 KB Output is correct
5 Correct 39 ms 17020 KB Output is correct
6 Correct 31 ms 15732 KB Output is correct
7 Correct 31 ms 15736 KB Output is correct
8 Correct 36 ms 16504 KB Output is correct
9 Correct 35 ms 16592 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 16244 KB Output is correct
2 Correct 1 ms 1312 KB Output is correct
3 Correct 28 ms 15180 KB Output is correct
4 Correct 38 ms 17016 KB Output is correct
5 Correct 39 ms 17020 KB Output is correct
6 Correct 31 ms 15732 KB Output is correct
7 Correct 31 ms 15736 KB Output is correct
8 Correct 36 ms 16504 KB Output is correct
9 Correct 35 ms 16592 KB Output is correct
10 Correct 27 ms 13500 KB Output is correct
11 Correct 27 ms 14152 KB Output is correct
12 Correct 33 ms 14152 KB Output is correct
13 Correct 27 ms 13888 KB Output is correct
14 Correct 28 ms 14412 KB Output is correct
15 Correct 31 ms 14668 KB Output is correct
16 Correct 39 ms 16696 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 13432 KB Output is correct
2 Correct 1 ms 1308 KB Output is correct
3 Correct 24 ms 12880 KB Output is correct
4 Correct 36 ms 14968 KB Output is correct
5 Correct 39 ms 14972 KB Output is correct
6 Correct 28 ms 13368 KB Output is correct
7 Correct 27 ms 13436 KB Output is correct
8 Correct 34 ms 14204 KB Output is correct
9 Correct 34 ms 14188 KB Output is correct
10 Correct 36 ms 13908 KB Output is correct
11 Correct 31 ms 13944 KB Output is correct
12 Correct 30 ms 13932 KB Output is correct
13 Correct 31 ms 13876 KB Output is correct
14 Correct 32 ms 14188 KB Output is correct
15 Correct 33 ms 14200 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 13432 KB Output is correct
2 Correct 1 ms 1308 KB Output is correct
3 Correct 24 ms 12880 KB Output is correct
4 Correct 36 ms 14968 KB Output is correct
5 Correct 39 ms 14972 KB Output is correct
6 Correct 28 ms 13368 KB Output is correct
7 Correct 27 ms 13436 KB Output is correct
8 Correct 34 ms 14204 KB Output is correct
9 Correct 34 ms 14188 KB Output is correct
10 Correct 36 ms 13908 KB Output is correct
11 Correct 31 ms 13944 KB Output is correct
12 Correct 30 ms 13932 KB Output is correct
13 Correct 31 ms 13876 KB Output is correct
14 Correct 32 ms 14188 KB Output is correct
15 Correct 33 ms 14200 KB Output is correct
16 Correct 24 ms 11908 KB Output is correct
17 Correct 24 ms 12096 KB Output is correct
18 Correct 26 ms 12104 KB Output is correct
19 Correct 26 ms 12108 KB Output is correct
20 Correct 30 ms 12608 KB Output is correct
21 Correct 32 ms 12608 KB Output is correct
22 Correct 35 ms 14652 KB Output is correct
23 Correct 27 ms 12440 KB Output is correct
24 Correct 27 ms 12368 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 1572 KB Wrong Answer [4]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 11076 KB Wrong Answer [4]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 27 ms 10936 KB Wrong Answer [4]
2 Halted 0 ms 0 KB -