oj.uz

답안 #970368

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
970368 2024-04-26T12:29:09 Z GrindMachine 장난감 기차 (IOI17_train) C++17
5 / 100
 10 ms 25436 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 5e3 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "train.h"

vector<int> adj[N];
bool edge[N][N];

std::vector<int> who_wins(std::vector<int> a, std::vector<int> b, std::vector<int> U, std::vector<int> V) {
	int n = sz(a);
	int m = sz(U);

	rep(i,m){
		int u = U[i], v = V[i];
		adj[u].pb(v);
		edge[u][v] = 1;
	}

	vector<int> ans(n);

	rep(i,n){
		int j = i;
		while(true){
			if(a[j]){
				if(b[j]){
					if(edge[j][j]){
						ans[i] = 1;
						break;
					}
				}
			}
			else{
				if(!b[j]){
					if(edge[j][j]){
						ans[i] = 0;
						break;
					}
				}
			}

			if(!edge[j][j+1]){
				if(a[j]) ans[i] = 0;
				else ans[i] = 1;
				break;
			}

			j++;
		}
	}

	return ans;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 25180 KB Output is correct
2 Correct 8 ms 25176 KB Output is correct
3 Correct 8 ms 25436 KB Output is correct
4 Incorrect 9 ms 25436 KB 3rd lines differ - on the 1st token, expected: '1', found: '0'
5 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 51.0

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