OJ Board

Nevermind, I now know why that scheme will fail.

Does doing BFS twice (making sure to not use an edge twice) work? My code matches Morass' output on uDebug. #include <bits/stdc++.h> using namespace std; typedef pair<int,int> pi; typedef tuple<int,int,int> t3; bool edge_used[100000+10]; vector<vector<pi>> adjList; // adj, edge_id int N,M; int S,T; ...

Why WA? I've been passing all the test cases. #include <bits/stdc++.h> using namespace std; char input[32][32]; int res[32][32][2][5]; int src_res[32][32]; int sink_res[32][23]; typedef pair<int, int> pi; typedef pair<int, pi> pii; #define INF (1<<28) class bfs_node{ public: int row, col; int flow; ...

Getting WA. What did I miss? #include <bits/stdc++.h> using namespace std; #define INF 1<<28 #define UNVISITED -1 typedef bitset<11> bset; typedef unsigned long ul; int N, M; vector<string> input; vector<bset> input_bs; int arr[1<<11][11][1<<11]; // int f(bset bs, int index){ // ul ulong = bs.to_ulo...

Why TLE? #include <bits/stdc++.h> using namespace std; vector<vector<string>> input; vector<int> sz; int N; int totalNodes; bool hasLetter(int index, char letter){ int num = sz[index]; for(int i = 0; i<num; i++){ if(letter == toupper(input[index][i][0])){ return true; } } return false; } int getInde...

Why WA? #include <bits/stdc++.h> using namespace std; bool lexcmp(string a, string b){ int asz = a.size(); int bsz = b.size(); if(asz == bsz) return a < b; return asz > bsz; } set<int> build; // map<string, set<string>> prohibited; vector<set<int>> prohibited; vector<string> input; map<string, int> ...

Why is it RE? I've already tried implementing it with a stack. #include <bits/stdc++.h> using namespace std; int N; vector<vector<int>> adjMat; int toInt(string &str){ int cnt = 0; for(auto itr = str.rbegin(); itr!=str.rend(); ++itr){ cnt *= 10; cnt += *itr - '0'; } // cout << "transformed ...

Why is mine RE? Could it be due to the recursion stack being too deep? I've tried it with 5 and even 6 as the array size. #include <bits/stdc++.h> using namespace std; #define INF 1<<26 int N; vector<int> input; vector<int> orig; vector<int> swap_map; void printOrig(){ for(int i = 0; i<orig.size(); ...

Getting TLE a couple of times now. #include <bits/stdc++.h> using namespace std; #define INF 1<<26 #define UNVISITED -1 int offset; int input[59][30]; int max_val; int arr [59][30][3001]; // bool visited[59][30][3001]; int N; int f(int i, int j, int sum){ // printf("%d %d %d %d\n", i,j,sum...

Why WA? Any more test cases? #include <bits/stdc++.h> using namespace std; typedef unsigned long ul; typedef bitset<16> bset; typedef long long ll; #define UNVISITED -1 int R, C, N; int RC; void toCoord(int index, int * i, int * j){ *i = index/C; *j = index%C; } int toIndex(int i, int j){ int ret = ...

According to Halim's book CP3, you really need to use BigInt.

What is the recommended way to scan doubles and typecast to int? For example, if I'm reading 9.14, and I want it to be 914, I would do: scan as double, multiply that double by 100, then typecast to int. double f; cin >> f; f*=100; int i = (int) f; For this problem, I think one can do "%d.%d&quo...

Why WA? AC with Java BigInt If we're following uDebug's cases, then it's the BigInt problem. I've coded it in python, and the same logic gives the same answer for the first case, and for the second, it gives off a RuntimeError, exceeding maximum recursion depth. uDebug input: 2 aaaaaaaaaaaaaaaaaaaaa...

...which I also can't find. (along with delete).

Anyway, how come it's about big integer? I thought that "Z nor any prefix or suffix of Z will have more than 10100 distinct occurrences in X as a subsequence."

There should be near the post.