結果

問題 No.335 門松宝くじ
ユーザー heno239heno239
提出日時 2020-08-29 14:34:52
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,023 ms / 2,000 ms
コード長 3,690 bytes
コンパイル時間 1,450 ms
コンパイル使用メモリ 127,592 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-11-14 07:27:46
合計ジャッジ時間 8,248 ms
ジャッジサーバーID
(参考情報)
judge3 / judge2
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 2 ms
6,820 KB
testcase_03 AC 2 ms
6,816 KB
testcase_04 AC 2 ms
6,816 KB
testcase_05 AC 158 ms
6,816 KB
testcase_06 AC 238 ms
6,816 KB
testcase_07 AC 677 ms
6,816 KB
testcase_08 AC 145 ms
6,820 KB
testcase_09 AC 1,020 ms
6,816 KB
testcase_10 AC 1,023 ms
6,816 KB
testcase_11 AC 1,014 ms
6,820 KB
testcase_12 AC 997 ms
6,816 KB
testcase_13 AC 998 ms
6,816 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod =1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m=mod) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 2;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

int maval[800][800];
void solve() {
	int n, m; cin >> n >> m;
	vector<vector<int>> v(m, vector<int>(n));
	vector<vector<int>> loc(m, vector<int>(n));
	rep(i, m)rep(j, n) {
		cin >> v[i][j]; v[i][j]--;
		loc[i][v[i][j]] = j;
	}
	vector<ll> s(m);
	rep(i, m) {
		rep(x, n)Rep(y, x + 1, n) {
			maval[x][y] = 0;
		}
		rep(x, n)Rep(y, x + 1, n)Rep(z, y + 1, n) {
			bool valid = true;
			if (loc[i][x] < loc[i][y] && loc[i][y] < loc[i][z])valid = false;
			if (loc[i][x] > loc[i][y] && loc[i][y] > loc[i][z])valid = false;
			if (valid) {
				maval[x][y] = max(maval[x][y], z);
				maval[x][z] = max(maval[x][z], z);
				maval[y][z] = max(maval[y][z], z);
			}
		}
		rep(x, n)Rep(y, x + 1, n) {
			s[i] += maval[x][y];
		}
	}
	vector<LP>vs; rep(i, m)vs.push_back({ s[i],i });
	auto comp = [](LP a, LP b) -> bool {
		if (a.first != b.first)return a.first > b.first;
		return a.second < b.second;
	};
	sort(all(vs), comp);
	cout << vs[0].second << "\n";
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(15);
	//init_f(); 
	//init();
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}
0