oj.uz

답안 #420884

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
420884 2021-06-08T14:38:52 Z AugustinasJucas 장난감 기차 (IOI17_train) C++14
16 / 100
 17 ms 2788 KB 
#pragma GCC optimize("O2")
#pragma GCC target("avx2")
//#include "train.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> charg;
vector<int> priklauso;
int n;
vector<bool> isEnd(5001, 0);
const int dydis = 5e3 + 10;
int ind[dydis] = {};
int low[dydis] = {};
int onS[dydis] = {};
vector<int> gr[dydis];
int dbInd = 0;
vector<int> st;
int sz[dydis] = {0};
vector<pair<int, int> > br;
void dfs(int v){
 	if(ind[v] == -1){
		ind[v] = dbInd;
		low[v] = dbInd++;
		onS[v] = 1;
		st.push_back(v);
	}
	
	for(auto x : gr[v]){
		if(ind[x] == -1){
			dfs(x);
			low[v] = min(low[x], low[v]);
		}else if(onS[x]){
			low[v] = min(low[v], ind[x]);
		}
	}
	if(low[v] == ind[v]){
		sz[low[v]] = 0;
		while(true){
			int u = st.back(); st.pop_back();
			low[u] = min(low[u], low[v]);
			onS[u] = 0;
			sz[low[v]]++;
			if(u == v) break;
		}
	}
}
vector<int> g[dydis];
bool has[dydis];
set<pair<int, int> > setas;
int rem[dydis];
bool arYra(int v){
	if(sz[v] > 1 && has[v]) return true;
	if(isEnd[v]) if(has[v]) return true;
	if(rem[v] != -1) return rem[v];
	bool ret = 0;
//	cout << "esu " << v << endl;
	for(auto x : g[v]){
		ret = ret | arYra(x);
	} 
	return rem[v] = ret;
}
vector<int> viskasPirmo(){
	
//	cout << "pirmo! " << endl;
	for(int i = 0; i < 5001; i++) isEnd[i] = 0, rem[i] = -1;
	vector<int> ret(n, 0);
	for(int i = 0; i < n; i++){
		if(ind[i] == -1) dfs(i);
		has[low[i]] |= charg[i];
		//cout << i << " komp: " << low[i] << endl;
	}
	for(auto x : br){
		int a = low[x.first];
		int b = low[x.second];
		if(a == b) isEnd[a] = 1;
		if(setas.count({a, b})) continue;
		//cout << a << " -> " << b << "\n";
		setas.insert({a, b});
		if(a != b) g[a].push_back(b);
	}
	for(int i = 0; i < n; i++){
	//	cout << "nuo " << i << endl;
		ret[i] = arYra(low[i]);
	}
	
	return ret;
}
vector<int> viskasAntro(){
	vector<int> ret(n);
	return ret;
}
vector<int> vienCharg(){
	vector<int> ret(n);
	return ret;
}

vector<int> prm(){
	vector<int> ret(n, 0);

	for(int i = 0; i < n; i++){
		int v = i;
	//	cout << "i  = " << i << endl;
		while(true){
		//	cout << "v = " << v << ", end = " << isEnd[v] << endl;
			if(isEnd[v] && priklauso[v] == charg[v]){
				ret[i] = priklauso[v];
				break;
			}else{
				if(gr[v].size() == 1 && gr[v][0] == v){
					ret[i] = charg[v];
					break;
				}else{
					v++;
				}
			}
		}
	}
	return ret;
}
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
	vector<int> res(a.size());
	priklauso = a;
	charg = r;
	n = a.size();
	for(int i = 0; i < n; i++) ind[i] = -1;
	for(int i = 0; i < (int)u.size(); i++){
		br.push_back({u[i], v[i]});
		gr[u[i]].push_back(v[i]);
	//	gr[v[i]].push_back(u[i]);
	}
	int cnt[2] = {0}; for(auto x : a) cnt[x]++;
	int rc = 0; for(auto x : r) rc += x;
	bool pirmasSub = 1;
	for(int i = 0 ; i < u.size(); i++) {
		if(v[i] == u[i]) isEnd[v[i]] = 1;
		if(v[i] - u[i] == 0 || v[i]-u[i] == 1) continue;
		pirmasSub = 0;
	}
	if(pirmasSub){
		return prm();
	}
	if(cnt[0] == 0){
		return viskasPirmo();
	}else if(cnt[1] == 0){
		return viskasAntro();
	}else if(rc == 0){
		return vienCharg();
	}
	//for(int i = 0; i < n; i++)
	
	return res;
}

Compilation message

train.cpp: In function 'bool arYra(int)':
train.cpp:60:16: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   60 |  return rem[v] = ret;
      |         ~~~~~~~^~~~~
train.cpp: In function 'std::vector<int> who_wins(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:134:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  134 |  for(int i = 0 ; i < u.size(); i++) {
      |                  ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 972 KB Output is correct
2 Correct 5 ms 1048 KB Output is correct
3 Correct 5 ms 992 KB Output is correct
4 Correct 5 ms 972 KB Output is correct
5 Correct 5 ms 972 KB Output is correct
6 Correct 4 ms 972 KB Output is correct
7 Correct 4 ms 972 KB Output is correct
8 Correct 4 ms 972 KB Output is correct
9 Correct 4 ms 972 KB Output is correct
10 Correct 4 ms 972 KB Output is correct
11 Correct 4 ms 972 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 460 KB 3rd lines differ - on the 2nd token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 2788 KB Output is correct
2 Correct 17 ms 2712 KB Output is correct
3 Correct 14 ms 2632 KB Output is correct
4 Correct 12 ms 1736 KB Output is correct
5 Correct 12 ms 1992 KB Output is correct
6 Correct 12 ms 1952 KB Output is correct
7 Correct 13 ms 1992 KB Output is correct
8 Correct 9 ms 1612 KB Output is correct
9 Correct 9 ms 1612 KB Output is correct
10 Correct 10 ms 1736 KB Output is correct
11 Correct 12 ms 1836 KB Output is correct
12 Correct 17 ms 2504 KB Output is correct
13 Correct 9 ms 1864 KB Output is correct
14 Correct 9 ms 1976 KB Output is correct
15 Correct 9 ms 1840 KB Output is correct
16 Correct 9 ms 1924 KB Output is correct
17 Correct 9 ms 1964 KB Output is correct
18 Correct 11 ms 1924 KB Output is correct

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 1228 KB 3rd lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 1484 KB 3rd lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 972 KB Output is correct
2 Correct 5 ms 1048 KB Output is correct
3 Correct 5 ms 992 KB Output is correct
4 Correct 5 ms 972 KB Output is correct
5 Correct 5 ms 972 KB Output is correct
6 Correct 4 ms 972 KB Output is correct
7 Correct 4 ms 972 KB Output is correct
8 Correct 4 ms 972 KB Output is correct
9 Correct 4 ms 972 KB Output is correct
10 Correct 4 ms 972 KB Output is correct
11 Correct 4 ms 972 KB Output is correct
12 Incorrect 1 ms 460 KB 3rd lines differ - on the 2nd token, expected: '1', found: '0'
13 Halted 0 ms 0 KB -