oj.uz

Submission #779057

# Submission time Handle Problem Language Result Execution time Memory
779057 2023-07-11T07:00:07 Z vjudge1 Teoretičar (COCI18_teoreticar) C++17
13 / 130
 12000 ms 80888 KB 
#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;
}

Compilation message

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.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 11988 KB too many colors
2 Halted 0 ms 0 KB -

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12056 KB Output is correct
2 Correct 6 ms 11988 KB Output is correct
3 Correct 6 ms 11988 KB Output is correct
4 Correct 6 ms 11964 KB Output is correct
5 Correct 6 ms 12056 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 12756 KB too many colors
2 Halted 0 ms 0 KB -

Subtask #4
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 12756 KB Output is correct
2 Correct 12 ms 12836 KB Output is correct
3 Correct 10 ms 12756 KB Output is correct
4 Incorrect 11 ms 12756 KB too many colors
5 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 622 ms 66940 KB too many colors
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 601 ms 66936 KB too many colors
2 Halted 0 ms 0 KB -

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 12018 ms 22960 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 12097 ms 80888 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 12056 ms 40300 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 12027 ms 26472 KB Time limit exceeded
2 Halted 0 ms 0 KB -