제출 #1238709

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1238709		santi3223	Aliens (IOI16_aliens)	C++20	0 / 100	2096 ms	328 KiB

aliens

#include <bits/stdc++.h>
#include "aliens.h"
using namespace std;
#define ll long long
#define vl vector<ll>
#define all(aaa) aaa.begin(), aaa.end()
#define ff(aa, bb, cc) for(ll aa = bb; aa < cc; aa++)
#define vb vector<bool>
#define ed "\n"
#define pb push_back
#define pll pair<ll, ll>

ll minn;
set<pll> points;
ll K, M;

void brute(ll curk, vector<vl> visited){
	if(curk == K){
		bool ok = true;;
		for(auto &[a, b] : points){
			if(visited[a][b] == 0){
				ok = false;
				return;
			}
		}
		if(!ok){
			return;
		}
		ll x = 0;
		ff(i, 0, M){
			ff(j, 0, M){
				x += min(1LL, visited[i][j]);
			}
		}
		minn = min(minn, x);
		/*if(x == minn){
			ff(i, 0, M){
				ff(j, 0, M){
					cout << visited[i][j] << " ";
				}
				cout << ed;
			}
			cout << ed;
		}*/
		return;
	}
	brute(curk+1, visited);
	ff(i, 0, M){
		ff(j, i, M){
			vector<vl> nuevo = visited;
			//i---j
			//|   |
			//|---x
			ll dist = j-i+1;
			ff(curi, i, i+dist){
				ff(curj, i, i+dist){
					nuevo[curi][curj]++;
				}
			}
			brute(curk+1, nuevo);
		}
	}
}

long long take_photos(int n, int m, int k, std::vector<int> r, std::vector<int> c){
	bool ok = true;
	K = k;
	M = m;
	//unordered_set<ll> dif
	ff(i, 0, n){
		points.insert({r[i], c[i]});
		if(r[i] != c[i]){
			ok = false;
		}
	}
	/*if(ok){
		
	}*/
	vector<vl> visited(m, vl(m, 0));
	//cout << m*m << ed;
	minn = m*m;
	
	brute(0, visited);
	return minn;
}
/*
int main() {
    int n, m, k;
    assert(3 == scanf("%d %d %d", &n, &m, &k));
    std::vector<int> r(n), c(n);
    for (int i = 0; i < n; i++) {
        assert(2 == scanf("%d %d", &r[i], &c[i]));
    }
    long long ans = take_photos(n, m, k, r, c);
    
    
    printf("%lld\n", ans);
    return 0;
}
*/

컴파일 시 표준 에러 (stderr) 메시지

aliens.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
aliens_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

• Subtask 1: 0 / 4
• Subtask 2: 0 / 12
• Subtask 3: 0 / 9
• Subtask 4: 0 / 16
• Subtask 5: 0 / 19
• Subtask 6: 0 / 40