38 lines
554 B
C++
38 lines
554 B
C++
|
#include<bits/stdc++.h>
|
||
|
|
using namespace std;
|
||
|
|
|
||
|
|
struct Node{
|
||
|
|
vector<int> next;
|
||
|
|
int t;
|
||
|
|
};
|
||
|
|
|
||
|
|
const int MAX_N = 2e5+5;
|
||
|
|
int n,m,k;
|
||
|
|
int t[MAX_N];
|
||
|
|
Node map[MAX_N];
|
||
|
|
|
||
|
|
int readint();
|
||
|
|
|
||
|
|
int main(){
|
||
|
|
n=readint(),m=readint(),k=readint();
|
||
|
|
for(int i=1;i<=n;i++){
|
||
|
|
t[i]=readint();
|
||
|
|
}
|
||
|
|
for(int i=1;i<=m;i++){
|
||
|
|
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
int readint(){
|
||
|
|
int x=0,w=1;
|
||
|
|
char ch=0;
|
||
|
|
while(!isdigit(ch)){
|
||
|
|
if(ch=='-')w=-1;
|
||
|
|
ch=getchar();
|
||
|
|
}
|
||
|
|
while(isdigit(ch)){
|
||
|
|
x=x*10+(ch-'0');
|
||
|
|
ch=getchar();
|
||
|
|
}
|
||
|
|
return x*w;
|
||
|
|
}
|