#include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef unsigned long ull; typedef pair pii; int dx[] = {0, 0, 1, -1}; int dy[] = {1, -1, 0, 0}; const int maxn = 21; const int INF = 2100000000; const bool debug = false; int n, m, visitedT = 1; vector path[22]; int cnt[22]; int visited[1 b; path[a].push_back(b); ..
#include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef unsigned long ull; typedef pair pii; typedef signed char i8; typedef short i16; typedef int i32; typedef long long i64; int dx[] = {0, 0, 1, -1}; int dy[] = {1, -1, 0, 0}; const int Mod = 1000000003; int dp[1005][1005]; int n, k; int dpfunction(int..
#include using namespace std; int d[100001]; int parent_idx[100001]; map num_as_index; stack st; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; int k; cin >> n >> k; vector adj(n + 1); for (int i = 1; i > s; d[i] = 0; for (int j = 0; j to; if (parent_idx[to] == -1) { cout
#include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef pair pii; int dx[] = {0, 0, 1, -1}; int dy[] = {1, -1, 0, 0}; int board[6][6]; /* @desc "struct for ans" */ struct Data { int direction; int many; int where; }; Data ans[10]; Data savedAns[10]; int savedStep = 100; bool haveAns = false; /** * @brief Return ..
#include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef pair pii; typedef vector vi; int dx[] = {0, 0, 1, -1}; int dy[] = {1, -1, 0, 0}; int dist[505]; struct Path { int from; int to; int tch; }; void rmain() { vector path; int n, m, b; cin >> n >> m >> b; for (int i = 0; i < m; i++) { int s, e, t; cin ..
#include using namespace std; typedef long long ll; typedef pair pii; int n , ans = 987654321; string arr[10]; bool used[10]; int moreLen(int aidx , int bidx){ int aSize = arr[aidx].size(), bSize = arr[bidx].size(); for (int sameCount = min(aSize, bSize); sameCount > 0; sameCount--) { int left , right; for (left = aSize - sameCount, right = 0; left < aSize; left++, right++ ){ if (arr[aidx][left]..
#include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef pair pi_i; int c[10005] , y[10005]; int main(){ cin.tie(0); cout.tie(0); int n , s , nPrice , storePrice; cin >> n >> s; for(int i = 0;i > c[i] >> y[i]; ll ans = c[0] * y[0]; // 첫주는 그냥 바로 사야됨 nPrice = c[0]; storePrice = s; for (int i = 1; i < n; i++) { // 현재 가격..
#include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef unsigned long ull; typedef pair pii; #define DEBUG_ if (false) int dx[] = {0, 0, 1, -1}; int dy[] = {1, -1, 0, 0}; int n, m, x; int visited[1005]; unordered_map roads[1005]; struct QData { int loc; int tim; }; struct QData_comp { bool oper..
#include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef unsigned long ull; typedef pair pii; typedef signed char i8; typedef short i16; typedef int i32; typedef long long i64; int dx[] = {0, 0, 1, -1}; int dy[] = {1, -1, 0, 0}; int n, m; int presum[50005]; int people[50005]; int dp[5][50005]; int main()..