oj.uz

답안 #111989

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
111989 2019-05-17T04:03:12 Z AMO5 Memory 2 (JOI16_memory2) C++
0 / 100
 3 ms 512 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "Memory2_lib.h"

using namespace std;
using namespace __gnu_pbds;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
#define all(x) (x).begin(), (x).end() 

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <ll, int> pli;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef long double ld;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
typedef set<int>::iterator sit;
typedef map<int,int>::iterator mit;
typedef vector<int>::iterator vit;

long long INF=numeric_limits<long long>::max();

int vis[1011];
vector<int> pos[55];

void Solve(int T, int N){
	if(T<=2)
    {
		int n = N;
		N*=2;
		for(int i = 0; i < N; i++)
		{
			for(int j = i+1; j < N; j++)
			{
				for(int k = j+1; k < N; k++)
				{
					if(vis[i]||vis[j]||vis[k])continue;
					int x = Flip(i,j);
					int y = Flip(i,k);
					int z = Flip(j,k);
					if(x==y&&x==z)
					{
						
					}
					else if(x==y)
					{
						pos[x].pb(i);
						vis[i] = 1;
					}
					else if(x==z)
					{
						pos[x].pb(j);
						vis[j] = 1;
					}
					else 
					{
						pos[x].pb(k);
						vis[k] = 1;
					}
				}
			}
		}
		
		for(int i = 0; i < n; i++)
		{
			Answer(pos[i][0],pos[i][1],i);
		}
	}
	return;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 384 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 256 KB Wrong Answer[5]
2 Halted 0 ms 0 KB -