# In need of help :"))

I’m pretty sure , this code works but the UVa Judge shows wrong answer.

My solution:

``````   #include <bits/stdc++.h>
using namespace std;
# define ll  long long  int
# define ld  long double
#define fin0(i,a,b,c) for(int i=a;i<b;i+=c)
#define fin1(i,a,b,c) for(int i=a;i<=b;i+=c)
#define fde0(i,a,b,c) for(int i=a;i>b;i-=c)
#define fde1(i,a,b,c) for(int i=a;i>=b;i-=c)
#define vi vector<int>
#define vll vector<ll>
#define vboo vector<bool>
#define all(a) a.begin(),a.end()
# define pb push_back
# define pp pop_back
# define ff first
# define ss second
# define mpp make_pair
# define ac accumulate
# define mod 1000000007
# define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define t     \
int t;    \
cin >> t; \
while (t--)
# define trace1(x)                cerr << #x << ": " << x << "\n";
# define trace2(x, y)             cerr << #x << ": " << x << " | " << #y << ": " << y << "\n";
# define trace3(x, y, z)          cerr << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": " << z << "\n";
# define trace4(a, b, c, d)       cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " << c << " | " << #d << ": " << d << "\n";
const ll INF= 1e18;

vector<bool> visited;
vector<int> tin;
vector<int> low;
vector<bool> points;
void dfs(int v,vector<vector<int>> &adj,vector<int> &tin,vector<int>&low,int &timer,vector<bool> &visited, int V, vector<bool> &points, int p = -1){
visited[v] = true;
tin[v] = low[v] = timer++;
int children = 0;
if(to == p) continue;
if(visited[to]) low[v] = min(low[v],tin[to]);
else{
low[v] = min(low[v], low[to]);
if(low[to] >= tin[v] && p!=-1){
points[v] = true;
}
++children;
}
}
if(p==-1 && children>1){
points[v] = true;
}
}
void findarti(vector<vector<int>> &adj, int V, int E){
visited.assign(V,false);
tin.assign(V,-1);
low.assign(V,-1);
points.assign(V,false);
int timer = 0;
for(int i=0; i<V; i++){
if(!visited[i])
}
}
int main(){
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// #endif
IOS;
int cas =0;
while(true){
cas++;
int V;
cin>>V;
if(!V) break;
unordered_map<string,int> mp;
vector<string> order(V);
string str;
fin0(i,0,V,1){
cin>>str;
mp[str] = i;
order[i] = str;
}
int E;
cin>>E;
string source , dest;
while(E--){
cin>>source>>dest;
}
int camera=0;
for(auto x: points)
if(x)
camera++;
cout<<"City map #"<<cas<<": "<<camera<<" camera(s) found\n";
for(int i=0; i<points.size(); i++) {
if(points[i]){
cout<<order[i]<<"\n";
}
}
cout<<"\n";
}
return 0;

}
``````

I don’t think you are printing answer in alphabetical order as asked in the question, check with some input which will have multiple answers for same city. There might be some other errors but you can check this first.
And most of the times if OJ gives WA then the solution is wrong

1 Like

You r absolutely correct , I wasn’t printing in alphabetical order(my dumbass :")) . I checked inputs with multiple articulation points, the answer is correct with cities in separate lines but the judge gives me “Presentation error”

``````#include <bits/stdc++.h>
using namespace std;
# define ll  long long  int
# define ld  long double
#define fin0(i,a,b,c) for(int i=a;i<b;i+=c)
#define fin1(i,a,b,c) for(int i=a;i<=b;i+=c)
#define fde0(i,a,b,c) for(int i=a;i>b;i-=c)
#define fde1(i,a,b,c) for(int i=a;i>=b;i-=c)
#define vi vector<int>
#define vll vector<ll>
#define vboo vector<bool>
#define all(a) a.begin(),a.end()
# define pb push_back
# define pp pop_back
# define ff first
# define ss second
# define mpp make_pair
# define ac accumulate
# define mod 1000000007
# define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define t     \
int t;    \
cin >> t; \
while (t--)
# define trace1(x)                cerr << #x << ": " << x << "\n";
# define trace2(x, y)             cerr << #x << ": " << x << " | " << #y << ": " << y << "\n";
# define trace3(x, y, z)          cerr << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": " << z << "\n";
# define trace4(a, b, c, d)       cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " << c << " | " << #d << ": " << d << "\n";
const ll INF= 1e18;

vector<bool> visited;
vector<int> tin;
vector<int> low;
vector<bool> points;
void dfs(int v,vector<vector<int>> &adj,vector<int> &tin,vector<int>&low,int &timer,vector<bool> &visited, int V, vector<bool> &points, int p = -1){
visited[v] = true;
tin[v] = low[v] = timer++;
int children = 0;
if(to == p) continue;
if(visited[to]) low[v] = min(low[v],tin[to]);
else{
low[v] = min(low[v], low[to]);
if(low[to] >= tin[v] && p!=-1){
points[v] = true;
}
++children;
}
}
if(p==-1 && children>1){
points[v] = true;
}
}
void findarti(vector<vector<int>> &adj, int V, int E){
visited.assign(V,false);
tin.assign(V,-1);
low.assign(V,-1);
points.assign(V,false);
int timer = 0;
for(int i=0; i<V; i++){
if(!visited[i])
}
}
int main(){
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// #endif
IOS;
int cas =0;
while(true){
cas++;
int V;
cin>>V;
if(!V) break;
unordered_map<string,int> mp;
vector<string> order(V);
vector<string> ordered;

string str;
fin0(i,0,V,1){
cin>>str;
mp[str] = i;
order[i] = str;
}
int E;
cin>>E;
string source , dest;
while(E--){
cin>>source>>dest;
}
int camera=0;
for(auto x: points)
if(x)
camera++;
cout<<"City map #"<<cas<<": "<<camera<<" camera(s) found\n";
for(int i=0; i<points.size(); i++) {
if(points[i]){
ordered.push_back(order[i]);
}
}
sort(ordered.begin(),ordered.end());
for(int i = 0; i<ordered.size();i++){
cout<<ordered[i]<<"\n";
}
cout<<"\n";
}
return 0;

}``````