Submission #577582

#	Time	Username	Problem	Language	Result	Execution time	Memory
577582		juggernaut	Roads (CEOI20_roads)	C++14	0 / 100	1 ms	212 KiB

roads

#include<bits/stdc++.h>
#define fr first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
#define USING_ORDERED_SET 0
#if USING_ORDERED_SET
#include<bits/extc++.h>
using namespace __gnu_pbds;
template<class T>using ordered_set=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
#endif
template<class T>void umax(T &a,T b){if(a<b)a=b;}
template<class T>void umin(T &a,T b){if(b<a)a=b;}
#ifdef juggernaut
    #define printl(args...) printf(args)
#else
    #define printl(args...) 0
#endif
pair<int,int>a[100005];
pair<int,int>b[100005];
int n;
const int inf=1e9;
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
		scanf("%d%d%d%d",&a[i].fr,&a[i].sc,&b[i].fr,&b[i].sc);
	if(a[1].fr==b[1].fr){
		//VERTICAL
		map<int,vector<int>>mp;		
		for(int i=1;i<=n;i++){
			mp[a[i].fr].push_back(a[i].sc);
			mp[a[i].fr].push_back(b[i].sc);
		}
		int prev=inf;
		for(auto &tmp:mp){
			int a=tmp.fr;
			vector<int>&b=tmp.sc;
			sort(b.begin(),b.end());
			for(int i=1;i+1<(int)b.size();i++)
				printf("%d %d %d %d\n",a,b[i],a,b[i+1]);
			if(prev^inf){
				printf("%d %d %d %d\n",prev,mp[prev][0],a,b[0]);
				prev=a;
			}
		}
	}else exit(1);
}

Compilation message (stderr)

roads.cpp: In function 'int main()':
roads.cpp:25:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |  scanf("%d",&n);
      |  ~~~~~^~~~~~~~~
roads.cpp:27:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |   scanf("%d%d%d%d",&a[i].fr,&a[i].sc,&b[i].fr,&b[i].sc);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 0
• Subtask 2: 0 / 15
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 40