Submission #55058

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
55058	2018-07-06T00:03:06 Z	ksun48	Railway Trip (JOI17_railway_trip)	C++14	Compilation error	0 ms	0 KB

railway_trip

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;

int next[2][100000][20]; // next stop of level <= j, you are <= j+1 (taking trains of j+1)
int idx[100000][21];
int main(){
	int n, k, q;
	cin >> n >> k >> q;
	vector<int> level(n);
	for(int i = 0; i < n; i++){
		cin >> level[i];
		level[i] = k - level[i];
	}
	vector<pair<int,int> > queries;
	for(int i = 0; i < q; i++){
		int a, b;
		cin >> a >> b;
		a--; b--;
		queries.push_back({a,b});
	}
	for(int j = 0; j <= k; j++){
		int cur = 0;
		for(int i = 0; i < n; i++){
			if(level[i] <= j){
				idx[i][j] = cur;
				cur++;
			}
		}
	}
	for(int j = 0; j < k; j++){
		int prev = 0;
		for(int i = 0; i < n; i++){
			if(level[i] > j+1) continue;
			if(level[i] <= j){
				prev = i;
			}
			next[0][i][j] = prev;
		}
		prev = n-1;
		for(int i = n-1; i >= 0; i--){
			if(level[i] > j+1) continue;
			if(level[i] <= j){
				prev = i;
			}
			next[1][i][j] = prev;
		}
	}
	for(int zz = 0; zz < queries.size(); zz++){
		vector<pair<int,int> > stuff[2]; // loc, dist
		stuff[0].push_back({queries[zz].first, 0});
		stuff[1].push_back({queries[zz].second, 0});
		int ans = 1000000000;
		for(int j = k-1; j >= 0; j--){
			// go to level j
			for(int p = 0; p < 2; p++){
				vector<pair<int,int> > newstuff;
				for(pair<int,int> x : stuff[p]){
					// go left from x, go right from x;
					int loc = x.first;
					int dist = x.second;
					for(int dir = 0; dir < 2; dir++){
						int newloc = next[dir][loc][j];
						int newdist = dist + abs(idx[ loc ][j+1] - idx[ newloc ][j+1]);
						newstuff.push_back({newloc, newdist});
					}
				}
				int a = 0;
				while(a + 1 < newstuff.size()){
					if(newstuff[a].first == newstuff[a+1].first){
						newstuff[a].second = min(newstuff[a].second, newstuff[a+1].second);
						newstuff.erase(newstuff.begin() + a + 1);
					}
					a++;
				}
				stuff[p] = newstuff;
			}
			// find ans
			for(pair<int,int> x0 : stuff[0]){
				for(pair<int,int> x1 : stuff[1]){
					ans = min(ans, x0.second + x1.second + abs(idx[x0.first][j] - idx[x1.first][j]));
				}
			}
		}
		cout << ans - 1 << '\n';
	}
}

Compilation message

railway_trip.cpp: In function 'int main()':
railway_trip.cpp:38:4: error: reference to 'next' is ambiguous
    next[0][i][j] = prev;
    ^~~~
railway_trip.cpp:5:5: note: candidates are: int next [2][100000][20]
 int next[2][100000][20]; // next stop of level <= j, you are <= j+1 (taking trains of j+1)
     ^~~~
In file included from /usr/include/c++/7/bits/stl_algobase.h:66:0,
                 from /usr/include/c++/7/bits/char_traits.h:39,
                 from /usr/include/c++/7/ios:40,
                 from /usr/include/c++/7/istream:38,
                 from /usr/include/c++/7/sstream:38,
                 from /usr/include/c++/7/complex:45,
                 from /usr/include/c++/7/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/7/bits/stdc++.h:52,
                 from railway_trip.cpp:1:
/usr/include/c++/7/bits/stl_iterator_base_funcs.h:208:5: note:                 template<class _ForwardIterator> _ForwardIterator std::next(_ForwardIterator, typename std::iterator_traits<_Iter>::difference_type)
     next(_ForwardIterator __x, typename
     ^~~~
railway_trip.cpp:46:4: error: reference to 'next' is ambiguous
    next[1][i][j] = prev;
    ^~~~
railway_trip.cpp:5:5: note: candidates are: int next [2][100000][20]
 int next[2][100000][20]; // next stop of level <= j, you are <= j+1 (taking trains of j+1)
     ^~~~
In file included from /usr/include/c++/7/bits/stl_algobase.h:66:0,
                 from /usr/include/c++/7/bits/char_traits.h:39,
                 from /usr/include/c++/7/ios:40,
                 from /usr/include/c++/7/istream:38,
                 from /usr/include/c++/7/sstream:38,
                 from /usr/include/c++/7/complex:45,
                 from /usr/include/c++/7/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/7/bits/stdc++.h:52,
                 from railway_trip.cpp:1:
/usr/include/c++/7/bits/stl_iterator_base_funcs.h:208:5: note:                 template<class _ForwardIterator> _ForwardIterator std::next(_ForwardIterator, typename std::iterator_traits<_Iter>::difference_type)
     next(_ForwardIterator __x, typename
     ^~~~
railway_trip.cpp:63:20: error: reference to 'next' is ambiguous
       int newloc = next[dir][loc][j];
                    ^~~~
railway_trip.cpp:5:5: note: candidates are: int next [2][100000][20]
 int next[2][100000][20]; // next stop of level <= j, you are <= j+1 (taking trains of j+1)
     ^~~~
In file included from /usr/include/c++/7/bits/stl_algobase.h:66:0,
                 from /usr/include/c++/7/bits/char_traits.h:39,
                 from /usr/include/c++/7/ios:40,
                 from /usr/include/c++/7/istream:38,
                 from /usr/include/c++/7/sstream:38,
                 from /usr/include/c++/7/complex:45,
                 from /usr/include/c++/7/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/7/bits/stdc++.h:52,
                 from railway_trip.cpp:1:
/usr/include/c++/7/bits/stl_iterator_base_funcs.h:208:5: note:                 template<class _ForwardIterator> _ForwardIterator std::next(_ForwardIterator, typename std::iterator_traits<_Iter>::difference_type)
     next(_ForwardIterator __x, typename
     ^~~~