제출 #779057

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
779057		vjudge1	Teoretičar (COCI18_teoreticar)	C++17	13 / 130	12097 ms	80888 KiB

teoreticar

#include <bits/stdc++.h>

using namespace std;

typedef long long lo; 

#define fi first
#define se second
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo inf = 1000000000;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,a[li],k,flag,t,l,r,cev[li];
string s;
map<pair<int,int>,int> mpp,mpp1;
vector<pair<int,int>> v[li];

int main(void){
	scanf("%d %d %d",&l,&r,&m);
	for(int i=1;i<=m;i++){
		int x,y;
		scanf("%d %d",&x,&y);
		v[x].pb({y,i});
		//~ v[y].pb({x,i});
	}
	int mx=0;
	for(int i=1;i<=l;i++){
		for(auto go:v[i]){
			for(int j=1;j<=100000000;j++){
				if(mpp.find({go.fi,j})==mpp.end() && mpp1.find({i,j})==mpp1.end()){
					mpp[{go.fi,j}]=1;
					mpp1[{i,j}]=1;
					cev[go.se]=j;
					mx=max(mx,j);
					break;
				}
			}
		}
	}
	printf("%d\n",mx);
	for(int i=1;i<=m;i++)printf("%d\n",cev[i]);
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

teoreticar.cpp: In function 'int main()':
teoreticar.cpp:26:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |  scanf("%d %d %d",&l,&r,&m);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~
teoreticar.cpp:29:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |   scanf("%d %d",&x,&y);
      |   ~~~~~^~~~~~~~~~~~~~~

• Subtask 1: 0 / 13
• Subtask 2: 13 / 13
• Subtask 3: 0 / 13
• Subtask 4: 0 / 13
• Subtask 5: 0 / 13
• Subtask 6: 0 / 13
• Subtask 7: 0 / 13
• Subtask 8: 0 / 13
• Subtask 9: 0 / 13
• Subtask 10: 0 / 13